./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34e208c7-5898-4e5b-99a7-d9658db418a3/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34e208c7-5898-4e5b-99a7-d9658db418a3/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34e208c7-5898-4e5b-99a7-d9658db418a3/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34e208c7-5898-4e5b-99a7-d9658db418a3/bin/utaipan-EQgc7hIp5V/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34e208c7-5898-4e5b-99a7-d9658db418a3/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34e208c7-5898-4e5b-99a7-d9658db418a3/bin/utaipan-EQgc7hIp5V --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1fa38cbba4031a56736a5ec3c724b1da0a42c893b0e9010b5807defb3e1b19fa --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 03:55:22,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 03:55:22,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 03:55:22,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 03:55:22,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 03:55:22,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 03:55:22,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 03:55:22,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 03:55:22,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 03:55:22,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 03:55:22,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 03:55:22,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 03:55:22,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 03:55:22,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 03:55:22,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 03:55:22,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 03:55:22,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 03:55:22,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 03:55:22,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 03:55:22,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 03:55:22,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 03:55:22,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 03:55:22,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 03:55:22,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 03:55:22,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 03:55:22,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 03:55:22,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 03:55:22,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 03:55:22,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 03:55:22,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 03:55:22,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 03:55:22,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 03:55:22,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 03:55:22,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 03:55:22,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 03:55:22,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 03:55:22,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 03:55:22,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 03:55:22,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 03:55:22,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 03:55:22,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 03:55:22,743 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34e208c7-5898-4e5b-99a7-d9658db418a3/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-23 03:55:22,798 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 03:55:22,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 03:55:22,799 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 03:55:22,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 03:55:22,808 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 03:55:22,808 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 03:55:22,808 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 03:55:22,809 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 03:55:22,809 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 03:55:22,809 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 03:55:22,810 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 03:55:22,811 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 03:55:22,811 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 03:55:22,811 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 03:55:22,812 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 03:55:22,812 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 03:55:22,812 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 03:55:22,812 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 03:55:22,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 03:55:22,813 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 03:55:22,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 03:55:22,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 03:55:22,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 03:55:22,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 03:55:22,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 03:55:22,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 03:55:22,816 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 03:55:22,817 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 03:55:22,817 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 03:55:22,817 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 03:55:22,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 03:55:22,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 03:55:22,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:55:22,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 03:55:22,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 03:55:22,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 03:55:22,819 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 03:55:22,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 03:55:22,819 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 03:55:22,819 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 03:55:22,820 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 03:55:22,820 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34e208c7-5898-4e5b-99a7-d9658db418a3/bin/utaipan-EQgc7hIp5V/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_34e208c7-5898-4e5b-99a7-d9658db418a3/bin/utaipan-EQgc7hIp5V Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1fa38cbba4031a56736a5ec3c724b1da0a42c893b0e9010b5807defb3e1b19fa [2021-11-23 03:55:23,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 03:55:23,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 03:55:23,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 03:55:23,182 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 03:55:23,183 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 03:55:23,185 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34e208c7-5898-4e5b-99a7-d9658db418a3/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2021-11-23 03:55:23,256 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34e208c7-5898-4e5b-99a7-d9658db418a3/bin/utaipan-EQgc7hIp5V/data/52781cd03/a369e939782a4d61950d1c3e2c8b81d7/FLAG0b763ea43 [2021-11-23 03:55:23,774 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 03:55:23,774 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34e208c7-5898-4e5b-99a7-d9658db418a3/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2021-11-23 03:55:23,791 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34e208c7-5898-4e5b-99a7-d9658db418a3/bin/utaipan-EQgc7hIp5V/data/52781cd03/a369e939782a4d61950d1c3e2c8b81d7/FLAG0b763ea43 [2021-11-23 03:55:24,092 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34e208c7-5898-4e5b-99a7-d9658db418a3/bin/utaipan-EQgc7hIp5V/data/52781cd03/a369e939782a4d61950d1c3e2c8b81d7 [2021-11-23 03:55:24,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 03:55:24,096 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 03:55:24,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 03:55:24,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 03:55:24,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 03:55:24,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:55:24" (1/1) ... [2021-11-23 03:55:24,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43245a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:24, skipping insertion in model container [2021-11-23 03:55:24,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:55:24" (1/1) ... [2021-11-23 03:55:24,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 03:55:24,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 03:55:24,410 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_34e208c7-5898-4e5b-99a7-d9658db418a3/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2021-11-23 03:55:24,527 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:55:24,551 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 03:55:24,569 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_34e208c7-5898-4e5b-99a7-d9658db418a3/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2021-11-23 03:55:24,714 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:55:24,735 INFO L208 MainTranslator]: Completed translation [2021-11-23 03:55:24,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:24 WrapperNode [2021-11-23 03:55:24,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 03:55:24,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 03:55:24,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 03:55:24,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 03:55:24,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:24" (1/1) ... [2021-11-23 03:55:24,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:24" (1/1) ... [2021-11-23 03:55:24,852 INFO L137 Inliner]: procedures = 38, calls = 62, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 916 [2021-11-23 03:55:24,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 03:55:24,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 03:55:24,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 03:55:24,855 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 03:55:24,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:24" (1/1) ... [2021-11-23 03:55:24,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:24" (1/1) ... [2021-11-23 03:55:24,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:24" (1/1) ... [2021-11-23 03:55:24,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:24" (1/1) ... [2021-11-23 03:55:24,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:24" (1/1) ... [2021-11-23 03:55:24,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:24" (1/1) ... [2021-11-23 03:55:24,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:24" (1/1) ... [2021-11-23 03:55:24,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 03:55:24,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 03:55:24,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 03:55:24,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 03:55:24,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:24" (1/1) ... [2021-11-23 03:55:24,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:55:24,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34e208c7-5898-4e5b-99a7-d9658db418a3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:55:24,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34e208c7-5898-4e5b-99a7-d9658db418a3/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 03:55:25,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34e208c7-5898-4e5b-99a7-d9658db418a3/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 03:55:25,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 03:55:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2021-11-23 03:55:25,058 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2021-11-23 03:55:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-11-23 03:55:25,059 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-11-23 03:55:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-11-23 03:55:25,059 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-11-23 03:55:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-11-23 03:55:25,060 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-11-23 03:55:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 03:55:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-11-23 03:55:25,060 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-11-23 03:55:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 03:55:25,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 03:55:25,348 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 03:55:25,349 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 03:55:25,366 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-23 03:55:25,496 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-11-23 03:55:25,497 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-11-23 03:55:25,497 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-23 03:55:25,517 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-11-23 03:55:25,518 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-11-23 03:55:25,535 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-23 03:55:25,541 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-23 03:55:25,546 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-23 03:55:25,551 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-23 03:55:25,553 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-23 03:55:25,556 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-23 03:55:25,558 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-23 03:55:25,558 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-23 03:55:25,564 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-23 03:55:26,258 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2021-11-23 03:55:26,259 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2021-11-23 03:55:26,259 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##171: assume !false; [2021-11-23 03:55:26,259 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##170: assume false; [2021-11-23 03:55:26,259 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##75: assume !false; [2021-11-23 03:55:26,260 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##74: assume false; [2021-11-23 03:55:26,260 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume !false; [2021-11-23 03:55:26,260 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume false; [2021-11-23 03:55:26,260 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume !false; [2021-11-23 03:55:26,261 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume false; [2021-11-23 03:55:26,261 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2021-11-23 03:55:26,261 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2021-11-23 03:55:26,262 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##109: assume false; [2021-11-23 03:55:26,262 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##110: assume !false; [2021-11-23 03:55:26,262 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##119: assume !false; [2021-11-23 03:55:26,262 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##118: assume false; [2021-11-23 03:55:26,264 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##122: assume false; [2021-11-23 03:55:26,264 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##123: assume !false; [2021-11-23 03:55:26,272 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-23 03:55:26,320 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-11-23 03:55:26,320 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-11-23 03:55:26,327 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 03:55:26,471 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 03:55:26,471 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 03:55:26,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:26 BoogieIcfgContainer [2021-11-23 03:55:26,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 03:55:26,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 03:55:26,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 03:55:26,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 03:55:26,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:55:24" (1/3) ... [2021-11-23 03:55:26,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494496f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:55:26, skipping insertion in model container [2021-11-23 03:55:26,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:24" (2/3) ... [2021-11-23 03:55:26,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494496f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:55:26, skipping insertion in model container [2021-11-23 03:55:26,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:26" (3/3) ... [2021-11-23 03:55:26,486 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2021-11-23 03:55:26,493 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 03:55:26,493 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 03:55:26,557 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 03:55:26,566 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 03:55:26,566 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-23 03:55:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 118 states have (on average 1.5677966101694916) internal successors, (185), 139 states have internal predecessors, (185), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 32 states have call predecessors, (37), 37 states have call successors, (37) [2021-11-23 03:55:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 03:55:26,606 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:26,607 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:26,608 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:26,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:26,619 INFO L85 PathProgramCache]: Analyzing trace with hash -895816572, now seen corresponding path program 1 times [2021-11-23 03:55:26,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:26,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588795788] [2021-11-23 03:55:26,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:26,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:26,937 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:26,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588795788] [2021-11-23 03:55:26,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588795788] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:26,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:26,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:55:26,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101592127] [2021-11-23 03:55:26,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:26,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:55:26,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:26,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:55:26,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:26,996 INFO L87 Difference]: Start difference. First operand has 162 states, 118 states have (on average 1.5677966101694916) internal successors, (185), 139 states have internal predecessors, (185), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 32 states have call predecessors, (37), 37 states have call successors, (37) 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, (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) [2021-11-23 03:55:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:27,358 INFO L93 Difference]: Finished difference Result 328 states and 527 transitions. [2021-11-23 03:55:27,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:55:27,361 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, (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 10 [2021-11-23 03:55:27,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:27,393 INFO L225 Difference]: With dead ends: 328 [2021-11-23 03:55:27,394 INFO L226 Difference]: Without dead ends: 194 [2021-11-23 03:55:27,400 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:55:27,404 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 109 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:27,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 315 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:55:27,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-11-23 03:55:27,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2021-11-23 03:55:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 151 states have (on average 1.4105960264900663) internal successors, (213), 160 states have internal predecessors, (213), 33 states have call successors, (33), 9 states have call predecessors, (33), 6 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2021-11-23 03:55:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 272 transitions. [2021-11-23 03:55:27,528 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 272 transitions. Word has length 10 [2021-11-23 03:55:27,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:27,529 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 272 transitions. [2021-11-23 03:55:27,529 INFO L471 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, (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) [2021-11-23 03:55:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 272 transitions. [2021-11-23 03:55:27,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 03:55:27,535 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:27,535 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:27,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 03:55:27,543 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:27,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash -712687265, now seen corresponding path program 1 times [2021-11-23 03:55:27,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:27,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367447104] [2021-11-23 03:55:27,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:27,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:27,667 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:27,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367447104] [2021-11-23 03:55:27,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367447104] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:27,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:27,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:55:27,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938728620] [2021-11-23 03:55:27,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:27,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:55:27,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:27,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:55:27,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:27,672 INFO L87 Difference]: Start difference. First operand 191 states and 272 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2021-11-23 03:55:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:27,797 INFO L93 Difference]: Finished difference Result 407 states and 575 transitions. [2021-11-23 03:55:27,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:55:27,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2021-11-23 03:55:27,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:27,809 INFO L225 Difference]: With dead ends: 407 [2021-11-23 03:55:27,810 INFO L226 Difference]: Without dead ends: 301 [2021-11-23 03:55:27,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:27,819 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 188 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:27,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 293 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:27,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-23 03:55:27,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 277. [2021-11-23 03:55:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 222 states have (on average 1.3918918918918919) internal successors, (309), 228 states have internal predecessors, (309), 42 states have call successors, (42), 16 states have call predecessors, (42), 12 states have return successors, (44), 33 states have call predecessors, (44), 34 states have call successors, (44) [2021-11-23 03:55:27,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 395 transitions. [2021-11-23 03:55:27,893 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 395 transitions. Word has length 10 [2021-11-23 03:55:27,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:27,893 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 395 transitions. [2021-11-23 03:55:27,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2021-11-23 03:55:27,893 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 395 transitions. [2021-11-23 03:55:27,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 03:55:27,898 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:27,899 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:27,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 03:55:27,899 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:27,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:27,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1256181749, now seen corresponding path program 1 times [2021-11-23 03:55:27,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:27,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599665964] [2021-11-23 03:55:27,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:27,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:27,937 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:27,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599665964] [2021-11-23 03:55:27,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599665964] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:27,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:27,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 03:55:27,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106387998] [2021-11-23 03:55:27,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:27,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:55:27,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:27,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:55:27,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:27,940 INFO L87 Difference]: Start difference. First operand 277 states and 395 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) [2021-11-23 03:55:28,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:28,024 INFO L93 Difference]: Finished difference Result 295 states and 418 transitions. [2021-11-23 03:55:28,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:55:28,024 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 [2021-11-23 03:55:28,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:28,028 INFO L225 Difference]: With dead ends: 295 [2021-11-23 03:55:28,028 INFO L226 Difference]: Without dead ends: 277 [2021-11-23 03:55:28,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:28,030 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 108 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:28,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 249 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:28,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-11-23 03:55:28,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2021-11-23 03:55:28,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 222 states have (on average 1.3873873873873874) internal successors, (308), 228 states have internal predecessors, (308), 42 states have call successors, (42), 16 states have call predecessors, (42), 12 states have return successors, (44), 33 states have call predecessors, (44), 34 states have call successors, (44) [2021-11-23 03:55:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 394 transitions. [2021-11-23 03:55:28,061 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 394 transitions. Word has length 11 [2021-11-23 03:55:28,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:28,061 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 394 transitions. [2021-11-23 03:55:28,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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) [2021-11-23 03:55:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 394 transitions. [2021-11-23 03:55:28,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 03:55:28,063 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:28,063 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:28,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 03:55:28,064 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:28,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:28,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1275264453, now seen corresponding path program 1 times [2021-11-23 03:55:28,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:28,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494151483] [2021-11-23 03:55:28,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:28,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:28,169 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:28,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494151483] [2021-11-23 03:55:28,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494151483] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:28,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:28,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:55:28,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85061737] [2021-11-23 03:55:28,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:28,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:55:28,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:28,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:55:28,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:28,172 INFO L87 Difference]: Start difference. First operand 277 states and 394 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2021-11-23 03:55:28,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:28,251 INFO L93 Difference]: Finished difference Result 342 states and 476 transitions. [2021-11-23 03:55:28,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:55:28,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 14 [2021-11-23 03:55:28,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:28,255 INFO L225 Difference]: With dead ends: 342 [2021-11-23 03:55:28,255 INFO L226 Difference]: Without dead ends: 324 [2021-11-23 03:55:28,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:28,257 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 188 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:28,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 232 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:28,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-11-23 03:55:28,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 308. [2021-11-23 03:55:28,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 248 states have (on average 1.375) internal successors, (341), 254 states have internal predecessors, (341), 44 states have call successors, (44), 19 states have call predecessors, (44), 15 states have return successors, (47), 36 states have call predecessors, (47), 37 states have call successors, (47) [2021-11-23 03:55:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 432 transitions. [2021-11-23 03:55:28,287 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 432 transitions. Word has length 14 [2021-11-23 03:55:28,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:28,288 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 432 transitions. [2021-11-23 03:55:28,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2021-11-23 03:55:28,288 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 432 transitions. [2021-11-23 03:55:28,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-23 03:55:28,291 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:28,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:28,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 03:55:28,291 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:28,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:28,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1403264129, now seen corresponding path program 1 times [2021-11-23 03:55:28,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:28,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92840977] [2021-11-23 03:55:28,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:28,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:28,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:28,341 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:28,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92840977] [2021-11-23 03:55:28,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92840977] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:28,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:28,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:55:28,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598423574] [2021-11-23 03:55:28,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:28,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:55:28,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:28,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:55:28,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:28,345 INFO L87 Difference]: Start difference. First operand 308 states and 432 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2021-11-23 03:55:28,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:28,534 INFO L93 Difference]: Finished difference Result 408 states and 576 transitions. [2021-11-23 03:55:28,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:55:28,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2021-11-23 03:55:28,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:28,540 INFO L225 Difference]: With dead ends: 408 [2021-11-23 03:55:28,541 INFO L226 Difference]: Without dead ends: 405 [2021-11-23 03:55:28,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:28,544 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 73 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:28,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 374 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:55:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-11-23 03:55:28,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 334. [2021-11-23 03:55:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 271 states have (on average 1.3874538745387455) internal successors, (376), 279 states have internal predecessors, (376), 45 states have call successors, (45), 20 states have call predecessors, (45), 17 states have return successors, (49), 36 states have call predecessors, (49), 38 states have call successors, (49) [2021-11-23 03:55:28,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 470 transitions. [2021-11-23 03:55:28,592 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 470 transitions. Word has length 19 [2021-11-23 03:55:28,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:28,593 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 470 transitions. [2021-11-23 03:55:28,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2021-11-23 03:55:28,593 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 470 transitions. [2021-11-23 03:55:28,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-23 03:55:28,602 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:28,602 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:28,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 03:55:28,603 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:28,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:28,604 INFO L85 PathProgramCache]: Analyzing trace with hash 634449887, now seen corresponding path program 1 times [2021-11-23 03:55:28,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:28,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508827617] [2021-11-23 03:55:28,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:28,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:28,771 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:28,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508827617] [2021-11-23 03:55:28,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508827617] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:28,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:28,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:55:28,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56889763] [2021-11-23 03:55:28,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:28,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:55:28,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:28,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:55:28,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:55:28,778 INFO L87 Difference]: Start difference. First operand 334 states and 470 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) [2021-11-23 03:55:29,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:29,004 INFO L93 Difference]: Finished difference Result 343 states and 481 transitions. [2021-11-23 03:55:29,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:55:29,005 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 [2021-11-23 03:55:29,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:29,011 INFO L225 Difference]: With dead ends: 343 [2021-11-23 03:55:29,012 INFO L226 Difference]: Without dead ends: 340 [2021-11-23 03:55:29,012 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:55:29,015 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 192 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:29,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 259 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:55:29,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-23 03:55:29,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2021-11-23 03:55:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 277 states have (on average 1.3826714801444044) internal successors, (383), 284 states have internal predecessors, (383), 45 states have call successors, (45), 21 states have call predecessors, (45), 17 states have return successors, (49), 36 states have call predecessors, (49), 38 states have call successors, (49) [2021-11-23 03:55:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 477 transitions. [2021-11-23 03:55:29,058 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 477 transitions. Word has length 20 [2021-11-23 03:55:29,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:29,059 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 477 transitions. [2021-11-23 03:55:29,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2021-11-23 03:55:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 477 transitions. [2021-11-23 03:55:29,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-23 03:55:29,062 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:29,062 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:29,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 03:55:29,063 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:29,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:29,064 INFO L85 PathProgramCache]: Analyzing trace with hash -789620959, now seen corresponding path program 1 times [2021-11-23 03:55:29,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:29,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521157726] [2021-11-23 03:55:29,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:29,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:29,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:29,207 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:29,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521157726] [2021-11-23 03:55:29,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521157726] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:29,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:29,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:55:29,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855310179] [2021-11-23 03:55:29,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:29,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:55:29,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:29,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:55:29,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:55:29,211 INFO L87 Difference]: Start difference. First operand 340 states and 477 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) [2021-11-23 03:55:29,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:29,464 INFO L93 Difference]: Finished difference Result 397 states and 543 transitions. [2021-11-23 03:55:29,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:55:29,465 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 [2021-11-23 03:55:29,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:29,474 INFO L225 Difference]: With dead ends: 397 [2021-11-23 03:55:29,474 INFO L226 Difference]: Without dead ends: 334 [2021-11-23 03:55:29,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:55:29,479 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 284 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:29,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 246 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:55:29,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-11-23 03:55:29,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2021-11-23 03:55:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 271 states have (on average 1.3616236162361623) internal successors, (369), 278 states have internal predecessors, (369), 45 states have call successors, (45), 21 states have call predecessors, (45), 17 states have return successors, (49), 36 states have call predecessors, (49), 38 states have call successors, (49) [2021-11-23 03:55:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 463 transitions. [2021-11-23 03:55:29,530 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 463 transitions. Word has length 20 [2021-11-23 03:55:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:29,530 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 463 transitions. [2021-11-23 03:55:29,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2021-11-23 03:55:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 463 transitions. [2021-11-23 03:55:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 03:55:29,532 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:29,532 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:29,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 03:55:29,532 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:29,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:29,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1896156808, now seen corresponding path program 1 times [2021-11-23 03:55:29,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:29,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419354473] [2021-11-23 03:55:29,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:29,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:29,567 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:29,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419354473] [2021-11-23 03:55:29,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419354473] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:29,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:29,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:55:29,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760355711] [2021-11-23 03:55:29,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:29,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:55:29,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:29,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:55:29,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:29,572 INFO L87 Difference]: Start difference. First operand 334 states and 463 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, (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) [2021-11-23 03:55:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:29,690 INFO L93 Difference]: Finished difference Result 358 states and 491 transitions. [2021-11-23 03:55:29,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:55:29,691 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, (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 21 [2021-11-23 03:55:29,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:29,695 INFO L225 Difference]: With dead ends: 358 [2021-11-23 03:55:29,696 INFO L226 Difference]: Without dead ends: 353 [2021-11-23 03:55:29,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:29,698 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 17 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:29,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 308 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:29,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-11-23 03:55:29,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2021-11-23 03:55:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 288 states have (on average 1.3541666666666667) internal successors, (390), 294 states have internal predecessors, (390), 45 states have call successors, (45), 21 states have call predecessors, (45), 17 states have return successors, (49), 36 states have call predecessors, (49), 38 states have call successors, (49) [2021-11-23 03:55:29,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 484 transitions. [2021-11-23 03:55:29,737 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 484 transitions. Word has length 21 [2021-11-23 03:55:29,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:29,737 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 484 transitions. [2021-11-23 03:55:29,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2021-11-23 03:55:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 484 transitions. [2021-11-23 03:55:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 03:55:29,739 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:29,739 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:29,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-23 03:55:29,739 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:29,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1824395935, now seen corresponding path program 1 times [2021-11-23 03:55:29,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:29,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919169138] [2021-11-23 03:55:29,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:29,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:29,800 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:29,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919169138] [2021-11-23 03:55:29,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919169138] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:29,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:29,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:55:29,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418843191] [2021-11-23 03:55:29,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:29,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:55:29,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:29,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:55:29,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:29,804 INFO L87 Difference]: Start difference. First operand 351 states and 484 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2021-11-23 03:55:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:29,932 INFO L93 Difference]: Finished difference Result 549 states and 763 transitions. [2021-11-23 03:55:29,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:55:29,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 21 [2021-11-23 03:55:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:29,937 INFO L225 Difference]: With dead ends: 549 [2021-11-23 03:55:29,937 INFO L226 Difference]: Without dead ends: 354 [2021-11-23 03:55:29,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:29,941 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:29,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-11-23 03:55:29,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2021-11-23 03:55:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 291 states have (on average 1.3539518900343643) internal successors, (394), 297 states have internal predecessors, (394), 45 states have call successors, (45), 21 states have call predecessors, (45), 17 states have return successors, (49), 36 states have call predecessors, (49), 38 states have call successors, (49) [2021-11-23 03:55:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 488 transitions. [2021-11-23 03:55:29,977 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 488 transitions. Word has length 21 [2021-11-23 03:55:29,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:29,980 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 488 transitions. [2021-11-23 03:55:29,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2021-11-23 03:55:29,980 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 488 transitions. [2021-11-23 03:55:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 03:55:29,982 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:29,982 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:29,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 03:55:29,982 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:29,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:29,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1800867366, now seen corresponding path program 1 times [2021-11-23 03:55:29,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:29,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61767553] [2021-11-23 03:55:29,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:29,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:30,066 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:30,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61767553] [2021-11-23 03:55:30,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61767553] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:30,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:30,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 03:55:30,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028460271] [2021-11-23 03:55:30,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:30,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 03:55:30,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:30,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 03:55:30,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:55:30,070 INFO L87 Difference]: Start difference. First operand 354 states and 488 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2021-11-23 03:55:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:30,360 INFO L93 Difference]: Finished difference Result 362 states and 494 transitions. [2021-11-23 03:55:30,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:55:30,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 22 [2021-11-23 03:55:30,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:30,364 INFO L225 Difference]: With dead ends: 362 [2021-11-23 03:55:30,364 INFO L226 Difference]: Without dead ends: 356 [2021-11-23 03:55:30,365 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:55:30,366 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 247 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:30,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 360 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:55:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-11-23 03:55:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2021-11-23 03:55:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 291 states have (on average 1.3505154639175259) internal successors, (393), 297 states have internal predecessors, (393), 45 states have call successors, (45), 21 states have call predecessors, (45), 17 states have return successors, (49), 36 states have call predecessors, (49), 38 states have call successors, (49) [2021-11-23 03:55:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 487 transitions. [2021-11-23 03:55:30,417 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 487 transitions. Word has length 22 [2021-11-23 03:55:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:30,418 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 487 transitions. [2021-11-23 03:55:30,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2021-11-23 03:55:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 487 transitions. [2021-11-23 03:55:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 03:55:30,420 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:30,420 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:30,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-23 03:55:30,421 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:30,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:30,422 INFO L85 PathProgramCache]: Analyzing trace with hash -867769435, now seen corresponding path program 1 times [2021-11-23 03:55:30,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:30,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065295802] [2021-11-23 03:55:30,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:30,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:30,510 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:30,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065295802] [2021-11-23 03:55:30,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065295802] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:30,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:30,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 03:55:30,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281769406] [2021-11-23 03:55:30,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:30,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 03:55:30,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:30,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 03:55:30,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:55:30,513 INFO L87 Difference]: Start difference. First operand 354 states and 487 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2021-11-23 03:55:30,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:30,758 INFO L93 Difference]: Finished difference Result 362 states and 493 transitions. [2021-11-23 03:55:30,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:55:30,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 23 [2021-11-23 03:55:30,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:30,763 INFO L225 Difference]: With dead ends: 362 [2021-11-23 03:55:30,763 INFO L226 Difference]: Without dead ends: 356 [2021-11-23 03:55:30,763 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:55:30,764 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 243 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:30,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 361 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:55:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-11-23 03:55:30,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2021-11-23 03:55:30,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 291 states have (on average 1.3470790378006874) internal successors, (392), 297 states have internal predecessors, (392), 45 states have call successors, (45), 21 states have call predecessors, (45), 17 states have return successors, (49), 36 states have call predecessors, (49), 38 states have call successors, (49) [2021-11-23 03:55:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 486 transitions. [2021-11-23 03:55:30,802 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 486 transitions. Word has length 23 [2021-11-23 03:55:30,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:30,802 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 486 transitions. [2021-11-23 03:55:30,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2021-11-23 03:55:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 486 transitions. [2021-11-23 03:55:30,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-23 03:55:30,804 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:30,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:30,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-23 03:55:30,805 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:30,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:30,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1046964305, now seen corresponding path program 1 times [2021-11-23 03:55:30,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:30,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522243624] [2021-11-23 03:55:30,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:30,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:30,837 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:30,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522243624] [2021-11-23 03:55:30,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522243624] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:30,837 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:30,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 03:55:30,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823178995] [2021-11-23 03:55:30,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:30,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:55:30,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:30,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:55:30,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:55:30,839 INFO L87 Difference]: Start difference. First operand 354 states and 486 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2021-11-23 03:55:30,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:30,939 INFO L93 Difference]: Finished difference Result 368 states and 499 transitions. [2021-11-23 03:55:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:55:30,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 24 [2021-11-23 03:55:30,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:30,943 INFO L225 Difference]: With dead ends: 368 [2021-11-23 03:55:30,943 INFO L226 Difference]: Without dead ends: 352 [2021-11-23 03:55:30,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:55:30,944 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 10 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:30,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 527 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-11-23 03:55:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2021-11-23 03:55:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 290 states have (on average 1.3448275862068966) internal successors, (390), 296 states have internal predecessors, (390), 44 states have call successors, (44), 21 states have call predecessors, (44), 17 states have return successors, (48), 35 states have call predecessors, (48), 37 states have call successors, (48) [2021-11-23 03:55:30,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 482 transitions. [2021-11-23 03:55:30,984 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 482 transitions. Word has length 24 [2021-11-23 03:55:30,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:30,984 INFO L470 AbstractCegarLoop]: Abstraction has 352 states and 482 transitions. [2021-11-23 03:55:30,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2021-11-23 03:55:30,984 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 482 transitions. [2021-11-23 03:55:30,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 03:55:30,986 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:30,986 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:31,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-23 03:55:31,006 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:31,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:31,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1438509192, now seen corresponding path program 1 times [2021-11-23 03:55:31,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:31,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049778147] [2021-11-23 03:55:31,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:31,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:31,048 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:31,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049778147] [2021-11-23 03:55:31,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049778147] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:31,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:31,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 03:55:31,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192382222] [2021-11-23 03:55:31,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:31,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:55:31,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:31,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:55:31,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:55:31,051 INFO L87 Difference]: Start difference. First operand 352 states and 482 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, (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) [2021-11-23 03:55:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:31,200 INFO L93 Difference]: Finished difference Result 396 states and 520 transitions. [2021-11-23 03:55:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:55:31,201 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, (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 [2021-11-23 03:55:31,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:31,203 INFO L225 Difference]: With dead ends: 396 [2021-11-23 03:55:31,203 INFO L226 Difference]: Without dead ends: 271 [2021-11-23 03:55:31,204 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:55:31,205 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 224 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:31,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 352 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-11-23 03:55:31,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 254. [2021-11-23 03:55:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 208 states have (on average 1.2980769230769231) internal successors, (270), 215 states have internal predecessors, (270), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (28), 24 states have call predecessors, (28), 25 states have call successors, (28) [2021-11-23 03:55:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 330 transitions. [2021-11-23 03:55:31,233 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 330 transitions. Word has length 26 [2021-11-23 03:55:31,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:31,233 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 330 transitions. [2021-11-23 03:55:31,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2021-11-23 03:55:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 330 transitions. [2021-11-23 03:55:31,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-23 03:55:31,236 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:31,237 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:31,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-23 03:55:31,237 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:31,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:31,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1281764066, now seen corresponding path program 1 times [2021-11-23 03:55:31,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:31,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155992554] [2021-11-23 03:55:31,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:31,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:31,310 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:31,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155992554] [2021-11-23 03:55:31,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155992554] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:31,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:31,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:55:31,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837799406] [2021-11-23 03:55:31,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:31,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:55:31,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:31,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:55:31,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:31,315 INFO L87 Difference]: Start difference. First operand 254 states and 330 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2021-11-23 03:55:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:31,475 INFO L93 Difference]: Finished difference Result 413 states and 537 transitions. [2021-11-23 03:55:31,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:55:31,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 27 [2021-11-23 03:55:31,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:31,479 INFO L225 Difference]: With dead ends: 413 [2021-11-23 03:55:31,479 INFO L226 Difference]: Without dead ends: 301 [2021-11-23 03:55:31,480 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:55:31,481 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 88 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:31,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 350 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:31,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-23 03:55:31,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 282. [2021-11-23 03:55:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 231 states have (on average 1.29004329004329) internal successors, (298), 237 states have internal predecessors, (298), 34 states have call successors, (34), 17 states have call predecessors, (34), 16 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2021-11-23 03:55:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 366 transitions. [2021-11-23 03:55:31,538 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 366 transitions. Word has length 27 [2021-11-23 03:55:31,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:31,538 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 366 transitions. [2021-11-23 03:55:31,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2021-11-23 03:55:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 366 transitions. [2021-11-23 03:55:31,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 03:55:31,540 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:31,540 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:55:31,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-23 03:55:31,554 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:31,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:31,555 INFO L85 PathProgramCache]: Analyzing trace with hash -226632090, now seen corresponding path program 1 times [2021-11-23 03:55:31,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:31,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577411403] [2021-11-23 03:55:31,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:31,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:31,700 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:31,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577411403] [2021-11-23 03:55:31,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577411403] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:31,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:31,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:55:31,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526283854] [2021-11-23 03:55:31,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:31,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:55:31,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:31,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:55:31,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:31,702 INFO L87 Difference]: Start difference. First operand 282 states and 366 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2021-11-23 03:55:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:31,794 INFO L93 Difference]: Finished difference Result 421 states and 553 transitions. [2021-11-23 03:55:31,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:55:31,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 28 [2021-11-23 03:55:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:31,797 INFO L225 Difference]: With dead ends: 421 [2021-11-23 03:55:31,798 INFO L226 Difference]: Without dead ends: 275 [2021-11-23 03:55:31,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:31,799 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 9 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:31,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 334 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:31,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-11-23 03:55:31,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2021-11-23 03:55:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 225 states have (on average 1.2755555555555556) internal successors, (287), 230 states have internal predecessors, (287), 33 states have call successors, (33), 17 states have call predecessors, (33), 16 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2021-11-23 03:55:31,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 354 transitions. [2021-11-23 03:55:31,832 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 354 transitions. Word has length 28 [2021-11-23 03:55:31,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:31,832 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 354 transitions. [2021-11-23 03:55:31,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2021-11-23 03:55:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 354 transitions. [2021-11-23 03:55:31,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-23 03:55:31,834 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:31,834 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:55:31,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-23 03:55:31,835 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:31,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:31,836 INFO L85 PathProgramCache]: Analyzing trace with hash 432097931, now seen corresponding path program 1 times [2021-11-23 03:55:31,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:31,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059634423] [2021-11-23 03:55:31,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:31,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:31,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:31,919 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:31,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059634423] [2021-11-23 03:55:31,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059634423] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:31,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:31,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 03:55:31,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331322742] [2021-11-23 03:55:31,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:31,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 03:55:31,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:31,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 03:55:31,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:55:31,922 INFO L87 Difference]: Start difference. First operand 275 states and 354 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) [2021-11-23 03:55:32,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:32,218 INFO L93 Difference]: Finished difference Result 439 states and 569 transitions. [2021-11-23 03:55:32,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:55:32,219 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, (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 30 [2021-11-23 03:55:32,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:32,221 INFO L225 Difference]: With dead ends: 439 [2021-11-23 03:55:32,221 INFO L226 Difference]: Without dead ends: 300 [2021-11-23 03:55:32,222 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:55:32,223 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 200 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:32,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 371 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:55:32,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-11-23 03:55:32,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 275. [2021-11-23 03:55:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 225 states have (on average 1.271111111111111) internal successors, (286), 230 states have internal predecessors, (286), 33 states have call successors, (33), 17 states have call predecessors, (33), 16 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2021-11-23 03:55:32,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 353 transitions. [2021-11-23 03:55:32,250 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 353 transitions. Word has length 30 [2021-11-23 03:55:32,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:32,251 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 353 transitions. [2021-11-23 03:55:32,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) [2021-11-23 03:55:32,251 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 353 transitions. [2021-11-23 03:55:32,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-23 03:55:32,252 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:32,253 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:32,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-23 03:55:32,253 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:32,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:32,254 INFO L85 PathProgramCache]: Analyzing trace with hash -455601338, now seen corresponding path program 1 times [2021-11-23 03:55:32,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:32,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183399051] [2021-11-23 03:55:32,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:32,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:32,312 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:32,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183399051] [2021-11-23 03:55:32,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183399051] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:32,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:32,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 03:55:32,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225398062] [2021-11-23 03:55:32,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:32,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:55:32,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:32,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:55:32,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:55:32,315 INFO L87 Difference]: Start difference. First operand 275 states and 353 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) [2021-11-23 03:55:32,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:32,721 INFO L93 Difference]: Finished difference Result 347 states and 441 transitions. [2021-11-23 03:55:32,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 03:55:32,722 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 [2021-11-23 03:55:32,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:32,725 INFO L225 Difference]: With dead ends: 347 [2021-11-23 03:55:32,725 INFO L226 Difference]: Without dead ends: 304 [2021-11-23 03:55:32,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-23 03:55:32,726 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 211 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:32,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 459 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 03:55:32,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-11-23 03:55:32,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 275. [2021-11-23 03:55:32,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 225 states have (on average 1.2622222222222221) internal successors, (284), 230 states have internal predecessors, (284), 33 states have call successors, (33), 17 states have call predecessors, (33), 16 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2021-11-23 03:55:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 351 transitions. [2021-11-23 03:55:32,755 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 351 transitions. Word has length 29 [2021-11-23 03:55:32,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:32,756 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 351 transitions. [2021-11-23 03:55:32,756 INFO L471 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) [2021-11-23 03:55:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 351 transitions. [2021-11-23 03:55:32,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-23 03:55:32,757 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:32,757 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:55:32,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-23 03:55:32,758 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:32,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:32,758 INFO L85 PathProgramCache]: Analyzing trace with hash 163860816, now seen corresponding path program 1 times [2021-11-23 03:55:32,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:32,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700268566] [2021-11-23 03:55:32,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:32,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:32,942 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:32,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700268566] [2021-11-23 03:55:32,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700268566] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:32,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:32,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 03:55:32,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585687709] [2021-11-23 03:55:32,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:32,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 03:55:32,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:32,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 03:55:32,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-23 03:55:32,945 INFO L87 Difference]: Start difference. First operand 275 states and 351 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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) [2021-11-23 03:55:33,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:33,277 INFO L93 Difference]: Finished difference Result 309 states and 401 transitions. [2021-11-23 03:55:33,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 03:55:33,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 31 [2021-11-23 03:55:33,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:33,281 INFO L225 Difference]: With dead ends: 309 [2021-11-23 03:55:33,281 INFO L226 Difference]: Without dead ends: 305 [2021-11-23 03:55:33,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-23 03:55:33,283 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 187 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:33,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 499 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 03:55:33,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-11-23 03:55:33,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 275. [2021-11-23 03:55:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 225 states have (on average 1.2622222222222221) internal successors, (284), 230 states have internal predecessors, (284), 33 states have call successors, (33), 17 states have call predecessors, (33), 16 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2021-11-23 03:55:33,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 351 transitions. [2021-11-23 03:55:33,310 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 351 transitions. Word has length 31 [2021-11-23 03:55:33,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:33,310 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 351 transitions. [2021-11-23 03:55:33,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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) [2021-11-23 03:55:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 351 transitions. [2021-11-23 03:55:33,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-23 03:55:33,312 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:33,312 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:33,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-23 03:55:33,313 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:33,313 INFO L85 PathProgramCache]: Analyzing trace with hash 625388487, now seen corresponding path program 1 times [2021-11-23 03:55:33,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:33,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142602879] [2021-11-23 03:55:33,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:33,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:33,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:33,360 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:33,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142602879] [2021-11-23 03:55:33,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142602879] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:33,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:33,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 03:55:33,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589002762] [2021-11-23 03:55:33,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:33,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:55:33,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:33,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:55:33,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:55:33,363 INFO L87 Difference]: Start difference. First operand 275 states and 351 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) [2021-11-23 03:55:33,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:33,697 INFO L93 Difference]: Finished difference Result 322 states and 409 transitions. [2021-11-23 03:55:33,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 03:55:33,698 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 [2021-11-23 03:55:33,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:33,700 INFO L225 Difference]: With dead ends: 322 [2021-11-23 03:55:33,700 INFO L226 Difference]: Without dead ends: 279 [2021-11-23 03:55:33,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-23 03:55:33,702 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 198 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:33,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 449 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 03:55:33,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-11-23 03:55:33,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 275. [2021-11-23 03:55:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 225 states have (on average 1.2533333333333334) internal successors, (282), 230 states have internal predecessors, (282), 33 states have call successors, (33), 17 states have call predecessors, (33), 16 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2021-11-23 03:55:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 349 transitions. [2021-11-23 03:55:33,736 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 349 transitions. Word has length 30 [2021-11-23 03:55:33,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:33,736 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 349 transitions. [2021-11-23 03:55:33,736 INFO L471 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) [2021-11-23 03:55:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 349 transitions. [2021-11-23 03:55:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-23 03:55:33,738 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:33,738 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:33,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-23 03:55:33,739 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:33,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:33,739 INFO L85 PathProgramCache]: Analyzing trace with hash -153580735, now seen corresponding path program 1 times [2021-11-23 03:55:33,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:33,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237723519] [2021-11-23 03:55:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:33,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:33,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:33,767 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:33,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237723519] [2021-11-23 03:55:33,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237723519] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:33,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:33,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:55:33,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162773533] [2021-11-23 03:55:33,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:33,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:55:33,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:33,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:55:33,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:33,769 INFO L87 Difference]: Start difference. First operand 275 states and 349 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) [2021-11-23 03:55:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:33,866 INFO L93 Difference]: Finished difference Result 289 states and 362 transitions. [2021-11-23 03:55:33,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:55:33,867 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 [2021-11-23 03:55:33,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:33,870 INFO L225 Difference]: With dead ends: 289 [2021-11-23 03:55:33,870 INFO L226 Difference]: Without dead ends: 276 [2021-11-23 03:55:33,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:33,871 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 31 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:33,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 290 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:33,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-11-23 03:55:33,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 272. [2021-11-23 03:55:33,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 223 states have (on average 1.242152466367713) internal successors, (277), 227 states have internal predecessors, (277), 32 states have call successors, (32), 17 states have call predecessors, (32), 16 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2021-11-23 03:55:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 343 transitions. [2021-11-23 03:55:33,901 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 343 transitions. Word has length 31 [2021-11-23 03:55:33,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:33,901 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 343 transitions. [2021-11-23 03:55:33,901 INFO L471 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) [2021-11-23 03:55:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 343 transitions. [2021-11-23 03:55:33,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-23 03:55:33,903 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:33,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:33,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-23 03:55:33,928 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:33,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:33,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2096158115, now seen corresponding path program 1 times [2021-11-23 03:55:33,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:33,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708955463] [2021-11-23 03:55:33,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:33,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:33,973 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:33,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708955463] [2021-11-23 03:55:33,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708955463] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:33,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:33,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 03:55:33,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572805860] [2021-11-23 03:55:33,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:33,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 03:55:33,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:33,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 03:55:33,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:55:33,977 INFO L87 Difference]: Start difference. First operand 272 states and 343 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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) [2021-11-23 03:55:34,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:34,135 INFO L93 Difference]: Finished difference Result 287 states and 357 transitions. [2021-11-23 03:55:34,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 03:55:34,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 [2021-11-23 03:55:34,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:34,138 INFO L225 Difference]: With dead ends: 287 [2021-11-23 03:55:34,138 INFO L226 Difference]: Without dead ends: 256 [2021-11-23 03:55:34,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-23 03:55:34,140 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 33 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:34,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 639 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:34,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-23 03:55:34,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-11-23 03:55:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 211 states have (on average 1.2369668246445498) internal successors, (261), 214 states have internal predecessors, (261), 30 states have call successors, (30), 15 states have call predecessors, (30), 14 states have return successors, (32), 27 states have call predecessors, (32), 26 states have call successors, (32) [2021-11-23 03:55:34,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 323 transitions. [2021-11-23 03:55:34,176 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 323 transitions. Word has length 31 [2021-11-23 03:55:34,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:34,177 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 323 transitions. [2021-11-23 03:55:34,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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) [2021-11-23 03:55:34,177 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 323 transitions. [2021-11-23 03:55:34,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-23 03:55:34,179 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:34,179 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:34,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-23 03:55:34,180 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:34,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:34,180 INFO L85 PathProgramCache]: Analyzing trace with hash -13849219, now seen corresponding path program 1 times [2021-11-23 03:55:34,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:34,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3472225] [2021-11-23 03:55:34,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:34,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:34,279 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:34,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3472225] [2021-11-23 03:55:34,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3472225] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:34,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:34,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 03:55:34,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036926332] [2021-11-23 03:55:34,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:34,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 03:55:34,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:34,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 03:55:34,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:55:34,282 INFO L87 Difference]: Start difference. First operand 256 states and 323 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) [2021-11-23 03:55:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:34,514 INFO L93 Difference]: Finished difference Result 262 states and 327 transitions. [2021-11-23 03:55:34,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:55:34,515 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 [2021-11-23 03:55:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:34,518 INFO L225 Difference]: With dead ends: 262 [2021-11-23 03:55:34,518 INFO L226 Difference]: Without dead ends: 258 [2021-11-23 03:55:34,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:55:34,520 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 202 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:34,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 318 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:55:34,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-23 03:55:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2021-11-23 03:55:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 211 states have (on average 1.2322274881516588) internal successors, (260), 214 states have internal predecessors, (260), 30 states have call successors, (30), 15 states have call predecessors, (30), 14 states have return successors, (32), 27 states have call predecessors, (32), 26 states have call successors, (32) [2021-11-23 03:55:34,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 322 transitions. [2021-11-23 03:55:34,551 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 322 transitions. Word has length 32 [2021-11-23 03:55:34,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:34,551 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 322 transitions. [2021-11-23 03:55:34,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2021-11-23 03:55:34,552 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 322 transitions. [2021-11-23 03:55:34,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-23 03:55:34,553 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:34,553 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:34,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-23 03:55:34,554 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:34,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:34,555 INFO L85 PathProgramCache]: Analyzing trace with hash -13572389, now seen corresponding path program 1 times [2021-11-23 03:55:34,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:34,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507685672] [2021-11-23 03:55:34,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:34,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:34,670 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:34,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507685672] [2021-11-23 03:55:34,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507685672] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:34,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:34,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 03:55:34,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705958069] [2021-11-23 03:55:34,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:34,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 03:55:34,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:34,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 03:55:34,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-23 03:55:34,673 INFO L87 Difference]: Start difference. First operand 256 states and 322 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) [2021-11-23 03:55:34,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:34,901 INFO L93 Difference]: Finished difference Result 268 states and 333 transitions. [2021-11-23 03:55:34,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 03:55:34,901 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 [2021-11-23 03:55:34,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:34,903 INFO L225 Difference]: With dead ends: 268 [2021-11-23 03:55:34,903 INFO L226 Difference]: Without dead ends: 252 [2021-11-23 03:55:34,904 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:55:34,904 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 9 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:34,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 897 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:55:34,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-11-23 03:55:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2021-11-23 03:55:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 208 states have (on average 1.2307692307692308) internal successors, (256), 211 states have internal predecessors, (256), 29 states have call successors, (29), 15 states have call predecessors, (29), 14 states have return successors, (31), 26 states have call predecessors, (31), 25 states have call successors, (31) [2021-11-23 03:55:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 316 transitions. [2021-11-23 03:55:34,931 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 316 transitions. Word has length 32 [2021-11-23 03:55:34,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:34,932 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 316 transitions. [2021-11-23 03:55:34,932 INFO L471 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) [2021-11-23 03:55:34,932 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 316 transitions. [2021-11-23 03:55:34,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-23 03:55:34,935 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:34,935 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:34,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-23 03:55:34,935 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:34,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:34,936 INFO L85 PathProgramCache]: Analyzing trace with hash -843873722, now seen corresponding path program 1 times [2021-11-23 03:55:34,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:34,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369575698] [2021-11-23 03:55:34,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:34,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:35,089 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:35,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369575698] [2021-11-23 03:55:35,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369575698] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:35,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:35,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 03:55:35,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025769598] [2021-11-23 03:55:35,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:35,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 03:55:35,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:35,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 03:55:35,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-23 03:55:35,092 INFO L87 Difference]: Start difference. First operand 252 states and 316 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) [2021-11-23 03:55:35,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:35,391 INFO L93 Difference]: Finished difference Result 285 states and 360 transitions. [2021-11-23 03:55:35,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 03:55:35,392 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), 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 33 [2021-11-23 03:55:35,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:35,394 INFO L225 Difference]: With dead ends: 285 [2021-11-23 03:55:35,394 INFO L226 Difference]: Without dead ends: 282 [2021-11-23 03:55:35,394 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:55:35,395 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 407 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:35,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 513 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:55:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-11-23 03:55:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 252. [2021-11-23 03:55:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 208 states have (on average 1.2307692307692308) internal successors, (256), 211 states have internal predecessors, (256), 29 states have call successors, (29), 15 states have call predecessors, (29), 14 states have return successors, (31), 26 states have call predecessors, (31), 25 states have call successors, (31) [2021-11-23 03:55:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 316 transitions. [2021-11-23 03:55:35,421 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 316 transitions. Word has length 33 [2021-11-23 03:55:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:35,422 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 316 transitions. [2021-11-23 03:55:35,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) [2021-11-23 03:55:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 316 transitions. [2021-11-23 03:55:35,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 03:55:35,423 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:35,423 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:35,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-23 03:55:35,424 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:35,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:35,425 INFO L85 PathProgramCache]: Analyzing trace with hash -342158833, now seen corresponding path program 1 times [2021-11-23 03:55:35,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:35,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114240619] [2021-11-23 03:55:35,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:35,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:35,530 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:35,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114240619] [2021-11-23 03:55:35,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114240619] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:35,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:35,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 03:55:35,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824091250] [2021-11-23 03:55:35,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:35,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 03:55:35,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:35,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 03:55:35,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-23 03:55:35,532 INFO L87 Difference]: Start difference. First operand 252 states and 316 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 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) [2021-11-23 03:55:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:35,807 INFO L93 Difference]: Finished difference Result 265 states and 328 transitions. [2021-11-23 03:55:35,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 03:55:35,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 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 [2021-11-23 03:55:35,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:35,810 INFO L225 Difference]: With dead ends: 265 [2021-11-23 03:55:35,810 INFO L226 Difference]: Without dead ends: 248 [2021-11-23 03:55:35,811 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:55:35,812 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 18 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1003 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 [2021-11-23 03:55:35,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 1003 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:55:35,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-11-23 03:55:35,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2021-11-23 03:55:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 205 states have (on average 1.2292682926829268) internal successors, (252), 208 states have internal predecessors, (252), 28 states have call successors, (28), 15 states have call predecessors, (28), 14 states have return successors, (30), 25 states have call predecessors, (30), 24 states have call successors, (30) [2021-11-23 03:55:35,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 310 transitions. [2021-11-23 03:55:35,842 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 310 transitions. Word has length 35 [2021-11-23 03:55:35,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:35,843 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 310 transitions. [2021-11-23 03:55:35,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 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) [2021-11-23 03:55:35,843 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 310 transitions. [2021-11-23 03:55:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 03:55:35,844 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:35,845 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:35,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-23 03:55:35,845 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:35,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:35,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2052816391, now seen corresponding path program 1 times [2021-11-23 03:55:35,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:35,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869334559] [2021-11-23 03:55:35,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:35,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:35,952 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:35,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869334559] [2021-11-23 03:55:35,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869334559] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:35,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:35,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 03:55:35,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730899908] [2021-11-23 03:55:35,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:35,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 03:55:35,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:35,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 03:55:35,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-23 03:55:35,955 INFO L87 Difference]: Start difference. First operand 248 states and 310 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 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) [2021-11-23 03:55:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:36,217 INFO L93 Difference]: Finished difference Result 261 states and 322 transitions. [2021-11-23 03:55:36,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 03:55:36,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 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 [2021-11-23 03:55:36,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:36,220 INFO L225 Difference]: With dead ends: 261 [2021-11-23 03:55:36,220 INFO L226 Difference]: Without dead ends: 244 [2021-11-23 03:55:36,221 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:55:36,221 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 18 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:36,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 968 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:55:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-11-23 03:55:36,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2021-11-23 03:55:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 202 states have (on average 1.2277227722772277) internal successors, (248), 205 states have internal predecessors, (248), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (29), 24 states have call predecessors, (29), 23 states have call successors, (29) [2021-11-23 03:55:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 304 transitions. [2021-11-23 03:55:36,246 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 304 transitions. Word has length 35 [2021-11-23 03:55:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:36,247 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 304 transitions. [2021-11-23 03:55:36,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 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) [2021-11-23 03:55:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 304 transitions. [2021-11-23 03:55:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 03:55:36,268 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:36,268 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:36,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-23 03:55:36,269 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:36,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:36,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1896046246, now seen corresponding path program 1 times [2021-11-23 03:55:36,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:36,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072148616] [2021-11-23 03:55:36,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:36,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:36,391 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:36,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072148616] [2021-11-23 03:55:36,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072148616] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:36,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:36,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 03:55:36,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629123726] [2021-11-23 03:55:36,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:36,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 03:55:36,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:36,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 03:55:36,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-23 03:55:36,394 INFO L87 Difference]: Start difference. First operand 244 states and 304 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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) [2021-11-23 03:55:36,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:36,641 INFO L93 Difference]: Finished difference Result 257 states and 316 transitions. [2021-11-23 03:55:36,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 03:55:36,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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 36 [2021-11-23 03:55:36,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:36,644 INFO L225 Difference]: With dead ends: 257 [2021-11-23 03:55:36,644 INFO L226 Difference]: Without dead ends: 240 [2021-11-23 03:55:36,645 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:55:36,646 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 18 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:36,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 940 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:55:36,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-11-23 03:55:36,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2021-11-23 03:55:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 199 states have (on average 1.2261306532663316) internal successors, (244), 202 states have internal predecessors, (244), 26 states have call successors, (26), 15 states have call predecessors, (26), 14 states have return successors, (28), 23 states have call predecessors, (28), 22 states have call successors, (28) [2021-11-23 03:55:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 298 transitions. [2021-11-23 03:55:36,674 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 298 transitions. Word has length 36 [2021-11-23 03:55:36,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:36,675 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 298 transitions. [2021-11-23 03:55:36,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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) [2021-11-23 03:55:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 298 transitions. [2021-11-23 03:55:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 03:55:36,676 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:36,677 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:55:36,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-23 03:55:36,677 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:36,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:36,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1951974393, now seen corresponding path program 1 times [2021-11-23 03:55:36,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:36,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382668257] [2021-11-23 03:55:36,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:36,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:36,752 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:36,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382668257] [2021-11-23 03:55:36,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382668257] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:36,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:36,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 03:55:36,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123647847] [2021-11-23 03:55:36,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:36,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:55:36,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:36,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:55:36,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:55:36,755 INFO L87 Difference]: Start difference. First operand 240 states and 298 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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) [2021-11-23 03:55:36,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:36,995 INFO L93 Difference]: Finished difference Result 293 states and 369 transitions. [2021-11-23 03:55:36,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 03:55:36,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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 39 [2021-11-23 03:55:36,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:36,999 INFO L225 Difference]: With dead ends: 293 [2021-11-23 03:55:36,999 INFO L226 Difference]: Without dead ends: 289 [2021-11-23 03:55:37,000 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:55:37,000 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 155 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:37,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 343 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:55:37,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-11-23 03:55:37,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 225. [2021-11-23 03:55:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 188 states have (on average 1.2287234042553192) internal successors, (231), 191 states have internal predecessors, (231), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2021-11-23 03:55:37,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 277 transitions. [2021-11-23 03:55:37,027 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 277 transitions. Word has length 39 [2021-11-23 03:55:37,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:37,027 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 277 transitions. [2021-11-23 03:55:37,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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) [2021-11-23 03:55:37,027 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 277 transitions. [2021-11-23 03:55:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-23 03:55:37,028 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:37,029 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:37,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-23 03:55:37,029 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:37,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:37,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1575177972, now seen corresponding path program 1 times [2021-11-23 03:55:37,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:37,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418753765] [2021-11-23 03:55:37,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:37,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:37,134 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:37,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418753765] [2021-11-23 03:55:37,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418753765] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:37,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:37,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 03:55:37,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410338601] [2021-11-23 03:55:37,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:37,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 03:55:37,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:37,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 03:55:37,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-23 03:55:37,137 INFO L87 Difference]: Start difference. First operand 225 states and 277 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) [2021-11-23 03:55:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:37,383 INFO L93 Difference]: Finished difference Result 238 states and 289 transitions. [2021-11-23 03:55:37,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 03:55:37,384 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 [2021-11-23 03:55:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:37,386 INFO L225 Difference]: With dead ends: 238 [2021-11-23 03:55:37,386 INFO L226 Difference]: Without dead ends: 213 [2021-11-23 03:55:37,387 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:55:37,388 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 20 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:37,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 876 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:55:37,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-11-23 03:55:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2021-11-23 03:55:37,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 179 states have (on average 1.229050279329609) internal successors, (220), 182 states have internal predecessors, (220), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2021-11-23 03:55:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 262 transitions. [2021-11-23 03:55:37,430 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 262 transitions. Word has length 38 [2021-11-23 03:55:37,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:37,430 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 262 transitions. [2021-11-23 03:55:37,431 INFO L471 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) [2021-11-23 03:55:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 262 transitions. [2021-11-23 03:55:37,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 03:55:37,432 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:37,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:37,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-23 03:55:37,433 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:37,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:37,433 INFO L85 PathProgramCache]: Analyzing trace with hash 171281162, now seen corresponding path program 1 times [2021-11-23 03:55:37,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:37,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376833411] [2021-11-23 03:55:37,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:37,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:37,478 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:37,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376833411] [2021-11-23 03:55:37,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376833411] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:37,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:37,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 03:55:37,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691688676] [2021-11-23 03:55:37,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:37,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 03:55:37,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:37,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 03:55:37,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:55:37,481 INFO L87 Difference]: Start difference. First operand 213 states and 262 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 03:55:37,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:37,680 INFO L93 Difference]: Finished difference Result 436 states and 520 transitions. [2021-11-23 03:55:37,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 03:55:37,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-11-23 03:55:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:37,683 INFO L225 Difference]: With dead ends: 436 [2021-11-23 03:55:37,683 INFO L226 Difference]: Without dead ends: 277 [2021-11-23 03:55:37,684 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:55:37,685 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 153 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:37,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 406 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-11-23 03:55:37,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 261. [2021-11-23 03:55:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 218 states have (on average 1.2155963302752293) internal successors, (265), 223 states have internal predecessors, (265), 23 states have call successors, (23), 18 states have call predecessors, (23), 19 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2021-11-23 03:55:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 312 transitions. [2021-11-23 03:55:37,718 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 312 transitions. Word has length 43 [2021-11-23 03:55:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:37,719 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 312 transitions. [2021-11-23 03:55:37,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 03:55:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 312 transitions. [2021-11-23 03:55:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-23 03:55:37,720 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:37,721 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:37,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-23 03:55:37,721 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:37,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:37,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1095935707, now seen corresponding path program 1 times [2021-11-23 03:55:37,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:37,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468384538] [2021-11-23 03:55:37,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:37,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:37,785 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:37,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468384538] [2021-11-23 03:55:37,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468384538] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:37,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:37,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 03:55:37,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057189393] [2021-11-23 03:55:37,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:37,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 03:55:37,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:37,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 03:55:37,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-23 03:55:37,787 INFO L87 Difference]: Start difference. First operand 261 states and 312 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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) [2021-11-23 03:55:37,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:37,957 INFO L93 Difference]: Finished difference Result 263 states and 313 transitions. [2021-11-23 03:55:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 03:55:37,958 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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 44 [2021-11-23 03:55:37,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:37,960 INFO L225 Difference]: With dead ends: 263 [2021-11-23 03:55:37,960 INFO L226 Difference]: Without dead ends: 192 [2021-11-23 03:55:37,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-23 03:55:37,961 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 30 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:37,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 788 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:37,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-11-23 03:55:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2021-11-23 03:55:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 158 states have (on average 1.2468354430379747) internal successors, (197), 162 states have internal predecessors, (197), 18 states have call successors, (18), 14 states have call predecessors, (18), 15 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2021-11-23 03:55:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 235 transitions. [2021-11-23 03:55:37,991 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 235 transitions. Word has length 44 [2021-11-23 03:55:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:37,992 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 235 transitions. [2021-11-23 03:55:37,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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) [2021-11-23 03:55:37,992 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 235 transitions. [2021-11-23 03:55:37,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-23 03:55:37,993 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:37,993 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:55:37,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-23 03:55:37,994 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:37,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:37,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1950813693, now seen corresponding path program 1 times [2021-11-23 03:55:37,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:37,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360221330] [2021-11-23 03:55:37,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:37,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:38,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 03:55:38,120 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:38,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360221330] [2021-11-23 03:55:38,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360221330] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:38,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:38,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-23 03:55:38,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444403404] [2021-11-23 03:55:38,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:38,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 03:55:38,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:38,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 03:55:38,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-23 03:55:38,123 INFO L87 Difference]: Start difference. First operand 192 states and 235 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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) [2021-11-23 03:55:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:38,486 INFO L93 Difference]: Finished difference Result 215 states and 265 transitions. [2021-11-23 03:55:38,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 03:55:38,487 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 46 [2021-11-23 03:55:38,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:38,489 INFO L225 Difference]: With dead ends: 215 [2021-11-23 03:55:38,489 INFO L226 Difference]: Without dead ends: 212 [2021-11-23 03:55:38,491 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:55:38,492 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 237 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:38,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 504 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 03:55:38,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-11-23 03:55:38,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 195. [2021-11-23 03:55:38,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 165 states have internal predecessors, (202), 18 states have call successors, (18), 14 states have call predecessors, (18), 15 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2021-11-23 03:55:38,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 240 transitions. [2021-11-23 03:55:38,526 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 240 transitions. Word has length 46 [2021-11-23 03:55:38,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:38,526 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 240 transitions. [2021-11-23 03:55:38,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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) [2021-11-23 03:55:38,527 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 240 transitions. [2021-11-23 03:55:38,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-23 03:55:38,529 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:38,529 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:38,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-23 03:55:38,529 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:38,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:38,530 INFO L85 PathProgramCache]: Analyzing trace with hash 931546758, now seen corresponding path program 1 times [2021-11-23 03:55:38,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:38,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905754195] [2021-11-23 03:55:38,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:38,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:38,598 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:38,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905754195] [2021-11-23 03:55:38,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905754195] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:38,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:38,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 03:55:38,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346026821] [2021-11-23 03:55:38,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:38,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:55:38,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:38,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:55:38,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:55:38,601 INFO L87 Difference]: Start difference. First operand 195 states and 240 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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) [2021-11-23 03:55:38,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:38,745 INFO L93 Difference]: Finished difference Result 289 states and 350 transitions. [2021-11-23 03:55:38,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 03:55:38,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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 47 [2021-11-23 03:55:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:38,747 INFO L225 Difference]: With dead ends: 289 [2021-11-23 03:55:38,748 INFO L226 Difference]: Without dead ends: 204 [2021-11-23 03:55:38,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-23 03:55:38,749 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 35 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:38,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 464 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:38,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-11-23 03:55:38,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2021-11-23 03:55:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 169 states have (on average 1.1952662721893492) internal successors, (202), 174 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) [2021-11-23 03:55:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 241 transitions. [2021-11-23 03:55:38,778 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 241 transitions. Word has length 47 [2021-11-23 03:55:38,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:38,779 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 241 transitions. [2021-11-23 03:55:38,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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) [2021-11-23 03:55:38,779 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 241 transitions. [2021-11-23 03:55:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-23 03:55:38,780 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:38,780 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:38,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-23 03:55:38,781 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:38,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:38,781 INFO L85 PathProgramCache]: Analyzing trace with hash 124369906, now seen corresponding path program 1 times [2021-11-23 03:55:38,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:38,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200208326] [2021-11-23 03:55:38,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:38,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:38,975 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:38,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200208326] [2021-11-23 03:55:38,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200208326] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:38,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:38,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-23 03:55:38,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273526018] [2021-11-23 03:55:38,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:38,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-23 03:55:38,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:38,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-23 03:55:38,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-11-23 03:55:38,977 INFO L87 Difference]: Start difference. First operand 204 states and 241 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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) [2021-11-23 03:55:39,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:39,813 INFO L93 Difference]: Finished difference Result 221 states and 258 transitions. [2021-11-23 03:55:39,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-23 03:55:39,813 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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 47 [2021-11-23 03:55:39,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:39,815 INFO L225 Difference]: With dead ends: 221 [2021-11-23 03:55:39,815 INFO L226 Difference]: Without dead ends: 204 [2021-11-23 03:55:39,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2021-11-23 03:55:39,816 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 274 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:39,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 483 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 03:55:39,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-11-23 03:55:39,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2021-11-23 03:55:39,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 169 states have (on average 1.1893491124260356) internal successors, (201), 174 states have internal predecessors, (201), 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) [2021-11-23 03:55:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 240 transitions. [2021-11-23 03:55:39,845 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 240 transitions. Word has length 47 [2021-11-23 03:55:39,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:39,846 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 240 transitions. [2021-11-23 03:55:39,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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) [2021-11-23 03:55:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 240 transitions. [2021-11-23 03:55:39,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-23 03:55:39,848 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:39,848 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:55:39,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-23 03:55:39,848 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:39,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:39,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1073889741, now seen corresponding path program 1 times [2021-11-23 03:55:39,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:39,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534417618] [2021-11-23 03:55:39,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:39,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 03:55:39,896 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:39,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534417618] [2021-11-23 03:55:39,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534417618] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:39,896 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:39,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:55:39,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498369686] [2021-11-23 03:55:39,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:39,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:55:39,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:39,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:55:39,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:39,899 INFO L87 Difference]: Start difference. First operand 204 states and 240 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2021-11-23 03:55:40,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:40,000 INFO L93 Difference]: Finished difference Result 226 states and 261 transitions. [2021-11-23 03:55:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:55:40,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 49 [2021-11-23 03:55:40,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:40,003 INFO L225 Difference]: With dead ends: 226 [2021-11-23 03:55:40,003 INFO L226 Difference]: Without dead ends: 217 [2021-11-23 03:55:40,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:55:40,004 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 25 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:40,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 168 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 03:55:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-11-23 03:55:40,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 203. [2021-11-23 03:55:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 168 states have (on average 1.1845238095238095) internal successors, (199), 173 states have internal predecessors, (199), 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) [2021-11-23 03:55:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 238 transitions. [2021-11-23 03:55:40,032 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 238 transitions. Word has length 49 [2021-11-23 03:55:40,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:40,033 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 238 transitions. [2021-11-23 03:55:40,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2021-11-23 03:55:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 238 transitions. [2021-11-23 03:55:40,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-23 03:55:40,034 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:40,034 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:55:40,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-23 03:55:40,035 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:40,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:40,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1746776267, now seen corresponding path program 1 times [2021-11-23 03:55:40,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:40,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365836932] [2021-11-23 03:55:40,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:40,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 03:55:40,158 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:40,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365836932] [2021-11-23 03:55:40,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365836932] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:40,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:40,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 03:55:40,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94952100] [2021-11-23 03:55:40,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:40,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 03:55:40,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:40,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 03:55:40,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-23 03:55:40,160 INFO L87 Difference]: Start difference. First operand 203 states and 238 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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) [2021-11-23 03:55:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:40,376 INFO L93 Difference]: Finished difference Result 212 states and 247 transitions. [2021-11-23 03:55:40,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 03:55:40,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 51 [2021-11-23 03:55:40,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:40,378 INFO L225 Difference]: With dead ends: 212 [2021-11-23 03:55:40,378 INFO L226 Difference]: Without dead ends: 206 [2021-11-23 03:55:40,379 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:55:40,380 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 257 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:40,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 313 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:55:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-11-23 03:55:40,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 147. [2021-11-23 03:55:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 122 states have (on average 1.1475409836065573) internal successors, (140), 125 states have internal predecessors, (140), 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) [2021-11-23 03:55:40,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 168 transitions. [2021-11-23 03:55:40,404 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 168 transitions. Word has length 51 [2021-11-23 03:55:40,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:40,405 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 168 transitions. [2021-11-23 03:55:40,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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) [2021-11-23 03:55:40,405 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 168 transitions. [2021-11-23 03:55:40,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-23 03:55:40,406 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:40,406 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:40,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-23 03:55:40,407 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:40,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:40,407 INFO L85 PathProgramCache]: Analyzing trace with hash 47566838, now seen corresponding path program 1 times [2021-11-23 03:55:40,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:40,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621087895] [2021-11-23 03:55:40,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:40,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:40,454 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:40,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621087895] [2021-11-23 03:55:40,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621087895] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:40,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:40,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 03:55:40,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356739420] [2021-11-23 03:55:40,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:40,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:55:40,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:40,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:55:40,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:55:40,459 INFO L87 Difference]: Start difference. First operand 147 states and 168 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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) [2021-11-23 03:55:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:40,540 INFO L93 Difference]: Finished difference Result 186 states and 211 transitions. [2021-11-23 03:55:40,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:55:40,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 52 [2021-11-23 03:55:40,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:40,542 INFO L225 Difference]: With dead ends: 186 [2021-11-23 03:55:40,542 INFO L226 Difference]: Without dead ends: 147 [2021-11-23 03:55:40,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:55:40,543 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 259 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.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:40,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 259 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:40,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-11-23 03:55:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-11-23 03:55:40,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 122 states have (on average 1.139344262295082) internal successors, (139), 125 states have internal predecessors, (139), 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) [2021-11-23 03:55:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 167 transitions. [2021-11-23 03:55:40,564 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 167 transitions. Word has length 52 [2021-11-23 03:55:40,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:40,564 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 167 transitions. [2021-11-23 03:55:40,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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) [2021-11-23 03:55:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 167 transitions. [2021-11-23 03:55:40,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-23 03:55:40,565 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:40,566 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:40,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-23 03:55:40,566 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:40,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:40,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1483865700, now seen corresponding path program 1 times [2021-11-23 03:55:40,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:40,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757212375] [2021-11-23 03:55:40,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:40,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:40,643 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:40,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757212375] [2021-11-23 03:55:40,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757212375] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:40,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:40,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 03:55:40,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612634446] [2021-11-23 03:55:40,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:40,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:55:40,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:40,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:55:40,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:55:40,647 INFO L87 Difference]: Start difference. First operand 147 states and 167 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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) [2021-11-23 03:55:40,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:40,825 INFO L93 Difference]: Finished difference Result 185 states and 201 transitions. [2021-11-23 03:55:40,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 03:55:40,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 54 [2021-11-23 03:55:40,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:40,827 INFO L225 Difference]: With dead ends: 185 [2021-11-23 03:55:40,827 INFO L226 Difference]: Without dead ends: 124 [2021-11-23 03:55:40,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-23 03:55:40,828 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 148 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 350 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 [2021-11-23 03:55:40,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 350 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:40,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-11-23 03:55:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 95. [2021-11-23 03:55:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.123456790123457) internal successors, (91), 81 states have internal predecessors, (91), 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) [2021-11-23 03:55:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2021-11-23 03:55:40,843 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 54 [2021-11-23 03:55:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:40,844 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2021-11-23 03:55:40,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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) [2021-11-23 03:55:40,844 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2021-11-23 03:55:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-23 03:55:40,845 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:40,845 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:55:40,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-23 03:55:40,845 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:40,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:40,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1181173090, now seen corresponding path program 1 times [2021-11-23 03:55:40,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:40,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612823694] [2021-11-23 03:55:40,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:40,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:40,911 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 03:55:40,911 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:40,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612823694] [2021-11-23 03:55:40,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612823694] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:40,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:40,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 03:55:40,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034166362] [2021-11-23 03:55:40,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:40,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:55:40,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:40,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:55:40,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:55:40,914 INFO L87 Difference]: Start difference. First operand 95 states and 104 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) [2021-11-23 03:55:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:41,085 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2021-11-23 03:55:41,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 03:55:41,086 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 66 [2021-11-23 03:55:41,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:41,087 INFO L225 Difference]: With dead ends: 118 [2021-11-23 03:55:41,087 INFO L226 Difference]: Without dead ends: 92 [2021-11-23 03:55:41,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-23 03:55:41,088 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 120 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 259 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 [2021-11-23 03:55:41,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 259 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:41,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-23 03:55:41,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-11-23 03:55:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 78 states have internal predecessors, (85), 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) [2021-11-23 03:55:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2021-11-23 03:55:41,103 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 66 [2021-11-23 03:55:41,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:41,103 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2021-11-23 03:55:41,104 INFO L471 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) [2021-11-23 03:55:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2021-11-23 03:55:41,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-23 03:55:41,105 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:41,105 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:55:41,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-23 03:55:41,105 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:41,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:41,106 INFO L85 PathProgramCache]: Analyzing trace with hash -274308351, now seen corresponding path program 1 times [2021-11-23 03:55:41,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:41,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691061405] [2021-11-23 03:55:41,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:41,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 03:55:41,383 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:41,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691061405] [2021-11-23 03:55:41,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691061405] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:41,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:41,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-23 03:55:41,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271532991] [2021-11-23 03:55:41,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:41,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-23 03:55:41,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:41,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-23 03:55:41,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2021-11-23 03:55:41,384 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 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) [2021-11-23 03:55:42,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:42,604 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2021-11-23 03:55:42,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-23 03:55:42,605 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 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 68 [2021-11-23 03:55:42,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:42,606 INFO L225 Difference]: With dead ends: 128 [2021-11-23 03:55:42,606 INFO L226 Difference]: Without dead ends: 97 [2021-11-23 03:55:42,607 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:55:42,608 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 270 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:42,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 429 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 03:55:42,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-11-23 03:55:42,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2021-11-23 03:55:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.0769230769230769) internal successors, (84), 78 states have internal predecessors, (84), 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) [2021-11-23 03:55:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2021-11-23 03:55:42,625 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 68 [2021-11-23 03:55:42,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:42,625 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2021-11-23 03:55:42,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 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) [2021-11-23 03:55:42,626 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2021-11-23 03:55:42,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-23 03:55:42,627 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:42,627 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:55:42,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-23 03:55:42,627 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:42,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:42,628 INFO L85 PathProgramCache]: Analyzing trace with hash -268236332, now seen corresponding path program 1 times [2021-11-23 03:55:42,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:42,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081345297] [2021-11-23 03:55:42,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:42,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 03:55:42,737 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:42,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081345297] [2021-11-23 03:55:42,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081345297] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:42,737 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:42,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-23 03:55:42,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511609125] [2021-11-23 03:55:42,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:42,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 03:55:42,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:42,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 03:55:42,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-23 03:55:42,742 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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) [2021-11-23 03:55:43,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:43,012 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2021-11-23 03:55:43,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 03:55:43,013 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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 75 [2021-11-23 03:55:43,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:43,013 INFO L225 Difference]: With dead ends: 101 [2021-11-23 03:55:43,013 INFO L226 Difference]: Without dead ends: 0 [2021-11-23 03:55:43,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-11-23 03:55:43,014 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 196 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:43,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 246 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:55:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-23 03:55:43,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-23 03:55:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:55:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-23 03:55:43,015 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2021-11-23 03:55:43,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:43,015 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-23 03:55:43,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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) [2021-11-23 03:55:43,016 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-23 03:55:43,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-23 03:55:43,018 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-23 03:55:43,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-23 03:55:43,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-23 03:55:58,385 INFO L854 garLoopResultBuilder]: At program point L1051(line 1051) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse6 (not (= ~NP~0 |old(~s~0)|))) (.cse2 (= ~IPC~0 2)) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (= 2 ~DC~0)))) (and (or .cse0 (not (<= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 (not (<= 6 ~MPR3~0)) (not (= |old(~setEventCalled~0)| 1)) .cse5 (not (= ~compRegistered~0 1)) (and .cse6 (not (= ~MPR3~0 |old(~s~0)|))) (not (= ~pended~0 0))) (or .cse0 (not (= |old(~customIrp~0)| 0)) .cse1 .cse6 (not (= ~compRegistered~0 0)) .cse2 .cse3 .cse4 .cse5 (= ~MPR3~0 1)))) [2021-11-23 03:55:58,386 INFO L858 garLoopResultBuilder]: For program point KeWaitForSingleObjectEXIT(lines 1031 1072) no Hoare annotation was computed. [2021-11-23 03:55:58,386 INFO L858 garLoopResultBuilder]: For program point L1049(lines 1049 1053) no Hoare annotation was computed. [2021-11-23 03:55:58,386 INFO L854 garLoopResultBuilder]: At program point L1049-1(lines 1036 1055) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse5 (= ~IPC~0 2)) (.cse6 (not (<= 4 ~SKIP2~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= 2 ~DC~0))) (.cse3 (= ~customIrp~0 0)) (.cse4 (= ~s~0 |old(~s~0)|)) (.cse2 (not (= ~NP~0 |old(~s~0)|)))) (and (or .cse0 (not (= |old(~customIrp~0)| 0)) .cse1 .cse2 (not (= ~compRegistered~0 0)) (and .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 (= ~MPR3~0 1)) (let ((.cse9 (not (= ~MPR3~0 |old(~s~0)|)))) (or .cse0 (not (<= ~myStatus~0 0)) .cse1 .cse5 .cse6 .cse7 (not (<= 6 ~MPR3~0)) (not (= |old(~setEventCalled~0)| 1)) .cse8 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0)) (not (= ~compRegistered~0 1)) (and (= ~setEventCalled~0 1) (= |old(~customIrp~0)| 1) .cse3 .cse4 .cse9) (and .cse2 .cse9) (not (= ~pended~0 0)))))) [2021-11-23 03:55:58,386 INFO L858 garLoopResultBuilder]: For program point L1037(lines 1037 1042) no Hoare annotation was computed. [2021-11-23 03:55:58,387 INFO L854 garLoopResultBuilder]: At program point L1044(lines 1036 1055) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse8 (not (= ~NP~0 |old(~s~0)|))) (.cse5 (= ~s~0 |old(~s~0)|)) (.cse2 (= ~IPC~0 2)) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (= 2 ~DC~0)))) (and (let ((.cse6 (not (= ~MPR3~0 |old(~s~0)|)))) (or .cse0 (not (<= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 (not (<= 6 ~MPR3~0)) (not (= |old(~setEventCalled~0)| 1)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 1) .cse5 .cse6) .cse7 (not (= ~compRegistered~0 1)) (and .cse8 .cse6) (not (= ~pended~0 0)))) (or .cse0 (not (= |old(~customIrp~0)| 0)) .cse1 .cse8 (not (= ~compRegistered~0 0)) (and (= ~customIrp~0 0) .cse5) .cse2 .cse3 .cse4 .cse7 (= ~MPR3~0 1)))) [2021-11-23 03:55:58,387 INFO L858 garLoopResultBuilder]: For program point L1036(lines 1036 1055) no Hoare annotation was computed. [2021-11-23 03:55:58,387 INFO L854 garLoopResultBuilder]: At program point KeWaitForSingleObjectENTRY(lines 1031 1072) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse3 (= ~s~0 |old(~s~0)|)) (.cse4 (= ~IPC~0 2)) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (= 2 ~DC~0))) (.cse2 (not (= ~NP~0 |old(~s~0)|)))) (and (or .cse0 (not (= |old(~customIrp~0)| 0)) .cse1 .cse2 (not (= ~compRegistered~0 0)) (and (= ~customIrp~0 0) .cse3) .cse4 .cse5 .cse6 .cse7 (= ~MPR3~0 1)) (or .cse0 (not (<= ~myStatus~0 0)) .cse1 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 1) .cse3) .cse4 .cse5 .cse6 (not (<= 6 ~MPR3~0)) (not (= |old(~setEventCalled~0)| 1)) .cse7 (not (= ~compRegistered~0 1)) (and .cse2 (not (= ~MPR3~0 |old(~s~0)|))) (not (= ~pended~0 0))))) [2021-11-23 03:55:58,387 INFO L858 garLoopResultBuilder]: For program point IoSetDeviceInterfaceStateEXIT(lines 901 921) no Hoare annotation was computed. [2021-11-23 03:55:58,387 INFO L861 garLoopResultBuilder]: At program point IoSetDeviceInterfaceStateENTRY(lines 901 921) the Hoare annotation is: true [2021-11-23 03:55:58,387 INFO L854 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 1009 1022) the Hoare annotation is: (let ((.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (= ~s~0 |old(~s~0)|)) (.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (= ~SKIP2~0 2)) (.cse5 (= ~IPC~0 2)) (.cse7 (not (= 2 ~DC~0))) (.cse9 (= ~MPR3~0 1)) (.cse10 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse5 (not (<= 4 ~SKIP2~0)) .cse6 .cse7 .cse8 (not (= ~compRegistered~0 1)) .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 (= ~s~0 ~NP~0) .cse5 .cse7 .cse9 .cse10))) [2021-11-23 03:55:58,387 INFO L854 garLoopResultBuilder]: At program point L1017(line 1017) the Hoare annotation is: (let ((.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (= ~SKIP2~0 2)) (.cse5 (= ~IPC~0 2)) (.cse7 (not (= 2 ~DC~0))) (.cse8 (= ~MPR3~0 1)) (.cse9 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse5 (not (<= 4 ~SKIP2~0)) .cse6 .cse7 (not (= ~compRegistered~0 1)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9))) [2021-11-23 03:55:58,388 INFO L858 garLoopResultBuilder]: For program point L1017-1(lines 1009 1022) no Hoare annotation was computed. [2021-11-23 03:55:58,388 INFO L858 garLoopResultBuilder]: For program point L1013(lines 1013 1019) no Hoare annotation was computed. [2021-11-23 03:55:58,388 INFO L858 garLoopResultBuilder]: For program point IofCompleteRequestEXIT(lines 1009 1022) no Hoare annotation was computed. [2021-11-23 03:55:58,388 INFO L861 garLoopResultBuilder]: At program point errorFnENTRY(lines 61 68) the Hoare annotation is: true [2021-11-23 03:55:58,388 INFO L858 garLoopResultBuilder]: For program point errorFnEXIT(lines 61 68) no Hoare annotation was computed. [2021-11-23 03:55:58,388 INFO L858 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-23 03:55:58,388 INFO L858 garLoopResultBuilder]: For program point L630(lines 630 632) no Hoare annotation was computed. [2021-11-23 03:55:58,389 INFO L858 garLoopResultBuilder]: For program point L531(lines 531 596) no Hoare annotation was computed. [2021-11-23 03:55:58,389 INFO L858 garLoopResultBuilder]: For program point L531-1(lines 531 596) no Hoare annotation was computed. [2021-11-23 03:55:58,389 INFO L858 garLoopResultBuilder]: For program point L201(lines 201 209) no Hoare annotation was computed. [2021-11-23 03:55:58,389 INFO L854 garLoopResultBuilder]: At program point L796(line 796) the Hoare annotation is: false [2021-11-23 03:55:58,389 INFO L858 garLoopResultBuilder]: For program point L565(lines 565 567) no Hoare annotation was computed. [2021-11-23 03:55:58,389 INFO L858 garLoopResultBuilder]: For program point L499(lines 499 505) no Hoare annotation was computed. [2021-11-23 03:55:58,390 INFO L858 garLoopResultBuilder]: For program point L499-1(lines 494 506) no Hoare annotation was computed. [2021-11-23 03:55:58,390 INFO L854 garLoopResultBuilder]: At program point L367(line 367) the Hoare annotation is: false [2021-11-23 03:55:58,390 INFO L858 garLoopResultBuilder]: For program point L367-1(lines 363 369) no Hoare annotation was computed. [2021-11-23 03:55:58,390 INFO L858 garLoopResultBuilder]: For program point L533(lines 533 573) no Hoare annotation was computed. [2021-11-23 03:55:58,390 INFO L854 garLoopResultBuilder]: At program point L434(lines 163 436) the Hoare annotation is: (let ((.cse12 (= ~s~0 ~DC~0)) (.cse13 (= 2 ~s~0)) (.cse5 (not (= ~IPC~0 2))) (.cse6 (not (= ~MPR3~0 1))) (.cse7 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse14 (= ~pended~0 0)) (.cse8 (= ~compRegistered~0 0)) (.cse10 (= ~SKIP1~0 3))) (let ((.cse11 (not (= ~SKIP2~0 2))) (.cse0 (or (and (= ~compRegistered~0 1) .cse12 .cse13 .cse5 .cse6 .cse7 .cse14 .cse10) (and .cse12 .cse13 .cse5 .cse6 .cse7 .cse14 .cse8 .cse10))) (.cse4 (= 2 ~DC~0)) (.cse1 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (= ~NP~0 1)) (.cse3 (<= 4 ~SKIP2~0)) (.cse9 (= ~SKIP2~0 ~s~0))) (or (and (<= 6 ~MPR3~0) .cse0 (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|)) .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| ~lowerDriverReturn~0) (= ~customIrp~0 0) .cse2 .cse6 .cse7 .cse3 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res#1|) .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse13 .cse5 .cse2 .cse6 .cse7 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res#1|) 0) .cse14 .cse10) (and (= (+ |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 1073741823) 0) .cse11 .cse12 .cse13 .cse5 .cse1 .cse2 .cse6 .cse7 (= (+ 1073741823 |ULTIMATE.start_FloppyPnp_#res#1|) 0) .cse8 .cse10) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res#1| 1) 0) .cse0 (<= (+ |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 1) 0) .cse1 .cse2 .cse3 (<= (+ |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 1) 0)) (and (<= |ULTIMATE.start_FloppyPnp_#res#1| ~lowerDriverReturn~0) .cse4 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res#1|) .cse5 .cse1 .cse2 .cse6 .cse7 .cse3 .cse14 .cse8 .cse9 .cse10)))) [2021-11-23 03:55:58,391 INFO L854 garLoopResultBuilder]: At program point L765(lines 758 804) the Hoare annotation is: (let ((.cse8 (= ~s~0 ~DC~0)) (.cse9 (= 2 ~s~0)) (.cse4 (not (= ~IPC~0 2))) (.cse5 (not (= ~MPR3~0 1))) (.cse6 (= ~compRegistered~0 0)) (.cse7 (= ~SKIP1~0 3))) (let ((.cse0 (or (and (= ~compRegistered~0 1) .cse8 .cse9 .cse4 .cse5 .cse7) (and .cse8 .cse9 .cse4 .cse5 .cse6 .cse7))) (.cse1 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (<= 4 ~SKIP2~0)) (.cse2 (= ~NP~0 1))) (or (and (<= 6 ~MPR3~0) .cse0 (or (<= |ULTIMATE.start_main_~status~1#1| 258) (<= 260 |ULTIMATE.start_main_~status~1#1|)) (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|)) .cse1 .cse2 .cse3) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res#1| 1) 0) .cse0 (<= (+ |ULTIMATE.start_main_~status~1#1| 1) 0) (<= (+ |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 1) 0) .cse1 .cse2 .cse3 (<= (+ |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 1) 0)) (and (<= |ULTIMATE.start_FloppyPnp_#res#1| ~lowerDriverReturn~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (< |ULTIMATE.start_main_~status~1#1| (+ ~lowerDriverReturn~0 1)) (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~1#1|) (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res#1|) .cse4 .cse2 .cse5 .cse3 .cse6 (= ~SKIP2~0 ~s~0) .cse7) (and (not (= ~SKIP2~0 2)) .cse8 .cse9 .cse4 (<= (+ |ULTIMATE.start_main_~status~1#1| 1073741738) 0) .cse2 .cse5 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res#1|) 0) .cse7)))) [2021-11-23 03:55:58,391 INFO L854 garLoopResultBuilder]: At program point L600(line 600) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= 6 ~MPR3~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0)) (.cse4 (not (= ~IPC~0 2))) (.cse5 (= ~s~0 ~NP~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~NP~0 1)) (.cse8 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (= ~pended~0 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 .cse6 (or (<= |ULTIMATE.start_FlFdcDeviceIo_#res#1| 258) (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res#1|)) .cse7 .cse8 .cse9 (or (<= 260 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 258)) .cse10 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 (not (= ~MPR3~0 1)) .cse8 .cse9 .cse10 .cse11 (<= (+ |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 1) 0)) (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2021-11-23 03:55:58,391 INFO L854 garLoopResultBuilder]: At program point L600-1(line 600) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (= 2 ~DC~0)) (.cse2 (= 2 ~s~0)) (.cse3 (not (= ~IPC~0 2))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~NP~0 1)) (.cse6 (not (= ~MPR3~0 1))) (.cse7 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse8 (<= 4 ~SKIP2~0)) (.cse9 (= ~pended~0 0)) (.cse10 (= ~SKIP1~0 3))) (or (and .cse0 (<= 6 ~MPR3~0) .cse1 .cse2 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 260 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 258)) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 1) 0)))) [2021-11-23 03:55:58,392 INFO L854 garLoopResultBuilder]: At program point L534(lines 534 544) 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) (= 2 ~DC~0) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (<= 0 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (not (= ~IPC~0 2)) (= ~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) (<= 4 ~SKIP2~0) (or (<= 260 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 258)) (= ~pended~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,392 INFO L854 garLoopResultBuilder]: At program point L501(line 501) the Hoare annotation is: false [2021-11-23 03:55:58,392 INFO L858 garLoopResultBuilder]: For program point L766(lines 750 805) no Hoare annotation was computed. [2021-11-23 03:55:58,392 INFO L854 garLoopResultBuilder]: At program point L733(lines 733 748) the Hoare annotation is: (and (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,393 INFO L858 garLoopResultBuilder]: For program point L304(lines 304 310) no Hoare annotation was computed. [2021-11-23 03:55:58,393 INFO L858 garLoopResultBuilder]: For program point L767(lines 767 802) no Hoare annotation was computed. [2021-11-23 03:55:58,393 INFO L854 garLoopResultBuilder]: At program point L206(line 206) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,393 INFO L858 garLoopResultBuilder]: For program point L239-1(lines 232 420) no Hoare annotation was computed. [2021-11-23 03:55:58,393 INFO L858 garLoopResultBuilder]: For program point L206-1(line 206) no Hoare annotation was computed. [2021-11-23 03:55:58,393 INFO L858 garLoopResultBuilder]: For program point L768(lines 768 801) no Hoare annotation was computed. [2021-11-23 03:55:58,394 INFO L854 garLoopResultBuilder]: At program point L636(line 636) the Hoare annotation is: (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (= ~pended~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,394 INFO L858 garLoopResultBuilder]: For program point L636-1(line 636) no Hoare annotation was computed. [2021-11-23 03:55:58,394 INFO L854 garLoopResultBuilder]: At program point L570(lines 531 596) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse10 (<= 6 ~MPR3~0)) (.cse1 (= 2 ~DC~0)) (.cse11 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0)) (.cse12 (<= 0 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|)) (.cse2 (not (= ~IPC~0 2))) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~NP~0 1)) (.cse6 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse7 (<= 4 ~SKIP2~0)) (.cse8 (= ~pended~0 0)) (.cse9 (= ~SKIP1~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~MPR3~0 1)) .cse6 .cse7 .cse8 .cse9 (<= (+ |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 .cse10 .cse1 .cse11 .cse12 .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) (and .cse0 .cse10 .cse1 .cse11 (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 0) .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-11-23 03:55:58,394 INFO L854 garLoopResultBuilder]: At program point L339(line 339) the Hoare annotation is: (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= 2 ~DC~0) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (not (= ~IPC~0 2)) (= ~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) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,395 INFO L858 garLoopResultBuilder]: For program point L339-1(line 339) no Hoare annotation was computed. [2021-11-23 03:55:58,395 INFO L858 garLoopResultBuilder]: For program point L769(lines 769 779) no Hoare annotation was computed. [2021-11-23 03:55:58,395 INFO L854 garLoopResultBuilder]: At program point L373(line 373) the Hoare annotation is: (and (= 3 ~s~0) (= 2 ~DC~0) (not (= ~IPC~0 2)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,395 INFO L858 garLoopResultBuilder]: For program point L373-1(line 373) no Hoare annotation was computed. [2021-11-23 03:55:58,395 INFO L858 garLoopResultBuilder]: For program point L274(lines 274 280) no Hoare annotation was computed. [2021-11-23 03:55:58,396 INFO L858 garLoopResultBuilder]: For program point L770(lines 770 776) no Hoare annotation was computed. [2021-11-23 03:55:58,396 INFO L854 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: false [2021-11-23 03:55:58,396 INFO L858 garLoopResultBuilder]: For program point L308-1(lines 304 310) no Hoare annotation was computed. [2021-11-23 03:55:58,396 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2021-11-23 03:55:58,396 INFO L854 garLoopResultBuilder]: At program point L210(lines 210 429) the Hoare annotation is: (and (<= 6 ~MPR3~0) (= 2 ~DC~0) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,396 INFO L854 garLoopResultBuilder]: At program point L772(line 772) the Hoare annotation is: false [2021-11-23 03:55:58,397 INFO L858 garLoopResultBuilder]: For program point L640(lines 640 645) no Hoare annotation was computed. [2021-11-23 03:55:58,397 INFO L858 garLoopResultBuilder]: For program point L640-2(lines 640 645) no Hoare annotation was computed. [2021-11-23 03:55:58,397 INFO L858 garLoopResultBuilder]: For program point L343(lines 343 348) no Hoare annotation was computed. [2021-11-23 03:55:58,397 INFO L858 garLoopResultBuilder]: For program point L343-2(lines 343 348) no Hoare annotation was computed. [2021-11-23 03:55:58,397 INFO L854 garLoopResultBuilder]: At program point L278(line 278) the Hoare annotation is: false [2021-11-23 03:55:58,398 INFO L858 garLoopResultBuilder]: For program point L278-1(lines 274 280) no Hoare annotation was computed. [2021-11-23 03:55:58,398 INFO L861 garLoopResultBuilder]: At program point L807(lines 670 809) the Hoare annotation is: true [2021-11-23 03:55:58,398 INFO L854 garLoopResultBuilder]: At program point L642(line 642) 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) (= 2 ~DC~0) (or .cse0 (and (<= |ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0#1| 259) (< 258 |ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0#1|))) (or .cse0 (<= 259 |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1|)) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (or .cse0 (= ~MPR3~0 ~s~0)) (not (= ~IPC~0 2)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (= ~pended~0 0) (= ~SKIP1~0 3))) [2021-11-23 03:55:58,398 INFO L858 garLoopResultBuilder]: For program point L642-1(line 642) no Hoare annotation was computed. [2021-11-23 03:55:58,398 INFO L854 garLoopResultBuilder]: At program point L345(line 345) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0))) (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (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)) (not (= ~IPC~0 2)) (= ~myStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (or .cse0 (and (< 258 |ULTIMATE.start_FloppyPnp_~__cil_tmp30~0#1|) (<= |ULTIMATE.start_FloppyPnp_~__cil_tmp30~0#1| 259))) (= ~pended~0 0) (= ~SKIP1~0 3))) [2021-11-23 03:55:58,399 INFO L858 garLoopResultBuilder]: For program point L345-1(line 345) no Hoare annotation was computed. [2021-11-23 03:55:58,399 INFO L858 garLoopResultBuilder]: For program point L213(lines 213 428) no Hoare annotation was computed. [2021-11-23 03:55:58,399 INFO L858 garLoopResultBuilder]: For program point L147(lines 147 149) no Hoare annotation was computed. [2021-11-23 03:55:58,399 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2021-11-23 03:55:58,399 INFO L854 garLoopResultBuilder]: At program point L511(line 511) the Hoare annotation is: (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= 2 ~DC~0) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (= ~pended~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,400 INFO L858 garLoopResultBuilder]: For program point L511-1(line 511) no Hoare annotation was computed. [2021-11-23 03:55:58,400 INFO L854 garLoopResultBuilder]: At program point L412(line 412) the Hoare annotation is: false [2021-11-23 03:55:58,400 INFO L858 garLoopResultBuilder]: For program point L412-1(lines 408 414) no Hoare annotation was computed. [2021-11-23 03:55:58,400 INFO L854 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2021-11-23 03:55:58,400 INFO L858 garLoopResultBuilder]: For program point L247-1(lines 243 249) no Hoare annotation was computed. [2021-11-23 03:55:58,401 INFO L854 garLoopResultBuilder]: At program point L710(lines 710 749) the Hoare annotation is: (and (<= 6 ~MPR3~0) (= 2 ~DC~0) (= |ULTIMATE.start_main_~status~1#1| ~lowerDriverReturn~0) (not (= 2 ~s~0)) (not (= ~IPC~0 2)) (= ~myStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR1~0 ~s~0)) (not (= ~MPR3~0 ~s~0)) (not (= ~s~0 1)) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,401 INFO L854 garLoopResultBuilder]: At program point L710-1(lines 704 808) the Hoare annotation is: (let ((.cse11 (= ~compRegistered~0 0)) (.cse1 (= ~s~0 ~DC~0)) (.cse2 (= 2 ~s~0)) (.cse3 (not (= ~IPC~0 2))) (.cse4 (= ~NP~0 1)) (.cse5 (not (= ~MPR3~0 1))) (.cse6 (= ~pended~0 0)) (.cse7 (= ~SKIP1~0 3))) (let ((.cse0 (not (= ~SKIP2~0 2))) (.cse12 (= 2 ~DC~0)) (.cse13 (= ~SKIP2~0 ~s~0)) (.cse8 (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7) (and (= ~compRegistered~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse10 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ |ULTIMATE.start_main_~status~1#1| 1073741738) 0) .cse4 .cse5 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res#1|) 0) .cse6 .cse7) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res#1| 1) 0) (<= (+ |ULTIMATE.start_main_~status~1#1| 1) 0) .cse8 (<= (+ |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 1) 0) .cse9 .cse10 (<= (+ |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 1) 0)) (and (= (+ |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 1073741823) 0) .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 (= (+ |ULTIMATE.start_main_~status~1#1| 1073741823) 0) (= (+ 1073741823 |ULTIMATE.start_FloppyPnp_#res#1|) 0) .cse11 .cse7) (and (<= |ULTIMATE.start_FloppyPnp_#res#1| ~lowerDriverReturn~0) .cse12 (< |ULTIMATE.start_main_~status~1#1| (+ ~lowerDriverReturn~0 1)) (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~1#1|) (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res#1|) .cse3 .cse9 .cse4 .cse5 .cse10 .cse6 .cse11 .cse13 .cse7) (and .cse12 (= |ULTIMATE.start_main_~status~1#1| ~lowerDriverReturn~0) .cse3 .cse9 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| ~lowerDriverReturn~0) (= ~customIrp~0 0) .cse4 .cse5 .cse10 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res#1|) .cse11 .cse13 .cse7) (and (<= 6 ~MPR3~0) (or (<= |ULTIMATE.start_main_~status~1#1| 258) (<= 260 |ULTIMATE.start_main_~status~1#1|)) .cse8 (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|)) .cse9 .cse10)))) [2021-11-23 03:55:58,401 INFO L858 garLoopResultBuilder]: For program point L380(lines 380 386) no Hoare annotation was computed. [2021-11-23 03:55:58,401 INFO L854 garLoopResultBuilder]: At program point L314(line 314) the Hoare annotation is: (and (= 3 ~s~0) (= 2 ~DC~0) (not (= ~IPC~0 2)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,402 INFO L858 garLoopResultBuilder]: For program point L314-1(line 314) no Hoare annotation was computed. [2021-11-23 03:55:58,402 INFO L854 garLoopResultBuilder]: At program point L546(lines 533 573) 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) (= 2 ~DC~0) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (<= 0 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (not (= ~IPC~0 2)) (= ~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) (<= 4 ~SKIP2~0) (or (<= 260 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 258)) (= ~pended~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,402 INFO L858 garLoopResultBuilder]: For program point L216(lines 216 427) no Hoare annotation was computed. [2021-11-23 03:55:58,402 INFO L854 garLoopResultBuilder]: At program point L217(lines 213 428) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,402 INFO L854 garLoopResultBuilder]: At program point L647(lines 615 649) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= 6 ~MPR3~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (or (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|))) (.cse4 (not (= ~IPC~0 2))) (.cse5 (= ~s~0 ~NP~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~NP~0 1)) (.cse8 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (= ~pended~0 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 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) .cse3 .cse4 .cse5 .cse6 (or (<= |ULTIMATE.start_FlFdcDeviceIo_#res#1| 258) (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res#1|)) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res#1| 1073741670) 0) .cse7 .cse8 .cse9 .cse10 .cse11))) [2021-11-23 03:55:58,403 INFO L858 garLoopResultBuilder]: For program point L515(lines 515 520) no Hoare annotation was computed. [2021-11-23 03:55:58,403 INFO L854 garLoopResultBuilder]: At program point L515-2(lines 515 520) the Hoare annotation is: (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= 2 ~DC~0) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (= ~pended~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,403 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-11-23 03:55:58,403 INFO L854 garLoopResultBuilder]: At program point L284(line 284) the Hoare annotation is: (and (= 3 ~s~0) (= 2 ~DC~0) (not (= ~IPC~0 2)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,403 INFO L858 garLoopResultBuilder]: For program point L284-1(line 284) no Hoare annotation was computed. [2021-11-23 03:55:58,404 INFO L854 garLoopResultBuilder]: At program point L384(line 384) the Hoare annotation is: false [2021-11-23 03:55:58,404 INFO L858 garLoopResultBuilder]: For program point L384-1(lines 380 386) no Hoare annotation was computed. [2021-11-23 03:55:58,404 INFO L858 garLoopResultBuilder]: For program point L219(lines 219 426) no Hoare annotation was computed. [2021-11-23 03:55:58,404 INFO L854 garLoopResultBuilder]: At program point L781(lines 768 801) the Hoare annotation is: (let ((.cse8 (= ~s~0 ~DC~0)) (.cse9 (= 2 ~s~0)) (.cse4 (not (= ~IPC~0 2))) (.cse5 (not (= ~MPR3~0 1))) (.cse6 (= ~compRegistered~0 0)) (.cse7 (= ~SKIP1~0 3))) (let ((.cse0 (or (and (= ~compRegistered~0 1) .cse8 .cse9 .cse4 .cse5 .cse7) (and .cse8 .cse9 .cse4 .cse5 .cse6 .cse7))) (.cse1 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (<= 4 ~SKIP2~0)) (.cse2 (= ~NP~0 1))) (or (and (<= 6 ~MPR3~0) .cse0 (or (<= |ULTIMATE.start_main_~status~1#1| 258) (<= 260 |ULTIMATE.start_main_~status~1#1|)) (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|)) .cse1 .cse2 .cse3) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res#1| 1) 0) .cse0 (<= (+ |ULTIMATE.start_main_~status~1#1| 1) 0) (<= (+ |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 1) 0) .cse1 .cse2 .cse3 (<= (+ |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 1) 0)) (and (<= |ULTIMATE.start_FloppyPnp_#res#1| ~lowerDriverReturn~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (< |ULTIMATE.start_main_~status~1#1| (+ ~lowerDriverReturn~0 1)) (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~1#1|) (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res#1|) .cse4 .cse2 .cse5 .cse3 .cse6 (= ~SKIP2~0 ~s~0) .cse7) (and (not (= ~SKIP2~0 2)) .cse8 .cse9 .cse4 (<= (+ |ULTIMATE.start_main_~status~1#1| 1073741738) 0) .cse2 .cse5 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res#1|) 0) .cse7)))) [2021-11-23 03:55:58,405 INFO L854 garLoopResultBuilder]: At program point L517(line 517) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0))) (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (or .cse0 (= ~MPR3~0 ~s~0)) (not (= ~IPC~0 2)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (= ~pended~0 0) (or .cse0 (= 259 |ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0#1|)) (= ~SKIP1~0 3))) [2021-11-23 03:55:58,405 INFO L858 garLoopResultBuilder]: For program point L517-1(line 517) no Hoare annotation was computed. [2021-11-23 03:55:58,405 INFO L854 garLoopResultBuilder]: At program point L418(line 418) the Hoare annotation is: (and (= 3 ~s~0) (= 2 ~DC~0) (not (= ~IPC~0 2)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,405 INFO L858 garLoopResultBuilder]: For program point L418-1(line 418) no Hoare annotation was computed. [2021-11-23 03:55:58,406 INFO L854 garLoopResultBuilder]: At program point L253(line 253) the Hoare annotation is: (and (= 3 ~s~0) (= 2 ~DC~0) (not (= ~IPC~0 2)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,406 INFO L858 garLoopResultBuilder]: For program point L253-1(line 253) no Hoare annotation was computed. [2021-11-23 03:55:58,406 INFO L854 garLoopResultBuilder]: At program point L121(lines 121 151) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,406 INFO L858 garLoopResultBuilder]: For program point L121-2(lines 113 161) no Hoare annotation was computed. [2021-11-23 03:55:58,406 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 425) no Hoare annotation was computed. [2021-11-23 03:55:58,406 INFO L858 garLoopResultBuilder]: For program point L751(lines 751 755) no Hoare annotation was computed. [2021-11-23 03:55:58,407 INFO L854 garLoopResultBuilder]: At program point L553-2(lines 553 569) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= 6 ~MPR3~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0)) (.cse4 (not (= ~IPC~0 2))) (.cse5 (= ~s~0 ~NP~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~NP~0 1)) (.cse8 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (= ~pended~0 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 .cse6 (or (<= |ULTIMATE.start_FlFdcDeviceIo_#res#1| 258) (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res#1|)) .cse7 .cse8 .cse9 (or (<= 260 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 258)) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 1) 0)))) [2021-11-23 03:55:58,407 INFO L854 garLoopResultBuilder]: At program point L421(lines 232 422) the Hoare annotation is: (let ((.cse9 (= ~compRegistered~0 0)) (.cse13 (not (= ~SKIP2~0 2))) (.cse14 (= ~s~0 ~DC~0)) (.cse15 (= 2 ~s~0)) (.cse5 (not (= ~IPC~0 2))) (.cse6 (not (= ~MPR3~0 1))) (.cse7 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse8 (= ~pended~0 0)) (.cse11 (= ~SKIP1~0 3))) (let ((.cse4 (= 2 ~DC~0)) (.cse10 (= ~SKIP2~0 ~s~0)) (.cse12 (= (+ |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 1073741823) 0)) (.cse0 (or (and .cse13 .cse14 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11) (and (= ~compRegistered~0 1) .cse13 .cse14 .cse15 .cse5 .cse6 .cse7 .cse8 .cse11))) (.cse1 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (= ~NP~0 1)) (.cse3 (<= 4 ~SKIP2~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) (and (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|) .cse4 .cse5 .cse1 .cse2 .cse6 .cse7 .cse3 .cse8 (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| ~lowerDriverReturn~0) .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2) (and .cse4 .cse5 .cse1 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| ~lowerDriverReturn~0) (= ~customIrp~0 0) .cse2 .cse6 .cse7 .cse3 .cse9 .cse10 .cse11) (and .cse12 .cse13 .cse14 .cse15 .cse5 .cse1 .cse2 .cse6 .cse7 .cse9 .cse11) (and .cse0 (<= (+ |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 1) 0) .cse1 .cse2 .cse3 (<= (+ |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 1) 0))))) [2021-11-23 03:55:58,407 INFO L854 garLoopResultBuilder]: At program point L355(line 355) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= 6 ~MPR3~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (not (= ~IPC~0 2))) (.cse4 (= ~s~0 ~NP~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~customIrp~0 0)) (.cse7 (= ~NP~0 1)) (.cse8 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (= ~pended~0 0)) (.cse11 (= ~SKIP1~0 3))) (or (and .cse0 .cse1 (= ~setEventCalled~0 1) .cse2 (or (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) .cse3 .cse4 (= ~myStatus~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2021-11-23 03:55:58,408 INFO L858 garLoopResultBuilder]: For program point L322(lines 322 334) no Hoare annotation was computed. [2021-11-23 03:55:58,408 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-23 03:55:58,408 INFO L854 garLoopResultBuilder]: At program point L223(lines 219 426) the Hoare annotation is: (and (<= 6 ~MPR3~0) (= 2 ~DC~0) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,408 INFO L854 garLoopResultBuilder]: At program point L157(line 157) the Hoare annotation is: false [2021-11-23 03:55:58,408 INFO L858 garLoopResultBuilder]: For program point L157-1(lines 153 159) no Hoare annotation was computed. [2021-11-23 03:55:58,408 INFO L858 garLoopResultBuilder]: For program point L587(lines 587 592) no Hoare annotation was computed. [2021-11-23 03:55:58,409 INFO L854 garLoopResultBuilder]: At program point L554(lines 553 569) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= 6 ~MPR3~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0)) (.cse4 (not (= ~IPC~0 2))) (.cse5 (= ~s~0 ~NP~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~NP~0 1)) (.cse8 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (= ~pended~0 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 .cse6 (or (<= |ULTIMATE.start_FlFdcDeviceIo_#res#1| 258) (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res#1|)) .cse7 .cse8 .cse9 (or (<= 260 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 258)) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 1) 0)))) [2021-11-23 03:55:58,409 INFO L858 garLoopResultBuilder]: For program point L587-2(lines 587 592) no Hoare annotation was computed. [2021-11-23 03:55:58,409 INFO L854 garLoopResultBuilder]: At program point L324(line 324) the Hoare annotation is: false [2021-11-23 03:55:58,409 INFO L854 garLoopResultBuilder]: At program point L225(lines 225 424) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,409 INFO L858 garLoopResultBuilder]: For program point L787(lines 787 799) no Hoare annotation was computed. [2021-11-23 03:55:58,410 INFO L854 garLoopResultBuilder]: At program point L589(lines 589 590) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= 6 ~MPR3~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0)) (.cse4 (<= 0 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|)) (.cse5 (not (= ~IPC~0 2))) (.cse6 (= ~s~0 ~NP~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ~NP~0 1)) (.cse9 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (= ~pended~0 0)) (.cse12 (= ~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 .cse6 .cse7 (or (<= |ULTIMATE.start_FlFdcDeviceIo_#res#1| 258) (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res#1|)) .cse8 .cse9 .cse10 (or (<= 260 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 258)) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2021-11-23 03:55:58,410 INFO L858 garLoopResultBuilder]: For program point L589-1(lines 589 590) no Hoare annotation was computed. [2021-11-23 03:55:58,410 INFO L854 garLoopResultBuilder]: At program point L292(line 292) the Hoare annotation is: (and (= (+ |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 1073741823) 0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,410 INFO L854 garLoopResultBuilder]: At program point L160(lines 100 162) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,410 INFO L858 garLoopResultBuilder]: For program point L788(lines 788 792) no Hoare annotation was computed. [2021-11-23 03:55:58,411 INFO L854 garLoopResultBuilder]: At program point L392(line 392) the Hoare annotation is: (and (= 3 ~s~0) (= 2 ~DC~0) (not (= ~IPC~0 2)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,411 INFO L858 garLoopResultBuilder]: For program point L392-1(line 392) no Hoare annotation was computed. [2021-11-23 03:55:58,411 INFO L858 garLoopResultBuilder]: For program point L327(lines 327 333) no Hoare annotation was computed. [2021-11-23 03:55:58,411 INFO L858 garLoopResultBuilder]: For program point L327-1(lines 322 334) no Hoare annotation was computed. [2021-11-23 03:55:58,411 INFO L854 garLoopResultBuilder]: At program point L228(lines 228 423) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,412 INFO L854 garLoopResultBuilder]: At program point L790(line 790) the Hoare annotation is: false [2021-11-23 03:55:58,412 INFO L854 garLoopResultBuilder]: At program point L757(lines 750 805) the Hoare annotation is: (let ((.cse10 (= ~compRegistered~0 0)) (.cse1 (= ~s~0 ~DC~0)) (.cse2 (= 2 ~s~0)) (.cse3 (not (= ~IPC~0 2))) (.cse4 (= ~NP~0 1)) (.cse5 (not (= ~MPR3~0 1))) (.cse6 (= ~pended~0 0)) (.cse7 (= ~SKIP1~0 3))) (let ((.cse0 (not (= ~SKIP2~0 2))) (.cse8 (= 2 ~DC~0)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse12 (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse7) (and (= ~compRegistered~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ |ULTIMATE.start_main_~status~1#1| 1073741738) 0) .cse4 .cse5 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res#1|) 0) .cse6 .cse7) (and (<= 5 ~MPR1~0) .cse8 (= |ULTIMATE.start_main_~status~1#1| ~lowerDriverReturn~0) .cse3 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| ~lowerDriverReturn~0) (= ~customIrp~0 0) .cse4 .cse5 .cse9 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res#1|) .cse10 .cse11 .cse7) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res#1| 1) 0) (<= (+ |ULTIMATE.start_main_~status~1#1| 1) 0) .cse12 (<= (+ |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 1) 0) .cse13 .cse9 (<= (+ |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 1) 0)) (and (= (+ |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 1073741823) 0) .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 (= (+ |ULTIMATE.start_main_~status~1#1| 1073741823) 0) (= (+ 1073741823 |ULTIMATE.start_FloppyPnp_#res#1|) 0) .cse10 .cse7) (and (<= |ULTIMATE.start_FloppyPnp_#res#1| ~lowerDriverReturn~0) .cse8 (< |ULTIMATE.start_main_~status~1#1| (+ ~lowerDriverReturn~0 1)) (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~1#1|) (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res#1|) .cse3 .cse13 .cse4 .cse5 .cse9 .cse6 .cse10 .cse11 .cse7) (and (<= 6 ~MPR3~0) (or (<= |ULTIMATE.start_main_~status~1#1| 258) (<= 260 |ULTIMATE.start_main_~status~1#1|)) .cse12 (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|)) .cse13 .cse9)))) [2021-11-23 03:55:58,412 INFO L858 garLoopResultBuilder]: For program point L394(lines 394 399) no Hoare annotation was computed. [2021-11-23 03:55:58,412 INFO L854 garLoopResultBuilder]: At program point L394-2(lines 232 420) the Hoare annotation is: (and (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|) (= 2 ~DC~0) (not (= ~IPC~0 2)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| ~lowerDriverReturn~0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,412 INFO L858 garLoopResultBuilder]: For program point L494(lines 494 506) no Hoare annotation was computed. [2021-11-23 03:55:58,413 INFO L854 garLoopResultBuilder]: At program point L329(line 329) the Hoare annotation is: false [2021-11-23 03:55:58,413 INFO L858 garLoopResultBuilder]: For program point L263(lines 263 294) no Hoare annotation was computed. [2021-11-23 03:55:58,413 INFO L858 garLoopResultBuilder]: For program point L759(lines 759 763) no Hoare annotation was computed. [2021-11-23 03:55:58,413 INFO L854 garLoopResultBuilder]: At program point L396(lines 396 397) the Hoare annotation is: (and (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|) (= 2 ~DC~0) (not (= ~IPC~0 2)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| ~lowerDriverReturn~0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,413 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 369) no Hoare annotation was computed. [2021-11-23 03:55:58,413 INFO L858 garLoopResultBuilder]: For program point L396-1(lines 396 397) no Hoare annotation was computed. [2021-11-23 03:55:58,414 INFO L854 garLoopResultBuilder]: At program point L231(lines 230 423) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,414 INFO L854 garLoopResultBuilder]: At program point L132(lines 132 139) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,414 INFO L858 garLoopResultBuilder]: For program point L727(lines 727 729) no Hoare annotation was computed. [2021-11-23 03:55:58,414 INFO L854 garLoopResultBuilder]: At program point L496(line 496) the Hoare annotation is: false [2021-11-23 03:55:58,414 INFO L854 garLoopResultBuilder]: At program point L265(lines 265 266) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2021-11-23 03:55:58,415 INFO L858 garLoopResultBuilder]: For program point L298-1(lines 232 420) no Hoare annotation was computed. [2021-11-23 03:55:58,415 INFO L858 garLoopResultBuilder]: For program point L265-1(lines 265 266) no Hoare annotation was computed. [2021-11-23 03:55:58,415 INFO L858 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2021-11-23 03:55:58,415 INFO L854 garLoopResultBuilder]: At program point L944(lines 944 956) the Hoare annotation is: (let ((.cse2 (not (= ~compRegistered~0 0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (= 3 |old(~s~0)|))) (.cse9 (= ~MPR3~0 1)) (.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse3 (= ~IPC~0 2)) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse7 (not (= 2 ~DC~0))) (.cse8 (= ~s~0 |old(~s~0)|)) (.cse10 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 (not (= ~customIrp~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 (not (<= ~myStatus~0 0)) .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse3 .cse4 (not (<= 6 ~MPR3~0)) .cse7 .cse8 (not (= ~compRegistered~0 1)) .cse10))) [2021-11-23 03:55:58,416 INFO L854 garLoopResultBuilder]: At program point L944-1(lines 944 956) the Hoare annotation is: (let ((.cse6 (not (= ~pended~0 0))) (.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse7 (not (= ~compRegistered~0 0))) (.cse2 (= ~IPC~0 2)) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse8 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse9 (not (= 3 |old(~s~0)|))) (.cse5 (not (= 2 ~DC~0))) (.cse10 (= ~s~0 |old(~s~0)|)) (.cse11 (= ~MPR3~0 1))) (and (or .cse0 (not (<= ~myStatus~0 0)) .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .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 .cse7 .cse2 .cse3 .cse8 .cse9 .cse5 .cse10 .cse11 .cse6) (or .cse0 .cse1 (not (= ~customIrp~0 0)) .cse7 .cse2 .cse3 .cse8 .cse9 .cse5 .cse10 .cse11))) [2021-11-23 03:55:58,416 INFO L854 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 936 1008) the Hoare annotation is: (let ((.cse2 (not (= ~compRegistered~0 0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (= 3 |old(~s~0)|))) (.cse9 (= ~MPR3~0 1)) (.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse3 (= ~IPC~0 2)) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse7 (not (= 2 ~DC~0))) (.cse8 (= ~s~0 |old(~s~0)|)) (.cse10 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 (not (= ~customIrp~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 (not (<= ~myStatus~0 0)) .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse3 .cse4 (not (<= 6 ~MPR3~0)) .cse7 .cse8 (not (= ~compRegistered~0 1)) .cse10))) [2021-11-23 03:55:58,416 INFO L858 garLoopResultBuilder]: For program point L987(lines 987 1004) no Hoare annotation was computed. [2021-11-23 03:55:58,416 INFO L858 garLoopResultBuilder]: For program point L950(lines 950 954) no Hoare annotation was computed. [2021-11-23 03:55:58,416 INFO L858 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 936 1008) no Hoare annotation was computed. [2021-11-23 03:55:58,417 INFO L854 garLoopResultBuilder]: At program point L979(lines 943 1007) the Hoare annotation is: (let ((.cse6 (not (= ~pended~0 0))) (.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse7 (not (= ~compRegistered~0 0))) (.cse2 (= ~IPC~0 2)) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse8 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse9 (not (= 3 |old(~s~0)|))) (.cse5 (not (= 2 ~DC~0))) (.cse10 (= ~s~0 |old(~s~0)|)) (.cse11 (= ~MPR3~0 1))) (and (or .cse0 (not (<= ~myStatus~0 0)) .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .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 .cse7 .cse2 .cse3 .cse8 .cse9 .cse5 .cse10 .cse11 .cse6) (or .cse0 .cse1 (not (= ~customIrp~0 0)) .cse7 .cse2 .cse3 .cse8 .cse9 .cse5 .cse10 .cse11))) [2021-11-23 03:55:58,417 INFO L858 garLoopResultBuilder]: For program point L996(lines 996 1003) no Hoare annotation was computed. [2021-11-23 03:55:58,417 INFO L854 garLoopResultBuilder]: At program point L930(line 930) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse6 (not (= ~compRegistered~0 0))) (.cse2 (= ~IPC~0 2)) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= 3 |old(~s~0)|))) (.cse4 (not (= 2 ~DC~0))) (.cse9 (= ~MPR3~0 1)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 (not (<= ~myStatus~0 0)) .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3 (not (<= 6 ~MPR3~0)) .cse4 (not (= ~compRegistered~0 1)) .cse5) (or .cse0 .cse1 (not (= ~customIrp~0 0)) .cse6 .cse2 .cse3 .cse7 .cse8 .cse4 .cse9) (or .cse0 .cse1 .cse6 .cse2 .cse3 .cse7 .cse8 .cse4 .cse9 .cse5))) [2021-11-23 03:55:58,417 INFO L854 garLoopResultBuilder]: At program point L930-1(lines 922 935) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse7 (not (= ~compRegistered~0 0))) (.cse2 (= ~IPC~0 2)) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse8 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse9 (not (= 3 |old(~s~0)|))) (.cse5 (not (= 2 ~DC~0))) (.cse10 (= ~MPR3~0 1)) (.cse6 (not (= ~pended~0 0)))) (and (or .cse0 (not (<= ~myStatus~0 0)) .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .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 (not (= ~customIrp~0 0)) .cse7 .cse2 .cse3 .cse8 .cse9 .cse5 .cse10) (or .cse0 .cse1 .cse7 .cse2 .cse3 .cse8 .cse9 .cse5 .cse10 .cse6))) [2021-11-23 03:55:58,418 INFO L858 garLoopResultBuilder]: For program point L926(lines 926 932) no Hoare annotation was computed. [2021-11-23 03:55:58,418 INFO L854 garLoopResultBuilder]: At program point L1001(line 1001) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse6 (not (= ~compRegistered~0 0))) (.cse2 (= ~IPC~0 2)) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= 3 |old(~s~0)|))) (.cse4 (not (= 2 ~DC~0))) (.cse9 (= ~MPR3~0 1)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 (not (<= ~myStatus~0 0)) .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3 (not (<= 6 ~MPR3~0)) .cse4 (not (= ~compRegistered~0 1)) .cse5) (or .cse0 .cse1 (not (= ~customIrp~0 0)) .cse6 .cse2 .cse3 .cse7 .cse8 .cse4 .cse9) (or .cse0 .cse1 .cse6 .cse2 .cse3 .cse7 .cse8 .cse4 .cse9 .cse5))) [2021-11-23 03:55:58,418 INFO L858 garLoopResultBuilder]: For program point L1001-1(lines 983 1005) no Hoare annotation was computed. [2021-11-23 03:55:58,422 INFO L732 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] [2021-11-23 03:55:58,424 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 03:55:58,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:55:58 BoogieIcfgContainer [2021-11-23 03:55:58,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 03:55:58,507 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 03:55:58,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 03:55:58,511 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 03:55:58,511 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:26" (3/4) ... [2021-11-23 03:55:58,515 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-23 03:55:58,521 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2021-11-23 03:55:58,522 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2021-11-23 03:55:58,522 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2021-11-23 03:55:58,522 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2021-11-23 03:55:58,522 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2021-11-23 03:55:58,557 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 112 nodes and edges [2021-11-23 03:55:58,560 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2021-11-23 03:55:58,563 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-11-23 03:55:58,566 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-23 03:55:58,603 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(IPC == 2)) && status + 1073741738 <= 0) && NP == 1) && !(MPR3 == 1)) && 1073741738 + \result <= 0) && pended == 0) && SKIP1 == 3) || ((((((\result + 1 <= 0 && status + 1 <= 0) && ((((((((s == DC && 2 == s) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && SKIP1 == 3) || (((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && pended == 0) && SKIP1 == 3))) && ntStatus + 1 <= 0) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && ntStatus + 1 <= 0)) || (((((((((((ntStatus + 1073741823 == 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status + 1073741823 == 0) && 1073741823 + \result == 0) && compRegistered == 0) && SKIP1 == 3)) || (((((((((((((\result <= lowerDriverReturn && 2 == DC) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3)) || ((((((((((((2 == DC && status == lowerDriverReturn) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && ntStatus == lowerDriverReturn) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && lowerDriverReturn == \result) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3)) || ((((((6 <= MPR3 && (status <= 258 || 260 <= status)) && ((((((((s == DC && 2 == s) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && SKIP1 == 3) || (((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && pended == 0) && SKIP1 == 3))) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) [2021-11-23 03:55:58,604 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(IPC == 2)) && status + 1073741738 <= 0) && NP == 1) && !(MPR3 == 1)) && 1073741738 + \result <= 0) && pended == 0) && SKIP1 == 3) || ((((((((((((5 <= MPR1 && 2 == DC) && status == lowerDriverReturn) && !(IPC == 2)) && ntStatus == lowerDriverReturn) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && lowerDriverReturn == \result) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3)) || ((((((\result + 1 <= 0 && status + 1 <= 0) && ((((((((s == DC && 2 == s) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && SKIP1 == 3) || (((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && pended == 0) && SKIP1 == 3))) && ntStatus + 1 <= 0) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && ntStatus + 1 <= 0)) || (((((((((((ntStatus + 1073741823 == 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status + 1073741823 == 0) && 1073741823 + \result == 0) && compRegistered == 0) && SKIP1 == 3)) || (((((((((((((\result <= lowerDriverReturn && 2 == DC) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3)) || ((((((6 <= MPR3 && (status <= 258 || 260 <= status)) && ((((((((s == DC && 2 == s) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && SKIP1 == 3) || (((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && pended == 0) && SKIP1 == 3))) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) [2021-11-23 03:55:58,604 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((6 <= MPR3 && ((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && SKIP1 == 3) || (((((s == DC && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && compRegistered == 0) && SKIP1 == 3))) && (status <= 258 || 260 <= status)) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) || (((((((\result + 1 <= 0 && ((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && SKIP1 == 3) || (((((s == DC && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && compRegistered == 0) && SKIP1 == 3))) && status + 1 <= 0) && ntStatus + 1 <= 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && ntStatus + 1 <= 0)) || ((((((((((((\result <= lowerDriverReturn && 5 <= MPR1) && 2 == DC) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3)) || ((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(IPC == 2)) && status + 1073741738 <= 0) && NP == 1) && !(MPR3 == 1)) && 1073741738 + \result <= 0) && SKIP1 == 3) [2021-11-23 03:55:58,605 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((6 <= MPR3 && ((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && SKIP1 == 3) || (((((s == DC && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && compRegistered == 0) && SKIP1 == 3))) && (status <= 258 || 260 <= status)) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) || (((((((\result + 1 <= 0 && ((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && SKIP1 == 3) || (((((s == DC && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && compRegistered == 0) && SKIP1 == 3))) && status + 1 <= 0) && ntStatus + 1 <= 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && ntStatus + 1 <= 0)) || ((((((((((((\result <= lowerDriverReturn && 5 <= MPR1) && 2 == DC) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3)) || ((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(IPC == 2)) && status + 1073741738 <= 0) && NP == 1) && !(MPR3 == 1)) && 1073741738 + \result <= 0) && SKIP1 == 3) [2021-11-23 03:55:58,606 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(NP == 1) || !(\old(customIrp) == 0)) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(compRegistered == 0)) || (customIrp == 0 && s == \old(s))) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(2 == DC)) || MPR3 == 1) && (((((((((((((!(NP == 1) || !(myStatus <= 0)) || !(SKIP1 == 3)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || (\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)) [2021-11-23 03:55:58,607 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(NP == 1) || !(myStatus <= 0)) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(5 <= MPR1)) || IPC == 2) || !(4 <= SKIP2)) || !(6 <= MPR3)) || (((setEventCalled == 1 && 0 <= __cil_tmp7 + 1073741802) && MPR1 == s) && __cil_tmp7 + 1073741802 <= 0)) || !(2 == DC)) || !(compRegistered == 1)) || !(pended == 0)) && (((((((((!(NP == 1) || !(SKIP1 == 3)) || !(customIrp == 0)) || !(compRegistered == 0)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(2 == DC)) || MPR3 == 1)) && (((((((((!(NP == 1) || !(SKIP1 == 3)) || !(compRegistered == 0)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(2 == DC)) || MPR3 == 1) || !(pended == 0)) [2021-11-23 03:55:58,607 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(NP == 1) || !(myStatus <= 0)) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(5 <= MPR1)) || IPC == 2) || !(4 <= SKIP2)) || !(6 <= MPR3)) || (((setEventCalled == 1 && 0 <= __cil_tmp7 + 1073741802) && MPR1 == s) && __cil_tmp7 + 1073741802 <= 0)) || !(2 == DC)) || !(compRegistered == 1)) || !(pended == 0)) && ((((((((((!(NP == 1) || !(SKIP1 == 3)) || !(compRegistered == 0)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(2 == DC)) || s == \old(s)) || MPR3 == 1) || !(pended == 0))) && ((((((((((!(NP == 1) || !(SKIP1 == 3)) || !(customIrp == 0)) || !(compRegistered == 0)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(2 == DC)) || s == \old(s)) || MPR3 == 1) [2021-11-23 03:55:58,608 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((6 <= MPR3 && ((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && status == 0) && pended == 0) && SKIP1 == 3) || (((((((s == DC && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && status == 0) && pended == 0) && compRegistered == 0) && SKIP1 == 3))) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) || ((((((((((((2 == DC && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && ntStatus == lowerDriverReturn) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && status == 0) && 4 <= SKIP2) && lowerDriverReturn == \result) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3)) || (((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && status == 0) && 1073741738 + \result <= 0) && pended == 0) && SKIP1 == 3)) || (((((((((((ntStatus + 1073741823 == 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 1073741823 + \result == 0) && compRegistered == 0) && SKIP1 == 3)) || ((((((\result + 1 <= 0 && ((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && status == 0) && pended == 0) && SKIP1 == 3) || (((((((s == DC && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && status == 0) && pended == 0) && compRegistered == 0) && SKIP1 == 3))) && ntStatus + 1 <= 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && ntStatus + 1 <= 0)) || ((((((((((((\result <= lowerDriverReturn && 2 == DC) && lowerDriverReturn <= \result) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3) [2021-11-23 03:55:58,616 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(NP == 1) || !(myStatus <= 0)) || !(SKIP1 == 3)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || (((\old(customIrp) == customIrp && setEventCalled == 1) && s == \old(s)) && !(MPR3 == \old(s)))) || !(2 == DC)) || !(compRegistered == 1)) || (!(NP == \old(s)) && !(MPR3 == \old(s)))) || !(pended == 0)) && ((((((((((!(NP == 1) || !(\old(customIrp) == 0)) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(compRegistered == 0)) || (customIrp == 0 && s == \old(s))) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(2 == DC)) || MPR3 == 1) [2021-11-23 03:55:58,616 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(NP == 1) || !(myStatus <= 0)) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(5 <= MPR1)) || IPC == 2) || !(4 <= SKIP2)) || !(6 <= MPR3)) || (((setEventCalled == 1 && 0 <= __cil_tmp7 + 1073741802) && MPR1 == s) && __cil_tmp7 + 1073741802 <= 0)) || !(2 == DC)) || !(compRegistered == 1)) || !(pended == 0)) && ((((((((((!(NP == 1) || !(SKIP1 == 3)) || !(compRegistered == 0)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(2 == DC)) || s == \old(s)) || MPR3 == 1) || !(pended == 0))) && ((((((((((!(NP == 1) || !(SKIP1 == 3)) || !(customIrp == 0)) || !(compRegistered == 0)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(2 == DC)) || s == \old(s)) || MPR3 == 1) [2021-11-23 03:55:58,616 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && (ntStatus <= 258 || 260 <= ntStatus)) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 4 <= SKIP2) && pended == 0) && SKIP1 == 3) || ((((((((((((compRegistered == 1 && 6 <= MPR3) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && \result + 1073741670 <= 0) && NP == 1) && status == 0) && 4 <= SKIP2) && pended == 0) && SKIP1 == 3) [2021-11-23 03:55:58,617 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(NP == 1) || !(SKIP1 == 3)) || !(compRegistered == 0)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(2 == DC)) || s == \old(s)) || MPR3 == 1) || !(pended == 0)) && ((((((((((!(NP == 1) || !(SKIP1 == 3)) || !(customIrp == 0)) || !(compRegistered == 0)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(2 == DC)) || s == \old(s)) || MPR3 == 1)) && (((((((((((!(NP == 1) || !(myStatus <= 0)) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(5 <= MPR1)) || IPC == 2) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || s == \old(s)) || !(compRegistered == 1)) || !(pended == 0)) [2021-11-23 03:55:58,620 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && 0 <= ntStatus) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 4 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && SKIP1 == 3 [2021-11-23 03:55:58,620 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && 0 <= ntStatus) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 4 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && SKIP1 == 3 [2021-11-23 03:55:58,620 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 4 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && SKIP1 == 3) || ((((((((((((compRegistered == 1 && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && status == 0) && 4 <= SKIP2) && pended == 0) && SKIP1 == 3) && ntStatus + 1 <= 0) [2021-11-23 03:55:58,621 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 4 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && SKIP1 == 3) || ((((((((((((compRegistered == 1 && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && status == 0) && 4 <= SKIP2) && pended == 0) && SKIP1 == 3) && ntStatus + 1 <= 0) [2021-11-23 03:55:58,621 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((compRegistered == 1 && 2 == DC) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 4 <= SKIP2) && pended == 0) && SKIP1 == 3) && ntStatus + 1 <= 0) || ((((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && 0 <= ntStatus) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 4 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && SKIP1 == 3)) || (((((((((((((compRegistered == 1 && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && ntStatus <= 0) && 0 <= ntStatus) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && status == 0) && 4 <= SKIP2) && pended == 0) && SKIP1 == 3) [2021-11-23 03:55:58,714 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34e208c7-5898-4e5b-99a7-d9658db418a3/bin/utaipan-EQgc7hIp5V/witness.graphml [2021-11-23 03:55:58,715 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 03:55:58,715 INFO L158 Benchmark]: Toolchain (without parser) took 34619.10ms. Allocated memory was 109.1MB in the beginning and 453.0MB in the end (delta: 343.9MB). Free memory was 68.0MB in the beginning and 269.9MB in the end (delta: -201.9MB). Peak memory consumption was 141.4MB. Max. memory is 16.1GB. [2021-11-23 03:55:58,716 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 109.1MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 03:55:58,716 INFO L158 Benchmark]: CACSL2BoogieTranslator took 636.13ms. Allocated memory is still 109.1MB. Free memory was 67.8MB in the beginning and 74.1MB in the end (delta: -6.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 03:55:58,716 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.79ms. Allocated memory is still 109.1MB. Free memory was 74.1MB in the beginning and 69.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 03:55:58,716 INFO L158 Benchmark]: Boogie Preprocessor took 93.19ms. Allocated memory is still 109.1MB. Free memory was 69.1MB in the beginning and 66.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 03:55:58,717 INFO L158 Benchmark]: RCFGBuilder took 1527.14ms. Allocated memory was 109.1MB in the beginning and 148.9MB in the end (delta: 39.8MB). Free memory was 66.2MB in the beginning and 89.3MB in the end (delta: -23.1MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2021-11-23 03:55:58,717 INFO L158 Benchmark]: TraceAbstraction took 32028.54ms. Allocated memory was 148.9MB in the beginning and 453.0MB in the end (delta: 304.1MB). Free memory was 89.3MB in the beginning and 290.9MB in the end (delta: -201.6MB). Peak memory consumption was 244.9MB. Max. memory is 16.1GB. [2021-11-23 03:55:58,717 INFO L158 Benchmark]: Witness Printer took 207.98ms. Allocated memory is still 453.0MB. Free memory was 290.9MB in the beginning and 269.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-23 03:55:58,719 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.22ms. Allocated memory is still 109.1MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 636.13ms. Allocated memory is still 109.1MB. Free memory was 67.8MB in the beginning and 74.1MB in the end (delta: -6.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.79ms. Allocated memory is still 109.1MB. Free memory was 74.1MB in the beginning and 69.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.19ms. Allocated memory is still 109.1MB. Free memory was 69.1MB in the beginning and 66.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1527.14ms. Allocated memory was 109.1MB in the beginning and 148.9MB in the end (delta: 39.8MB). Free memory was 66.2MB in the beginning and 89.3MB in the end (delta: -23.1MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. * TraceAbstraction took 32028.54ms. Allocated memory was 148.9MB in the beginning and 453.0MB in the end (delta: 304.1MB). Free memory was 89.3MB in the beginning and 290.9MB in the end (delta: -201.6MB). Peak memory consumption was 244.9MB. Max. memory is 16.1GB. * Witness Printer took 207.98ms. Allocated memory is still 453.0MB. Free memory was 290.9MB in the beginning and 269.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. 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: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 162 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.9s, OverallIterations: 41, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5490 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5433 mSDsluCounter, 18117 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14180 mSDsCounter, 778 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7371 IncrementalHoareTripleChecker+Invalid, 8149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 778 mSolverCounterUnsat, 6018 mSDtfsCounter, 7371 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=354occurred in iteration=9, InterpolantAutomatonStates: 249, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 41 MinimizatonAttempts, 484 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 76 LocationsWithAnnotation, 652 PreInvPairs, 828 NumberOfFragments, 5902 HoareAnnotationTreeSize, 652 FomulaSimplifications, 10302 FormulaSimplificationTreeSizeReduction, 4.7s HoareSimplificationTime, 76 FomulaSimplificationsInter, 179747 FormulaSimplificationTreeSizeReductionInter, 10.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1400 NumberOfCodeBlocks, 1400 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1359 ConstructedInterpolants, 0 QuantifiedInterpolants, 4006 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 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: 710]: Loop Invariant Derived loop invariant: (((((((((((((((6 <= MPR3 && 2 == DC) && status == lowerDriverReturn) && !(2 == s)) && !(IPC == 2)) && myStatus == 0) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && status == 0) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && !(MPR1 == s)) && !(MPR3 == s)) && !(s == 1)) && SKIP1 == 3 - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: (((((((((((lowerDriverReturn <= ntStatus && 2 == DC) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 4 <= SKIP2) && pended == 0) && ntStatus <= lowerDriverReturn) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3 - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && 0 <= ntStatus) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 4 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && SKIP1 == 3 - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: ((((((((((((!(NP == 1) || !(myStatus <= 0)) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(5 <= MPR1)) || IPC == 2) || !(4 <= SKIP2)) || !(6 <= MPR3)) || (((setEventCalled == 1 && 0 <= __cil_tmp7 + 1073741802) && MPR1 == s) && __cil_tmp7 + 1073741802 <= 0)) || !(2 == DC)) || !(compRegistered == 1)) || !(pended == 0)) && ((((((((((!(NP == 1) || !(SKIP1 == 3)) || !(compRegistered == 0)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(2 == DC)) || s == \old(s)) || MPR3 == 1) || !(pended == 0))) && ((((((((((!(NP == 1) || !(SKIP1 == 3)) || !(customIrp == 0)) || !(compRegistered == 0)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(2 == DC)) || s == \old(s)) || MPR3 == 1) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((((2 == DC && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 922]: Loop Invariant Derived loop invariant: ((((((((((((!(NP == 1) || !(myStatus <= 0)) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(5 <= MPR1)) || IPC == 2) || !(4 <= SKIP2)) || !(6 <= MPR3)) || (((setEventCalled == 1 && 0 <= __cil_tmp7 + 1073741802) && MPR1 == s) && __cil_tmp7 + 1073741802 <= 0)) || !(2 == DC)) || !(compRegistered == 1)) || !(pended == 0)) && (((((((((!(NP == 1) || !(SKIP1 == 3)) || !(customIrp == 0)) || !(compRegistered == 0)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(2 == DC)) || MPR3 == 1)) && (((((((((!(NP == 1) || !(SKIP1 == 3)) || !(compRegistered == 0)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(2 == DC)) || MPR3 == 1) || !(pended == 0)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: ((((((((((((compRegistered == 1 && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && status == 0) && 4 <= SKIP2) && myStatus <= 0) && pended == 0) && SKIP1 == 3 - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: (((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 4 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && SKIP1 == 3) || ((((((((((((compRegistered == 1 && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && status == 0) && 4 <= SKIP2) && pended == 0) && SKIP1 == 3) && ntStatus + 1 <= 0) - InvariantResult [Line: 670]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 531]: Loop Invariant Derived loop invariant: ((((((((((((compRegistered == 1 && 2 == DC) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 4 <= SKIP2) && pended == 0) && SKIP1 == 3) && ntStatus + 1 <= 0) || ((((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && 0 <= ntStatus) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 4 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && SKIP1 == 3)) || (((((((((((((compRegistered == 1 && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && ntStatus <= 0) && 0 <= ntStatus) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && status == 0) && 4 <= SKIP2) && pended == 0) && SKIP1 == 3) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((6 <= MPR3 && 2 == DC) && ntStatus == 0) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && status == 0) && 4 <= SKIP2) && myStatus <= 0) && pended == 0) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: ((((((((((((!(NP == 1) || !(myStatus <= 0)) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(5 <= MPR1)) || IPC == 2) || !(4 <= SKIP2)) || !(6 <= MPR3)) || (((setEventCalled == 1 && 0 <= __cil_tmp7 + 1073741802) && MPR1 == s) && __cil_tmp7 + 1073741802 <= 0)) || !(2 == DC)) || !(compRegistered == 1)) || !(pended == 0)) && ((((((((((!(NP == 1) || !(SKIP1 == 3)) || !(compRegistered == 0)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(2 == DC)) || s == \old(s)) || MPR3 == 1) || !(pended == 0))) && ((((((((((!(NP == 1) || !(SKIP1 == 3)) || !(customIrp == 0)) || !(compRegistered == 0)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(2 == DC)) || s == \old(s)) || MPR3 == 1) - InvariantResult [Line: 1036]: Loop Invariant Derived loop invariant: ((((((((((((!(NP == 1) || !(myStatus <= 0)) || !(SKIP1 == 3)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || (((\old(customIrp) == customIrp && setEventCalled == 1) && s == \old(s)) && !(MPR3 == \old(s)))) || !(2 == DC)) || !(compRegistered == 1)) || (!(NP == \old(s)) && !(MPR3 == \old(s)))) || !(pended == 0)) && ((((((((((!(NP == 1) || !(\old(customIrp) == 0)) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(compRegistered == 0)) || (customIrp == 0 && s == \old(s))) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(2 == DC)) || MPR3 == 1) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((2 == DC && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((((((((((6 <= MPR3 && ((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && status == 0) && pended == 0) && SKIP1 == 3) || (((((((s == DC && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && status == 0) && pended == 0) && compRegistered == 0) && SKIP1 == 3))) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) || ((((((((((((2 == DC && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && ntStatus == lowerDriverReturn) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && status == 0) && 4 <= SKIP2) && lowerDriverReturn == \result) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3)) || (((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && status == 0) && 1073741738 + \result <= 0) && pended == 0) && SKIP1 == 3)) || (((((((((((ntStatus + 1073741823 == 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 1073741823 + \result == 0) && compRegistered == 0) && SKIP1 == 3)) || ((((((\result + 1 <= 0 && ((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && status == 0) && pended == 0) && SKIP1 == 3) || (((((((s == DC && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && status == 0) && pended == 0) && compRegistered == 0) && SKIP1 == 3))) && ntStatus + 1 <= 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && ntStatus + 1 <= 0)) || ((((((((((((\result <= lowerDriverReturn && 2 == DC) && lowerDriverReturn <= \result) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3) - InvariantResult [Line: 1036]: Loop Invariant Derived loop invariant: ((((((((((!(NP == 1) || !(\old(customIrp) == 0)) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(compRegistered == 0)) || (customIrp == 0 && s == \old(s))) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(2 == DC)) || MPR3 == 1) && (((((((((((((!(NP == 1) || !(myStatus <= 0)) || !(SKIP1 == 3)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || (\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: 901]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((((!(NP == 1) || !(SKIP1 == 3)) || !(compRegistered == 0)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(2 == DC)) || s == \old(s)) || MPR3 == 1) || !(pended == 0)) && ((((((((((!(NP == 1) || !(SKIP1 == 3)) || !(customIrp == 0)) || !(compRegistered == 0)) || IPC == 2) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(2 == DC)) || s == \old(s)) || MPR3 == 1)) && (((((((((((!(NP == 1) || !(myStatus <= 0)) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(5 <= MPR1)) || IPC == 2) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || s == \old(s)) || !(compRegistered == 1)) || !(pended == 0)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: (((((((((2 == DC && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 534]: Loop Invariant Derived loop invariant: (((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && 0 <= ntStatus) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 4 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && SKIP1 == 3 - InvariantResult [Line: 758]: Loop Invariant Derived loop invariant: (((((((((6 <= MPR3 && ((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && SKIP1 == 3) || (((((s == DC && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && compRegistered == 0) && SKIP1 == 3))) && (status <= 258 || 260 <= status)) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) || (((((((\result + 1 <= 0 && ((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && SKIP1 == 3) || (((((s == DC && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && compRegistered == 0) && SKIP1 == 3))) && status + 1 <= 0) && ntStatus + 1 <= 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && ntStatus + 1 <= 0)) || ((((((((((((\result <= lowerDriverReturn && 5 <= MPR1) && 2 == DC) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3)) || ((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(IPC == 2)) && status + 1073741738 <= 0) && NP == 1) && !(MPR3 == 1)) && 1073741738 + \result <= 0) && SKIP1 == 3) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && status == 0) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((((((2 == DC && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && status == 0) && 4 <= SKIP2) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: (((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && (ntStatus <= 258 || 260 <= ntStatus)) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 4 <= SKIP2) && pended == 0) && SKIP1 == 3) || ((((((((((((compRegistered == 1 && 6 <= MPR3) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && \result + 1073741670 <= 0) && NP == 1) && status == 0) && 4 <= SKIP2) && pended == 0) && SKIP1 == 3) - InvariantResult [Line: 750]: Loop Invariant Derived loop invariant: (((((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(IPC == 2)) && status + 1073741738 <= 0) && NP == 1) && !(MPR3 == 1)) && 1073741738 + \result <= 0) && pended == 0) && SKIP1 == 3) || ((((((((((((5 <= MPR1 && 2 == DC) && status == lowerDriverReturn) && !(IPC == 2)) && ntStatus == lowerDriverReturn) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && lowerDriverReturn == \result) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3)) || ((((((\result + 1 <= 0 && status + 1 <= 0) && ((((((((s == DC && 2 == s) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && SKIP1 == 3) || (((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && pended == 0) && SKIP1 == 3))) && ntStatus + 1 <= 0) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && ntStatus + 1 <= 0)) || (((((((((((ntStatus + 1073741823 == 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status + 1073741823 == 0) && 1073741823 + \result == 0) && compRegistered == 0) && SKIP1 == 3)) || (((((((((((((\result <= lowerDriverReturn && 2 == DC) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3)) || ((((((6 <= MPR3 && (status <= 258 || 260 <= status)) && ((((((((s == DC && 2 == s) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && SKIP1 == 3) || (((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && pended == 0) && SKIP1 == 3))) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && status == 0) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && status == 0) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 733]: Loop Invariant Derived loop invariant: (((((((((((6 <= MPR3 && 2 == DC) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && status == 0) && 4 <= SKIP2) && myStatus <= 0) && pended == 0) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 768]: Loop Invariant Derived loop invariant: (((((((((6 <= MPR3 && ((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && SKIP1 == 3) || (((((s == DC && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && compRegistered == 0) && SKIP1 == 3))) && (status <= 258 || 260 <= status)) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) || (((((((\result + 1 <= 0 && ((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && SKIP1 == 3) || (((((s == DC && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && compRegistered == 0) && SKIP1 == 3))) && status + 1 <= 0) && ntStatus + 1 <= 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && ntStatus + 1 <= 0)) || ((((((((((((\result <= lowerDriverReturn && 5 <= MPR1) && 2 == DC) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3)) || ((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(IPC == 2)) && status + 1073741738 <= 0) && NP == 1) && !(MPR3 == 1)) && 1073741738 + \result <= 0) && SKIP1 == 3) - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: (((((((((6 <= MPR3 && (ntStatus <= 258 || 260 <= ntStatus)) && (((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && status == 0) && pended == 0) && compRegistered == 0) && SKIP1 == 3) || ((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && status == 0) && pended == 0) && SKIP1 == 3))) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) || ((((((((((((lowerDriverReturn <= ntStatus && 2 == DC) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 4 <= SKIP2) && pended == 0) && ntStatus <= lowerDriverReturn) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3)) || (((ntStatus + 1073741823 == 0 && (((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && status == 0) && pended == 0) && compRegistered == 0) && SKIP1 == 3) || ((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && status == 0) && pended == 0) && SKIP1 == 3))) && SKIP1 + 2 <= MPR1) && NP == 1)) || (((((((((((2 == DC && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && ntStatus == lowerDriverReturn) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && status == 0) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3)) || ((((((((((ntStatus + 1073741823 == 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && compRegistered == 0) && SKIP1 == 3)) || ((((((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && status == 0) && pended == 0) && compRegistered == 0) && SKIP1 == 3) || ((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && !(MPR3 == 1)) && status == 0) && pended == 0) && SKIP1 == 3)) && ntStatus + 1 <= 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && ntStatus + 1 <= 0) - InvariantResult [Line: 704]: Loop Invariant Derived loop invariant: (((((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(IPC == 2)) && status + 1073741738 <= 0) && NP == 1) && !(MPR3 == 1)) && 1073741738 + \result <= 0) && pended == 0) && SKIP1 == 3) || ((((((\result + 1 <= 0 && status + 1 <= 0) && ((((((((s == DC && 2 == s) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && SKIP1 == 3) || (((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && pended == 0) && SKIP1 == 3))) && ntStatus + 1 <= 0) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && ntStatus + 1 <= 0)) || (((((((((((ntStatus + 1073741823 == 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status + 1073741823 == 0) && 1073741823 + \result == 0) && compRegistered == 0) && SKIP1 == 3)) || (((((((((((((\result <= lowerDriverReturn && 2 == DC) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3)) || ((((((((((((2 == DC && status == lowerDriverReturn) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && ntStatus == lowerDriverReturn) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && lowerDriverReturn == \result) && compRegistered == 0) && SKIP2 == s) && SKIP1 == 3)) || ((((((6 <= MPR3 && (status <= 258 || 260 <= status)) && ((((((((s == DC && 2 == s) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && SKIP1 == 3) || (((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && pended == 0) && SKIP1 == 3))) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: (((((((((((6 <= MPR3 && 2 == DC) && ntStatus == 0) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && status == 0) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: (((((((((((((compRegistered == 1 && 6 <= MPR3) && 2 == DC) && 2 == s) && ntStatus == 0) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 4 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && SKIP1 == 3) || (((((((((((compRegistered == 1 && 2 == DC) && 2 == s) && !(IPC == 2)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 4 <= SKIP2) && pended == 0) && SKIP1 == 3) && ntStatus + 1 <= 0) - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: (((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 4 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && SKIP1 == 3) || ((((((((((((compRegistered == 1 && 6 <= MPR3) && 2 == DC) && ntStatus == 0) && !(IPC == 2)) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && status == 0) && 4 <= SKIP2) && pended == 0) && SKIP1 == 3) && ntStatus + 1 <= 0) RESULT: Ultimate proved your program to be correct! [2021-11-23 03:55:58,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34e208c7-5898-4e5b-99a7-d9658db418a3/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE