./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF --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 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-13 01:31:38,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 01:31:38,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 01:31:38,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 01:31:38,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 01:31:38,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 01:31:38,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 01:31:38,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 01:31:38,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 01:31:38,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 01:31:38,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 01:31:38,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 01:31:38,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 01:31:38,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 01:31:38,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 01:31:38,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 01:31:38,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 01:31:38,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 01:31:38,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 01:31:38,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 01:31:38,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 01:31:38,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 01:31:38,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 01:31:38,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 01:31:38,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 01:31:38,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 01:31:38,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 01:31:38,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 01:31:38,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 01:31:38,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 01:31:38,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 01:31:38,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 01:31:38,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 01:31:38,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 01:31:38,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 01:31:38,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 01:31:38,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 01:31:38,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 01:31:38,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 01:31:38,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 01:31:38,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 01:31:38,752 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-13 01:31:38,795 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 01:31:38,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 01:31:38,796 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-13 01:31:38,796 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-13 01:31:38,796 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-13 01:31:38,797 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-13 01:31:38,797 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-13 01:31:38,797 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-13 01:31:38,797 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-13 01:31:38,804 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-13 01:31:38,805 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-13 01:31:38,805 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-13 01:31:38,806 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-13 01:31:38,806 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-13 01:31:38,806 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-13 01:31:38,806 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-13 01:31:38,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 01:31:38,807 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 01:31:38,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-13 01:31:38,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 01:31:38,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 01:31:38,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-13 01:31:38,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-13 01:31:38,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-13 01:31:38,809 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-13 01:31:38,809 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 01:31:38,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 01:31:38,810 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 01:31:38,810 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-13 01:31:38,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 01:31:38,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-13 01:31:38,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 01:31:38,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 01:31:38,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-13 01:31:38,811 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-13 01:31:38,811 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-13 01:31:38,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-13 01:31:38,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-13 01:31:38,812 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 01:31:38,812 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-13 01:31:38,812 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_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/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_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF 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 -> 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c [2021-11-13 01:31:39,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 01:31:39,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 01:31:39,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 01:31:39,165 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 01:31:39,166 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 01:31:39,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-11-13 01:31:39,229 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/data/6687ad0cf/747665b48c954cc6b7427970aa3a1c82/FLAG838aa8ec8 [2021-11-13 01:31:39,766 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 01:31:39,766 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-11-13 01:31:39,782 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/data/6687ad0cf/747665b48c954cc6b7427970aa3a1c82/FLAG838aa8ec8 [2021-11-13 01:31:40,054 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/data/6687ad0cf/747665b48c954cc6b7427970aa3a1c82 [2021-11-13 01:31:40,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 01:31:40,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-13 01:31:40,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 01:31:40,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 01:31:40,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 01:31:40,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:31:40" (1/1) ... [2021-11-13 01:31:40,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4386bc54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:40, skipping insertion in model container [2021-11-13 01:31:40,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:31:40" (1/1) ... [2021-11-13 01:31:40,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 01:31:40,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 01:31:40,368 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2021-11-13 01:31:40,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 01:31:40,519 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 01:31:40,535 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2021-11-13 01:31:40,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 01:31:40,667 INFO L208 MainTranslator]: Completed translation [2021-11-13 01:31:40,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:40 WrapperNode [2021-11-13 01:31:40,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 01:31:40,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 01:31:40,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 01:31:40,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 01:31:40,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:40" (1/1) ... [2021-11-13 01:31:40,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:40" (1/1) ... [2021-11-13 01:31:40,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 01:31:40,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 01:31:40,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 01:31:40,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 01:31:40,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:40" (1/1) ... [2021-11-13 01:31:40,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:40" (1/1) ... [2021-11-13 01:31:40,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:40" (1/1) ... [2021-11-13 01:31:40,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:40" (1/1) ... [2021-11-13 01:31:40,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:40" (1/1) ... [2021-11-13 01:31:40,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:40" (1/1) ... [2021-11-13 01:31:40,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:40" (1/1) ... [2021-11-13 01:31:40,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 01:31:40,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 01:31:40,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 01:31:40,867 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 01:31:40,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:40" (1/1) ... [2021-11-13 01:31:40,880 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 01:31:40,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/z3 [2021-11-13 01:31:40,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-13 01:31:40,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-13 01:31:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 01:31:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-11-13 01:31:40,973 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-11-13 01:31:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-11-13 01:31:40,973 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-11-13 01:31:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-11-13 01:31:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-11-13 01:31:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2021-11-13 01:31:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2021-11-13 01:31:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2021-11-13 01:31:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2021-11-13 01:31:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-11-13 01:31:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-11-13 01:31:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-13 01:31:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-11-13 01:31:40,975 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-11-13 01:31:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2021-11-13 01:31:40,975 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2021-11-13 01:31:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2021-11-13 01:31:40,975 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2021-11-13 01:31:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 01:31:40,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 01:31:41,186 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-13 01:31:41,260 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-11-13 01:31:41,260 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-11-13 01:31:41,269 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-13 01:31:41,324 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-11-13 01:31:41,324 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-11-13 01:31:41,397 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-13 01:31:41,406 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-13 01:31:41,414 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-13 01:31:41,797 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume !false; [2021-11-13 01:31:41,798 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume false; [2021-11-13 01:31:41,798 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-11-13 01:31:41,798 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-11-13 01:31:41,798 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2021-11-13 01:31:41,798 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2021-11-13 01:31:41,800 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-13 01:31:41,830 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-11-13 01:31:41,831 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-11-13 01:31:42,044 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 01:31:42,045 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-13 01:31:42,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:31:42 BoogieIcfgContainer [2021-11-13 01:31:42,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 01:31:42,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-13 01:31:42,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-13 01:31:42,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-13 01:31:42,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:31:40" (1/3) ... [2021-11-13 01:31:42,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f650f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:31:42, skipping insertion in model container [2021-11-13 01:31:42,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:40" (2/3) ... [2021-11-13 01:31:42,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f650f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:31:42, skipping insertion in model container [2021-11-13 01:31:42,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:31:42" (3/3) ... [2021-11-13 01:31:42,061 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2021-11-13 01:31:42,070 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-13 01:31:42,070 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-13 01:31:42,121 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-13 01:31:42,128 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-13 01:31:42,129 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-13 01:31:42,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 134 states have (on average 1.5298507462686568) internal successors, (205), 151 states have internal predecessors, (205), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2021-11-13 01:31:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-13 01:31:42,158 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:42,159 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 01:31:42,159 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:42,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:42,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1518887749, now seen corresponding path program 1 times [2021-11-13 01:31:42,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:42,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392679547] [2021-11-13 01:31:42,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:42,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:42,469 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-13 01:31:42,470 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:42,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392679547] [2021-11-13 01:31:42,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392679547] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:42,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:42,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 01:31:42,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987525066] [2021-11-13 01:31:42,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:42,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 01:31:42,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:42,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 01:31:42,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 01:31:42,510 INFO L87 Difference]: Start difference. First operand has 189 states, 134 states have (on average 1.5298507462686568) internal successors, (205), 151 states have internal predecessors, (205), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-13 01:31:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:42,747 INFO L93 Difference]: Finished difference Result 419 states and 667 transitions. [2021-11-13 01:31:42,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 01:31:42,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 9 [2021-11-13 01:31:42,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:42,773 INFO L225 Difference]: With dead ends: 419 [2021-11-13 01:31:42,774 INFO L226 Difference]: Without dead ends: 251 [2021-11-13 01:31:42,784 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-13 01:31:42,792 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 129 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 123.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.29ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 154.78ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:42,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 452 Invalid, 123 Unknown, 0 Unchecked, 7.29ms Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 154.78ms Time] [2021-11-13 01:31:42,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-11-13 01:31:42,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 248. [2021-11-13 01:31:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 180 states have (on average 1.4111111111111112) internal successors, (254), 191 states have internal predecessors, (254), 54 states have call successors, (54), 15 states have call predecessors, (54), 13 states have return successors, (50), 43 states have call predecessors, (50), 43 states have call successors, (50) [2021-11-13 01:31:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 358 transitions. [2021-11-13 01:31:42,897 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 358 transitions. Word has length 9 [2021-11-13 01:31:42,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:42,898 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 358 transitions. [2021-11-13 01:31:42,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-13 01:31:42,898 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 358 transitions. [2021-11-13 01:31:42,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-13 01:31:42,901 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:42,901 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 01:31:42,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-13 01:31:42,902 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:42,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:42,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2001954206, now seen corresponding path program 1 times [2021-11-13 01:31:42,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:42,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176943081] [2021-11-13 01:31:42,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:42,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:42,976 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-13 01:31:42,976 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:42,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176943081] [2021-11-13 01:31:42,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176943081] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:42,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:42,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-13 01:31:42,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200728444] [2021-11-13 01:31:42,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:42,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 01:31:42,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:42,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 01:31:42,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 01:31:42,986 INFO L87 Difference]: Start difference. First operand 248 states and 358 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-13 01:31:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:43,118 INFO L93 Difference]: Finished difference Result 268 states and 384 transitions. [2021-11-13 01:31:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 01:31:43,119 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-13 01:31:43,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:43,126 INFO L225 Difference]: With dead ends: 268 [2021-11-13 01:31:43,127 INFO L226 Difference]: Without dead ends: 248 [2021-11-13 01:31:43,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-13 01:31:43,134 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 4 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.58ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 85.51ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:43,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 423 Invalid, 95 Unknown, 0 Unchecked, 8.58ms Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 85.51ms Time] [2021-11-13 01:31:43,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-11-13 01:31:43,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2021-11-13 01:31:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 180 states have (on average 1.4055555555555554) internal successors, (253), 191 states have internal predecessors, (253), 54 states have call successors, (54), 15 states have call predecessors, (54), 13 states have return successors, (50), 43 states have call predecessors, (50), 43 states have call successors, (50) [2021-11-13 01:31:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 357 transitions. [2021-11-13 01:31:43,188 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 357 transitions. Word has length 11 [2021-11-13 01:31:43,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:43,189 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 357 transitions. [2021-11-13 01:31:43,189 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-13 01:31:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 357 transitions. [2021-11-13 01:31:43,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-13 01:31:43,190 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:43,190 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 01:31:43,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-13 01:31:43,191 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:43,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:43,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2009523838, now seen corresponding path program 1 times [2021-11-13 01:31:43,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:43,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205540454] [2021-11-13 01:31:43,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:43,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:43,256 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-13 01:31:43,256 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:43,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205540454] [2021-11-13 01:31:43,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205540454] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:43,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:43,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 01:31:43,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671466379] [2021-11-13 01:31:43,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:43,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 01:31:43,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:43,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 01:31:43,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 01:31:43,259 INFO L87 Difference]: Start difference. First operand 248 states and 357 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-13 01:31:43,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:43,383 INFO L93 Difference]: Finished difference Result 574 states and 843 transitions. [2021-11-13 01:31:43,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 01:31:43,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2021-11-13 01:31:43,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:43,392 INFO L225 Difference]: With dead ends: 574 [2021-11-13 01:31:43,392 INFO L226 Difference]: Without dead ends: 388 [2021-11-13 01:31:43,394 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-13 01:31:43,402 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 203 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.07ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 76.91ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:43,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 414 Invalid, 59 Unknown, 0 Unchecked, 5.07ms Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 76.91ms Time] [2021-11-13 01:31:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-11-13 01:31:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 360. [2021-11-13 01:31:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 263 states have (on average 1.391634980988593) internal successors, (366), 271 states have internal predecessors, (366), 75 states have call successors, (75), 22 states have call predecessors, (75), 21 states have return successors, (90), 67 states have call predecessors, (90), 65 states have call successors, (90) [2021-11-13 01:31:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 531 transitions. [2021-11-13 01:31:43,475 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 531 transitions. Word has length 13 [2021-11-13 01:31:43,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:43,475 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 531 transitions. [2021-11-13 01:31:43,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-13 01:31:43,476 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 531 transitions. [2021-11-13 01:31:43,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-13 01:31:43,482 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:43,482 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 01:31:43,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-13 01:31:43,483 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:43,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:43,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1641123002, now seen corresponding path program 1 times [2021-11-13 01:31:43,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:43,484 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388735235] [2021-11-13 01:31:43,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:43,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:43,576 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-13 01:31:43,576 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:43,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388735235] [2021-11-13 01:31:43,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388735235] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:43,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:43,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 01:31:43,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787604624] [2021-11-13 01:31:43,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:43,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 01:31:43,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:43,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 01:31:43,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 01:31:43,579 INFO L87 Difference]: Start difference. First operand 360 states and 531 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-13 01:31:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:43,701 INFO L93 Difference]: Finished difference Result 369 states and 542 transitions. [2021-11-13 01:31:43,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 01:31:43,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 16 [2021-11-13 01:31:43,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:43,707 INFO L225 Difference]: With dead ends: 369 [2021-11-13 01:31:43,707 INFO L226 Difference]: Without dead ends: 365 [2021-11-13 01:31:43,708 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-13 01:31:43,718 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 7 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.71ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 85.48ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:43,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 375 Invalid, 101 Unknown, 0 Unchecked, 2.71ms Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 85.48ms Time] [2021-11-13 01:31:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-11-13 01:31:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2021-11-13 01:31:43,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 269 states have (on average 1.3866171003717471) internal successors, (373), 275 states have internal predecessors, (373), 74 states have call successors, (74), 23 states have call predecessors, (74), 21 states have return successors, (90), 67 states have call predecessors, (90), 65 states have call successors, (90) [2021-11-13 01:31:43,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 537 transitions. [2021-11-13 01:31:43,764 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 537 transitions. Word has length 16 [2021-11-13 01:31:43,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:43,764 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 537 transitions. [2021-11-13 01:31:43,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-13 01:31:43,764 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 537 transitions. [2021-11-13 01:31:43,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-13 01:31:43,767 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:43,767 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-13 01:31:43,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-13 01:31:43,768 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:43,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:43,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1270154044, now seen corresponding path program 1 times [2021-11-13 01:31:43,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:43,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495105800] [2021-11-13 01:31:43,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:43,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:43,839 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-13 01:31:43,839 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:43,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495105800] [2021-11-13 01:31:43,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495105800] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:43,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:43,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 01:31:43,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041196982] [2021-11-13 01:31:43,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:43,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 01:31:43,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:43,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 01:31:43,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 01:31:43,842 INFO L87 Difference]: Start difference. First operand 365 states and 537 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 01:31:43,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:43,988 INFO L93 Difference]: Finished difference Result 664 states and 988 transitions. [2021-11-13 01:31:43,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 01:31:43,989 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-11-13 01:31:43,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:43,999 INFO L225 Difference]: With dead ends: 664 [2021-11-13 01:31:43,999 INFO L226 Difference]: Without dead ends: 645 [2021-11-13 01:31:44,000 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-13 01:31:44,001 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 224 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.96ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 99.94ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:44,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 423 Invalid, 63 Unknown, 0 Unchecked, 4.96ms Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 99.94ms Time] [2021-11-13 01:31:44,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2021-11-13 01:31:44,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 635. [2021-11-13 01:31:44,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 471 states have (on average 1.3927813163481952) internal successors, (656), 474 states have internal predecessors, (656), 123 states have call successors, (123), 43 states have call predecessors, (123), 40 states have return successors, (171), 119 states have call predecessors, (171), 114 states have call successors, (171) [2021-11-13 01:31:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 950 transitions. [2021-11-13 01:31:44,051 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 950 transitions. Word has length 20 [2021-11-13 01:31:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:44,052 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 950 transitions. [2021-11-13 01:31:44,052 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 01:31:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 950 transitions. [2021-11-13 01:31:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-13 01:31:44,053 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:44,053 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-13 01:31:44,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-13 01:31:44,054 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:44,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:44,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1284498953, now seen corresponding path program 1 times [2021-11-13 01:31:44,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:44,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040434098] [2021-11-13 01:31:44,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:44,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 01:31:44,110 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:44,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040434098] [2021-11-13 01:31:44,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040434098] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:44,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:44,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 01:31:44,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066711155] [2021-11-13 01:31:44,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:44,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 01:31:44,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:44,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 01:31:44,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 01:31:44,113 INFO L87 Difference]: Start difference. First operand 635 states and 950 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 01:31:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:44,230 INFO L93 Difference]: Finished difference Result 654 states and 971 transitions. [2021-11-13 01:31:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 01:31:44,231 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-11-13 01:31:44,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:44,237 INFO L225 Difference]: With dead ends: 654 [2021-11-13 01:31:44,237 INFO L226 Difference]: Without dead ends: 649 [2021-11-13 01:31:44,238 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-13 01:31:44,239 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 26 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.28ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 87.17ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:44,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 361 Invalid, 97 Unknown, 0 Unchecked, 2.28ms Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 87.17ms Time] [2021-11-13 01:31:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2021-11-13 01:31:44,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2021-11-13 01:31:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 483 states have (on average 1.3850931677018634) internal successors, (669), 486 states have internal predecessors, (669), 123 states have call successors, (123), 43 states have call predecessors, (123), 40 states have return successors, (171), 119 states have call predecessors, (171), 114 states have call successors, (171) [2021-11-13 01:31:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 963 transitions. [2021-11-13 01:31:44,287 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 963 transitions. Word has length 20 [2021-11-13 01:31:44,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:44,288 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 963 transitions. [2021-11-13 01:31:44,288 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 01:31:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 963 transitions. [2021-11-13 01:31:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-13 01:31:44,290 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:44,290 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-13 01:31:44,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-13 01:31:44,291 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:44,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:44,291 INFO L85 PathProgramCache]: Analyzing trace with hash -126895172, now seen corresponding path program 1 times [2021-11-13 01:31:44,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:44,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543503752] [2021-11-13 01:31:44,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:44,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:44,362 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-13 01:31:44,363 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:44,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543503752] [2021-11-13 01:31:44,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543503752] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:44,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:44,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 01:31:44,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464972633] [2021-11-13 01:31:44,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:44,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 01:31:44,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:44,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 01:31:44,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 01:31:44,365 INFO L87 Difference]: Start difference. First operand 647 states and 963 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 01:31:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:44,446 INFO L93 Difference]: Finished difference Result 910 states and 1369 transitions. [2021-11-13 01:31:44,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 01:31:44,447 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), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-13 01:31:44,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:44,452 INFO L225 Difference]: With dead ends: 910 [2021-11-13 01:31:44,452 INFO L226 Difference]: Without dead ends: 354 [2021-11-13 01:31:44,455 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-13 01:31:44,456 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 212 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.95ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.66ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:44,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 188 Invalid, 31 Unknown, 0 Unchecked, 1.95ms Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 40.66ms Time] [2021-11-13 01:31:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-11-13 01:31:44,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2021-11-13 01:31:44,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 264 states have (on average 1.3598484848484849) internal successors, (359), 268 states have internal predecessors, (359), 70 states have call successors, (70), 21 states have call predecessors, (70), 19 states have return successors, (88), 65 states have call predecessors, (88), 63 states have call successors, (88) [2021-11-13 01:31:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 517 transitions. [2021-11-13 01:31:44,530 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 517 transitions. Word has length 23 [2021-11-13 01:31:44,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:44,531 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 517 transitions. [2021-11-13 01:31:44,531 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), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 01:31:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 517 transitions. [2021-11-13 01:31:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-13 01:31:44,532 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:44,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-13 01:31:44,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-13 01:31:44,533 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:44,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:44,534 INFO L85 PathProgramCache]: Analyzing trace with hash -711681232, now seen corresponding path program 1 times [2021-11-13 01:31:44,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:44,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928799270] [2021-11-13 01:31:44,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:44,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:44,569 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-13 01:31:44,570 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:44,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928799270] [2021-11-13 01:31:44,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928799270] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:44,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:44,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 01:31:44,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971489109] [2021-11-13 01:31:44,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:44,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 01:31:44,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:44,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 01:31:44,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 01:31:44,573 INFO L87 Difference]: Start difference. First operand 354 states and 517 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-13 01:31:44,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:44,654 INFO L93 Difference]: Finished difference Result 368 states and 532 transitions. [2021-11-13 01:31:44,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 01:31:44,655 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-13 01:31:44,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:44,658 INFO L225 Difference]: With dead ends: 368 [2021-11-13 01:31:44,658 INFO L226 Difference]: Without dead ends: 352 [2021-11-13 01:31:44,659 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-13 01:31:44,660 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 4 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.22ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.49ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:44,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 371 Invalid, 64 Unknown, 0 Unchecked, 2.22ms Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 53.49ms Time] [2021-11-13 01:31:44,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-11-13 01:31:44,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2021-11-13 01:31:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 263 states have (on average 1.3574144486692015) internal successors, (357), 267 states have internal predecessors, (357), 69 states have call successors, (69), 21 states have call predecessors, (69), 19 states have return successors, (87), 64 states have call predecessors, (87), 62 states have call successors, (87) [2021-11-13 01:31:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 513 transitions. [2021-11-13 01:31:44,688 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 513 transitions. Word has length 21 [2021-11-13 01:31:44,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:44,688 INFO L470 AbstractCegarLoop]: Abstraction has 352 states and 513 transitions. [2021-11-13 01:31:44,688 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-13 01:31:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 513 transitions. [2021-11-13 01:31:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-13 01:31:44,690 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:44,690 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-13 01:31:44,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-13 01:31:44,690 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:44,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:44,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1306958918, now seen corresponding path program 1 times [2021-11-13 01:31:44,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:44,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937924641] [2021-11-13 01:31:44,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:44,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:44,751 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-13 01:31:44,751 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:44,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937924641] [2021-11-13 01:31:44,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937924641] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:44,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:44,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 01:31:44,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406037138] [2021-11-13 01:31:44,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:44,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 01:31:44,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:44,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 01:31:44,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 01:31:44,755 INFO L87 Difference]: Start difference. First operand 352 states and 513 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 01:31:44,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:44,929 INFO L93 Difference]: Finished difference Result 524 states and 800 transitions. [2021-11-13 01:31:44,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 01:31:44,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-13 01:31:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:44,937 INFO L225 Difference]: With dead ends: 524 [2021-11-13 01:31:44,938 INFO L226 Difference]: Without dead ends: 516 [2021-11-13 01:31:44,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-13 01:31:44,941 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 139 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 108.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.92ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 134.23ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:44,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 370 Invalid, 123 Unknown, 0 Unchecked, 4.92ms Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 134.23ms Time] [2021-11-13 01:31:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-11-13 01:31:44,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 397. [2021-11-13 01:31:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 298 states have (on average 1.3624161073825503) internal successors, (406), 302 states have internal predecessors, (406), 76 states have call successors, (76), 23 states have call predecessors, (76), 22 states have return successors, (107), 72 states have call predecessors, (107), 69 states have call successors, (107) [2021-11-13 01:31:44,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 589 transitions. [2021-11-13 01:31:44,981 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 589 transitions. Word has length 23 [2021-11-13 01:31:44,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:44,981 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 589 transitions. [2021-11-13 01:31:44,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-13 01:31:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 589 transitions. [2021-11-13 01:31:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-13 01:31:44,983 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:44,983 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-13 01:31:44,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-13 01:31:44,984 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:44,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1407663317, now seen corresponding path program 1 times [2021-11-13 01:31:44,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:44,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453507541] [2021-11-13 01:31:44,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:44,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:45,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-13 01:31:45,049 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:45,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453507541] [2021-11-13 01:31:45,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453507541] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:45,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:45,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 01:31:45,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765249595] [2021-11-13 01:31:45,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:45,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 01:31:45,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:45,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 01:31:45,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 01:31:45,051 INFO L87 Difference]: Start difference. First operand 397 states and 589 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-13 01:31:45,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:45,448 INFO L93 Difference]: Finished difference Result 524 states and 799 transitions. [2021-11-13 01:31:45,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 01:31:45,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 24 [2021-11-13 01:31:45,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:45,454 INFO L225 Difference]: With dead ends: 524 [2021-11-13 01:31:45,454 INFO L226 Difference]: Without dead ends: 516 [2021-11-13 01:31:45,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-13 01:31:45,457 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 379 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 261.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.60ms SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 327.66ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:45,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 303 Invalid, 267 Unknown, 0 Unchecked, 6.60ms Time], IncrementalHoareTripleChecker [78 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 327.66ms Time] [2021-11-13 01:31:45,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-11-13 01:31:45,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 397. [2021-11-13 01:31:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 298 states have (on average 1.3590604026845639) internal successors, (405), 302 states have internal predecessors, (405), 76 states have call successors, (76), 23 states have call predecessors, (76), 22 states have return successors, (107), 72 states have call predecessors, (107), 69 states have call successors, (107) [2021-11-13 01:31:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 588 transitions. [2021-11-13 01:31:45,508 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 588 transitions. Word has length 24 [2021-11-13 01:31:45,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:45,513 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 588 transitions. [2021-11-13 01:31:45,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-13 01:31:45,514 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 588 transitions. [2021-11-13 01:31:45,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-13 01:31:45,516 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:45,517 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-13 01:31:45,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-13 01:31:45,517 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:45,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:45,518 INFO L85 PathProgramCache]: Analyzing trace with hash -636636042, now seen corresponding path program 1 times [2021-11-13 01:31:45,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:45,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851057598] [2021-11-13 01:31:45,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:45,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:45,574 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-13 01:31:45,574 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:45,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851057598] [2021-11-13 01:31:45,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851057598] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:45,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:45,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 01:31:45,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753099920] [2021-11-13 01:31:45,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:45,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 01:31:45,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:45,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 01:31:45,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 01:31:45,576 INFO L87 Difference]: Start difference. First operand 397 states and 588 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-13 01:31:45,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:45,793 INFO L93 Difference]: Finished difference Result 421 states and 615 transitions. [2021-11-13 01:31:45,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 01:31:45,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 24 [2021-11-13 01:31:45,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:45,797 INFO L225 Difference]: With dead ends: 421 [2021-11-13 01:31:45,798 INFO L226 Difference]: Without dead ends: 397 [2021-11-13 01:31:45,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-13 01:31:45,799 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 212 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 141.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.97ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 169.65ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:45,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 273 Invalid, 156 Unknown, 0 Unchecked, 2.97ms Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 169.65ms Time] [2021-11-13 01:31:45,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-11-13 01:31:45,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2021-11-13 01:31:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 298 states have (on average 1.3523489932885906) internal successors, (403), 302 states have internal predecessors, (403), 76 states have call successors, (76), 23 states have call predecessors, (76), 22 states have return successors, (107), 72 states have call predecessors, (107), 69 states have call successors, (107) [2021-11-13 01:31:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 586 transitions. [2021-11-13 01:31:45,835 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 586 transitions. Word has length 24 [2021-11-13 01:31:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:45,835 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 586 transitions. [2021-11-13 01:31:45,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-13 01:31:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 586 transitions. [2021-11-13 01:31:45,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-13 01:31:45,837 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:45,837 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-13 01:31:45,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-13 01:31:45,837 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:45,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:45,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1801726269, now seen corresponding path program 1 times [2021-11-13 01:31:45,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:45,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082773954] [2021-11-13 01:31:45,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:45,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:45,883 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-13 01:31:45,883 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:45,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082773954] [2021-11-13 01:31:45,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082773954] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:45,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:45,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 01:31:45,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837503757] [2021-11-13 01:31:45,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:45,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 01:31:45,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:45,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 01:31:45,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 01:31:45,886 INFO L87 Difference]: Start difference. First operand 397 states and 586 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 01:31:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:46,054 INFO L93 Difference]: Finished difference Result 444 states and 632 transitions. [2021-11-13 01:31:46,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 01:31:46,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-11-13 01:31:46,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:46,057 INFO L225 Difference]: With dead ends: 444 [2021-11-13 01:31:46,057 INFO L226 Difference]: Without dead ends: 266 [2021-11-13 01:31:46,058 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-13 01:31:46,059 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 231 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 103.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.83ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 126.16ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:46,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 354 Invalid, 127 Unknown, 0 Unchecked, 2.83ms Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 126.16ms Time] [2021-11-13 01:31:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-11-13 01:31:46,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 252. [2021-11-13 01:31:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 193 states have (on average 1.2849740932642486) internal successors, (248), 198 states have internal predecessors, (248), 44 states have call successors, (44), 16 states have call predecessors, (44), 14 states have return successors, (45), 38 states have call predecessors, (45), 37 states have call successors, (45) [2021-11-13 01:31:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 337 transitions. [2021-11-13 01:31:46,088 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 337 transitions. Word has length 29 [2021-11-13 01:31:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:46,089 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 337 transitions. [2021-11-13 01:31:46,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 01:31:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 337 transitions. [2021-11-13 01:31:46,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-13 01:31:46,090 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:46,090 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] [2021-11-13 01:31:46,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-13 01:31:46,091 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:46,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:46,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1584967708, now seen corresponding path program 1 times [2021-11-13 01:31:46,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:46,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181925909] [2021-11-13 01:31:46,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:46,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:46,128 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-13 01:31:46,128 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:46,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181925909] [2021-11-13 01:31:46,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181925909] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:46,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:46,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 01:31:46,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738813127] [2021-11-13 01:31:46,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:46,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 01:31:46,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:46,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 01:31:46,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 01:31:46,130 INFO L87 Difference]: Start difference. First operand 252 states and 337 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-13 01:31:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:46,330 INFO L93 Difference]: Finished difference Result 269 states and 353 transitions. [2021-11-13 01:31:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 01:31:46,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 25 [2021-11-13 01:31:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:46,332 INFO L225 Difference]: With dead ends: 269 [2021-11-13 01:31:46,332 INFO L226 Difference]: Without dead ends: 249 [2021-11-13 01:31:46,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-13 01:31:46,333 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 213 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 130.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.75ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 161.88ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:46,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 266 Invalid, 158 Unknown, 0 Unchecked, 2.75ms Time], IncrementalHoareTripleChecker [6 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 161.88ms Time] [2021-11-13 01:31:46,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-11-13 01:31:46,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2021-11-13 01:31:46,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 190 states have (on average 1.2789473684210526) internal successors, (243), 196 states have internal predecessors, (243), 44 states have call successors, (44), 16 states have call predecessors, (44), 14 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2021-11-13 01:31:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 331 transitions. [2021-11-13 01:31:46,358 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 331 transitions. Word has length 25 [2021-11-13 01:31:46,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:46,358 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 331 transitions. [2021-11-13 01:31:46,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-13 01:31:46,358 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 331 transitions. [2021-11-13 01:31:46,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-13 01:31:46,359 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:46,359 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] [2021-11-13 01:31:46,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-13 01:31:46,359 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:46,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:46,360 INFO L85 PathProgramCache]: Analyzing trace with hash 781876277, now seen corresponding path program 1 times [2021-11-13 01:31:46,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:46,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206404489] [2021-11-13 01:31:46,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:46,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:46,388 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-13 01:31:46,388 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:46,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206404489] [2021-11-13 01:31:46,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206404489] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:46,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:46,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 01:31:46,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280908934] [2021-11-13 01:31:46,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:46,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 01:31:46,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:46,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 01:31:46,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 01:31:46,390 INFO L87 Difference]: Start difference. First operand 249 states and 331 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-13 01:31:46,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:46,530 INFO L93 Difference]: Finished difference Result 354 states and 494 transitions. [2021-11-13 01:31:46,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 01:31:46,530 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), 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 25 [2021-11-13 01:31:46,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:46,533 INFO L225 Difference]: With dead ends: 354 [2021-11-13 01:31:46,533 INFO L226 Difference]: Without dead ends: 341 [2021-11-13 01:31:46,534 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-13 01:31:46,534 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 132 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 82.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.84ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 101.72ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:46,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 449 Invalid, 123 Unknown, 0 Unchecked, 2.84ms Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 101.72ms Time] [2021-11-13 01:31:46,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-11-13 01:31:46,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 246. [2021-11-13 01:31:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 188 states have (on average 1.2659574468085106) internal successors, (238), 193 states have internal predecessors, (238), 43 states have call successors, (43), 16 states have call predecessors, (43), 14 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2021-11-13 01:31:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 325 transitions. [2021-11-13 01:31:46,561 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 325 transitions. Word has length 25 [2021-11-13 01:31:46,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:46,561 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 325 transitions. [2021-11-13 01:31:46,561 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), 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-13 01:31:46,561 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 325 transitions. [2021-11-13 01:31:46,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-13 01:31:46,562 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:46,562 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-13 01:31:46,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-13 01:31:46,563 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:46,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:46,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1689384478, now seen corresponding path program 1 times [2021-11-13 01:31:46,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:46,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401524856] [2021-11-13 01:31:46,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:46,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:46,607 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-13 01:31:46,608 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:46,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401524856] [2021-11-13 01:31:46,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401524856] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:46,608 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:46,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 01:31:46,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958472014] [2021-11-13 01:31:46,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:46,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 01:31:46,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:46,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 01:31:46,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 01:31:46,609 INFO L87 Difference]: Start difference. First operand 246 states and 325 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-13 01:31:46,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:46,850 INFO L93 Difference]: Finished difference Result 254 states and 331 transitions. [2021-11-13 01:31:46,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 01:31:46,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 26 [2021-11-13 01:31:46,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:46,853 INFO L225 Difference]: With dead ends: 254 [2021-11-13 01:31:46,853 INFO L226 Difference]: Without dead ends: 248 [2021-11-13 01:31:46,853 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-13 01:31:46,854 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 232 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 160.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.24ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 193.43ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:46,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 368 Invalid, 252 Unknown, 0 Unchecked, 3.24ms Time], IncrementalHoareTripleChecker [15 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 193.43ms Time] [2021-11-13 01:31:46,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-11-13 01:31:46,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2021-11-13 01:31:46,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 188 states have (on average 1.2606382978723405) internal successors, (237), 193 states have internal predecessors, (237), 43 states have call successors, (43), 16 states have call predecessors, (43), 14 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2021-11-13 01:31:46,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 324 transitions. [2021-11-13 01:31:46,882 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 324 transitions. Word has length 26 [2021-11-13 01:31:46,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:46,883 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 324 transitions. [2021-11-13 01:31:46,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-13 01:31:46,883 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 324 transitions. [2021-11-13 01:31:46,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-13 01:31:46,884 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:46,884 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-13 01:31:46,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-13 01:31:46,884 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:46,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:46,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1078281712, now seen corresponding path program 1 times [2021-11-13 01:31:46,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:46,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885956011] [2021-11-13 01:31:46,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:46,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:46,953 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-13 01:31:46,953 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:46,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885956011] [2021-11-13 01:31:46,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885956011] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:46,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:46,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 01:31:46,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009813948] [2021-11-13 01:31:46,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:46,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 01:31:46,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:46,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 01:31:46,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 01:31:46,955 INFO L87 Difference]: Start difference. First operand 246 states and 324 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-13 01:31:47,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:47,074 INFO L93 Difference]: Finished difference Result 260 states and 338 transitions. [2021-11-13 01:31:47,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 01:31:47,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 26 [2021-11-13 01:31:47,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:47,077 INFO L225 Difference]: With dead ends: 260 [2021-11-13 01:31:47,077 INFO L226 Difference]: Without dead ends: 256 [2021-11-13 01:31:47,077 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-13 01:31:47,078 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 13 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.63ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77.92ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:47,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 534 Invalid, 93 Unknown, 0 Unchecked, 2.63ms Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 77.92ms Time] [2021-11-13 01:31:47,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-13 01:31:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2021-11-13 01:31:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 194 states have (on average 1.2525773195876289) internal successors, (243), 199 states have internal predecessors, (243), 43 states have call successors, (43), 16 states have call predecessors, (43), 14 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2021-11-13 01:31:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 330 transitions. [2021-11-13 01:31:47,107 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 330 transitions. Word has length 26 [2021-11-13 01:31:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:47,107 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 330 transitions. [2021-11-13 01:31:47,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-13 01:31:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 330 transitions. [2021-11-13 01:31:47,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-13 01:31:47,109 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:47,109 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-13 01:31:47,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-13 01:31:47,109 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:47,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:47,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1078558542, now seen corresponding path program 1 times [2021-11-13 01:31:47,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:47,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362003752] [2021-11-13 01:31:47,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:47,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:47,146 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-13 01:31:47,146 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:47,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362003752] [2021-11-13 01:31:47,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362003752] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:47,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:47,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 01:31:47,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853519993] [2021-11-13 01:31:47,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:47,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 01:31:47,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:47,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 01:31:47,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 01:31:47,148 INFO L87 Difference]: Start difference. First operand 252 states and 330 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-13 01:31:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:47,481 INFO L93 Difference]: Finished difference Result 349 states and 484 transitions. [2021-11-13 01:31:47,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 01:31:47,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 26 [2021-11-13 01:31:47,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:47,484 INFO L225 Difference]: With dead ends: 349 [2021-11-13 01:31:47,485 INFO L226 Difference]: Without dead ends: 329 [2021-11-13 01:31:47,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-13 01:31:47,486 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 298 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 230.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.99ms SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 274.60ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:47,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 381 Invalid, 244 Unknown, 0 Unchecked, 3.99ms Time], IncrementalHoareTripleChecker [51 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 274.60ms Time] [2021-11-13 01:31:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-11-13 01:31:47,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 240. [2021-11-13 01:31:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 182 states have (on average 1.2637362637362637) internal successors, (230), 187 states have internal predecessors, (230), 43 states have call successors, (43), 16 states have call predecessors, (43), 14 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2021-11-13 01:31:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 317 transitions. [2021-11-13 01:31:47,515 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 317 transitions. Word has length 26 [2021-11-13 01:31:47,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:47,515 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 317 transitions. [2021-11-13 01:31:47,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-13 01:31:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 317 transitions. [2021-11-13 01:31:47,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-13 01:31:47,516 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:47,516 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-13 01:31:47,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-13 01:31:47,516 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:47,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:47,517 INFO L85 PathProgramCache]: Analyzing trace with hash -57461675, now seen corresponding path program 1 times [2021-11-13 01:31:47,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:47,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144756071] [2021-11-13 01:31:47,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:47,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:47,556 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-13 01:31:47,557 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:47,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144756071] [2021-11-13 01:31:47,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144756071] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:47,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:47,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 01:31:47,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604234692] [2021-11-13 01:31:47,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:47,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 01:31:47,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:47,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 01:31:47,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 01:31:47,559 INFO L87 Difference]: Start difference. First operand 240 states and 317 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 01:31:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:47,785 INFO L93 Difference]: Finished difference Result 248 states and 323 transitions. [2021-11-13 01:31:47,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 01:31:47,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-11-13 01:31:47,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:47,787 INFO L225 Difference]: With dead ends: 248 [2021-11-13 01:31:47,788 INFO L226 Difference]: Without dead ends: 242 [2021-11-13 01:31:47,788 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-13 01:31:47,789 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 224 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 145.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.24ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 179.35ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:47,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 356 Invalid, 232 Unknown, 0 Unchecked, 3.24ms Time], IncrementalHoareTripleChecker [15 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 179.35ms Time] [2021-11-13 01:31:47,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-11-13 01:31:47,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2021-11-13 01:31:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 182 states have (on average 1.2582417582417582) internal successors, (229), 187 states have internal predecessors, (229), 43 states have call successors, (43), 16 states have call predecessors, (43), 14 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2021-11-13 01:31:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 316 transitions. [2021-11-13 01:31:47,816 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 316 transitions. Word has length 27 [2021-11-13 01:31:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:47,816 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 316 transitions. [2021-11-13 01:31:47,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-13 01:31:47,817 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 316 transitions. [2021-11-13 01:31:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-13 01:31:47,817 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:47,817 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-13 01:31:47,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-13 01:31:47,818 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:47,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:47,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1736831101, now seen corresponding path program 1 times [2021-11-13 01:31:47,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:47,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610113060] [2021-11-13 01:31:47,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:47,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:47,894 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-13 01:31:47,894 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:47,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610113060] [2021-11-13 01:31:47,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610113060] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:47,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:47,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 01:31:47,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607296341] [2021-11-13 01:31:47,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:47,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 01:31:47,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:47,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 01:31:47,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 01:31:47,898 INFO L87 Difference]: Start difference. First operand 240 states and 316 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 01:31:48,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:48,082 INFO L93 Difference]: Finished difference Result 255 states and 331 transitions. [2021-11-13 01:31:48,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 01:31:48,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-11-13 01:31:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:48,084 INFO L225 Difference]: With dead ends: 255 [2021-11-13 01:31:48,084 INFO L226 Difference]: Without dead ends: 251 [2021-11-13 01:31:48,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-13 01:31:48,085 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 15 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 108.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.10ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 129.66ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:48,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 1005 Invalid, 224 Unknown, 0 Unchecked, 6.10ms Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 129.66ms Time] [2021-11-13 01:31:48,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-11-13 01:31:48,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2021-11-13 01:31:48,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 189 states have (on average 1.2486772486772486) internal successors, (236), 194 states have internal predecessors, (236), 43 states have call successors, (43), 16 states have call predecessors, (43), 14 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2021-11-13 01:31:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 323 transitions. [2021-11-13 01:31:48,111 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 323 transitions. Word has length 27 [2021-11-13 01:31:48,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:48,112 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 323 transitions. [2021-11-13 01:31:48,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 01:31:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 323 transitions. [2021-11-13 01:31:48,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-13 01:31:48,114 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:48,114 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-13 01:31:48,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-13 01:31:48,115 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:48,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:48,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1737107931, now seen corresponding path program 1 times [2021-11-13 01:31:48,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:48,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892031918] [2021-11-13 01:31:48,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:48,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:48,168 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-13 01:31:48,169 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:48,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892031918] [2021-11-13 01:31:48,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892031918] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:48,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:48,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 01:31:48,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391522016] [2021-11-13 01:31:48,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:48,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 01:31:48,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:48,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 01:31:48,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 01:31:48,170 INFO L87 Difference]: Start difference. First operand 247 states and 323 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 01:31:48,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:48,537 INFO L93 Difference]: Finished difference Result 342 states and 474 transitions. [2021-11-13 01:31:48,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 01:31:48,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-11-13 01:31:48,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:48,541 INFO L225 Difference]: With dead ends: 342 [2021-11-13 01:31:48,541 INFO L226 Difference]: Without dead ends: 326 [2021-11-13 01:31:48,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-13 01:31:48,543 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 440 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 252.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.14ms SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 301.16ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:48,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 394 Invalid, 406 Unknown, 0 Unchecked, 4.14ms Time], IncrementalHoareTripleChecker [117 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 301.16ms Time] [2021-11-13 01:31:48,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-11-13 01:31:48,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 235. [2021-11-13 01:31:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 178 states have (on average 1.252808988764045) internal successors, (223), 183 states have internal predecessors, (223), 42 states have call successors, (42), 16 states have call predecessors, (42), 14 states have return successors, (43), 36 states have call predecessors, (43), 36 states have call successors, (43) [2021-11-13 01:31:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 308 transitions. [2021-11-13 01:31:48,572 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 308 transitions. Word has length 27 [2021-11-13 01:31:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:48,572 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 308 transitions. [2021-11-13 01:31:48,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-13 01:31:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 308 transitions. [2021-11-13 01:31:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-13 01:31:48,573 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:48,574 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] [2021-11-13 01:31:48,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-13 01:31:48,574 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:48,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:48,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1728736953, now seen corresponding path program 1 times [2021-11-13 01:31:48,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:48,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420627059] [2021-11-13 01:31:48,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:48,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:48,656 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-13 01:31:48,656 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:48,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420627059] [2021-11-13 01:31:48,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420627059] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:48,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:48,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 01:31:48,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698638880] [2021-11-13 01:31:48,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:48,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 01:31:48,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:48,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 01:31:48,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-13 01:31:48,659 INFO L87 Difference]: Start difference. First operand 235 states and 308 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 01:31:48,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:48,804 INFO L93 Difference]: Finished difference Result 241 states and 313 transitions. [2021-11-13 01:31:48,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 01:31:48,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-11-13 01:31:48,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:48,806 INFO L225 Difference]: With dead ends: 241 [2021-11-13 01:31:48,806 INFO L226 Difference]: Without dead ends: 218 [2021-11-13 01:31:48,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-13 01:31:48,807 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 1 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 86.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.23ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 103.73ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:48,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 839 Invalid, 164 Unknown, 0 Unchecked, 3.23ms Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 103.73ms Time] [2021-11-13 01:31:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-11-13 01:31:48,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2021-11-13 01:31:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 163 states have (on average 1.2699386503067485) internal successors, (207), 168 states have internal predecessors, (207), 41 states have call successors, (41), 15 states have call predecessors, (41), 13 states have return successors, (42), 35 states have call predecessors, (42), 35 states have call successors, (42) [2021-11-13 01:31:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 290 transitions. [2021-11-13 01:31:48,830 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 290 transitions. Word has length 28 [2021-11-13 01:31:48,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:48,830 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 290 transitions. [2021-11-13 01:31:48,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 01:31:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 290 transitions. [2021-11-13 01:31:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-13 01:31:48,831 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:48,831 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] [2021-11-13 01:31:48,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-13 01:31:48,831 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:48,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:48,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1725917529, now seen corresponding path program 1 times [2021-11-13 01:31:48,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:48,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228375195] [2021-11-13 01:31:48,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:48,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:48,874 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-13 01:31:48,874 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:48,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228375195] [2021-11-13 01:31:48,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228375195] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:48,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:48,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 01:31:48,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571879168] [2021-11-13 01:31:48,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:48,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 01:31:48,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:48,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 01:31:48,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 01:31:48,876 INFO L87 Difference]: Start difference. First operand 218 states and 290 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 01:31:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:48,990 INFO L93 Difference]: Finished difference Result 248 states and 320 transitions. [2021-11-13 01:31:48,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 01:31:48,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-11-13 01:31:48,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:48,992 INFO L225 Difference]: With dead ends: 248 [2021-11-13 01:31:48,992 INFO L226 Difference]: Without dead ends: 216 [2021-11-13 01:31:48,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-13 01:31:48,993 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 23 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.25ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.66ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:48,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 665 Invalid, 108 Unknown, 0 Unchecked, 2.25ms Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 70.66ms Time] [2021-11-13 01:31:48,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-11-13 01:31:49,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2021-11-13 01:31:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 162 states have (on average 1.2592592592592593) internal successors, (204), 167 states have internal predecessors, (204), 40 states have call successors, (40), 15 states have call predecessors, (40), 13 states have return successors, (41), 34 states have call predecessors, (41), 34 states have call successors, (41) [2021-11-13 01:31:49,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 285 transitions. [2021-11-13 01:31:49,022 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 285 transitions. Word has length 28 [2021-11-13 01:31:49,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:49,022 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 285 transitions. [2021-11-13 01:31:49,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-13 01:31:49,023 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 285 transitions. [2021-11-13 01:31:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-13 01:31:49,023 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:49,023 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-13 01:31:49,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-13 01:31:49,024 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:49,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:49,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1931034124, now seen corresponding path program 1 times [2021-11-13 01:31:49,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:49,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092071421] [2021-11-13 01:31:49,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:49,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:49,059 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-13 01:31:49,059 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:49,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092071421] [2021-11-13 01:31:49,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092071421] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:49,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:49,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 01:31:49,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213370124] [2021-11-13 01:31:49,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:49,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 01:31:49,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:49,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 01:31:49,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 01:31:49,061 INFO L87 Difference]: Start difference. First operand 216 states and 285 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-13 01:31:49,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:49,139 INFO L93 Difference]: Finished difference Result 383 states and 527 transitions. [2021-11-13 01:31:49,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 01:31:49,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-11-13 01:31:49,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:49,142 INFO L225 Difference]: With dead ends: 383 [2021-11-13 01:31:49,142 INFO L226 Difference]: Without dead ends: 219 [2021-11-13 01:31:49,143 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-13 01:31:49,144 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.24ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.66ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:49,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 69 Unknown, 0 Unchecked, 1.24ms Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 53.66ms Time] [2021-11-13 01:31:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-11-13 01:31:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2021-11-13 01:31:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 165 states have (on average 1.2606060606060605) internal successors, (208), 169 states have internal predecessors, (208), 40 states have call successors, (40), 15 states have call predecessors, (40), 13 states have return successors, (41), 34 states have call predecessors, (41), 34 states have call successors, (41) [2021-11-13 01:31:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 289 transitions. [2021-11-13 01:31:49,164 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 289 transitions. Word has length 32 [2021-11-13 01:31:49,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:49,165 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 289 transitions. [2021-11-13 01:31:49,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-13 01:31:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 289 transitions. [2021-11-13 01:31:49,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-13 01:31:49,166 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:49,166 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-13 01:31:49,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-13 01:31:49,166 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:49,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:49,167 INFO L85 PathProgramCache]: Analyzing trace with hash 185455332, now seen corresponding path program 1 times [2021-11-13 01:31:49,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:49,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708687876] [2021-11-13 01:31:49,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:49,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:49,247 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-13 01:31:49,248 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:49,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708687876] [2021-11-13 01:31:49,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708687876] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:49,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:49,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 01:31:49,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603320855] [2021-11-13 01:31:49,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:49,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 01:31:49,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:49,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 01:31:49,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 01:31:49,249 INFO L87 Difference]: Start difference. First operand 219 states and 289 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-13 01:31:49,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:49,417 INFO L93 Difference]: Finished difference Result 221 states and 290 transitions. [2021-11-13 01:31:49,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 01:31:49,418 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-13 01:31:49,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:49,420 INFO L225 Difference]: With dead ends: 221 [2021-11-13 01:31:49,420 INFO L226 Difference]: Without dead ends: 196 [2021-11-13 01:31:49,420 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-13 01:31:49,421 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 10 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.62ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 117.49ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:49,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 928 Invalid, 181 Unknown, 0 Unchecked, 3.62ms Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 117.49ms Time] [2021-11-13 01:31:49,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-11-13 01:31:49,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-11-13 01:31:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 145 states have (on average 1.289655172413793) internal successors, (187), 148 states have internal predecessors, (187), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (40), 33 states have call predecessors, (40), 33 states have call successors, (40) [2021-11-13 01:31:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 265 transitions. [2021-11-13 01:31:49,441 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 265 transitions. Word has length 32 [2021-11-13 01:31:49,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:49,441 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 265 transitions. [2021-11-13 01:31:49,441 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-13 01:31:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 265 transitions. [2021-11-13 01:31:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-13 01:31:49,442 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:49,442 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-13 01:31:49,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-13 01:31:49,442 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:49,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:49,443 INFO L85 PathProgramCache]: Analyzing trace with hash 438808505, now seen corresponding path program 1 times [2021-11-13 01:31:49,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:49,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035967716] [2021-11-13 01:31:49,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:49,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:49,472 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-13 01:31:49,473 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:49,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035967716] [2021-11-13 01:31:49,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035967716] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:49,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:49,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 01:31:49,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628760539] [2021-11-13 01:31:49,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:49,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 01:31:49,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:49,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 01:31:49,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 01:31:49,474 INFO L87 Difference]: Start difference. First operand 196 states and 265 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-13 01:31:49,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:49,578 INFO L93 Difference]: Finished difference Result 258 states and 355 transitions. [2021-11-13 01:31:49,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 01:31:49,578 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2021-11-13 01:31:49,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:49,581 INFO L225 Difference]: With dead ends: 258 [2021-11-13 01:31:49,581 INFO L226 Difference]: Without dead ends: 255 [2021-11-13 01:31:49,581 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-13 01:31:49,582 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 84 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.85ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 74.90ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:49,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 365 Invalid, 89 Unknown, 0 Unchecked, 1.85ms Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 74.90ms Time] [2021-11-13 01:31:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-11-13 01:31:49,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 198. [2021-11-13 01:31:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 147 states have (on average 1.2925170068027212) internal successors, (190), 150 states have internal predecessors, (190), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (40), 33 states have call predecessors, (40), 33 states have call successors, (40) [2021-11-13 01:31:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 268 transitions. [2021-11-13 01:31:49,609 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 268 transitions. Word has length 35 [2021-11-13 01:31:49,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:49,609 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 268 transitions. [2021-11-13 01:31:49,609 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-13 01:31:49,610 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 268 transitions. [2021-11-13 01:31:49,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-13 01:31:49,610 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:49,610 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-13 01:31:49,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-13 01:31:49,611 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:49,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:49,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1783499734, now seen corresponding path program 1 times [2021-11-13 01:31:49,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:49,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42734725] [2021-11-13 01:31:49,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:49,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:49,649 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-13 01:31:49,649 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:49,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42734725] [2021-11-13 01:31:49,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42734725] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:49,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:49,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 01:31:49,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596676765] [2021-11-13 01:31:49,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:49,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 01:31:49,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:49,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 01:31:49,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 01:31:49,651 INFO L87 Difference]: Start difference. First operand 198 states and 268 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-13 01:31:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:49,739 INFO L93 Difference]: Finished difference Result 212 states and 281 transitions. [2021-11-13 01:31:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 01:31:49,740 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-13 01:31:49,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:49,741 INFO L225 Difference]: With dead ends: 212 [2021-11-13 01:31:49,742 INFO L226 Difference]: Without dead ends: 184 [2021-11-13 01:31:49,742 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-13 01:31:49,743 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 23 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.71ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.39ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:49,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 601 Invalid, 87 Unknown, 0 Unchecked, 1.71ms Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 55.39ms Time] [2021-11-13 01:31:49,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-11-13 01:31:49,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2021-11-13 01:31:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 135 states have (on average 1.3037037037037038) internal successors, (176), 138 states have internal predecessors, (176), 37 states have call successors, (37), 13 states have call predecessors, (37), 11 states have return successors, (39), 32 states have call predecessors, (39), 32 states have call successors, (39) [2021-11-13 01:31:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 252 transitions. [2021-11-13 01:31:49,761 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 252 transitions. Word has length 32 [2021-11-13 01:31:49,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:49,761 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 252 transitions. [2021-11-13 01:31:49,762 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-13 01:31:49,762 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 252 transitions. [2021-11-13 01:31:49,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-13 01:31:49,762 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:49,762 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-13 01:31:49,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-13 01:31:49,763 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:49,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:49,763 INFO L85 PathProgramCache]: Analyzing trace with hash 480114929, now seen corresponding path program 1 times [2021-11-13 01:31:49,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:49,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071775676] [2021-11-13 01:31:49,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:49,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 01:31:49,795 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:49,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071775676] [2021-11-13 01:31:49,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071775676] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:49,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:49,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 01:31:49,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296332533] [2021-11-13 01:31:49,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:49,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 01:31:49,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:49,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 01:31:49,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 01:31:49,797 INFO L87 Difference]: Start difference. First operand 184 states and 252 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-13 01:31:49,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:49,870 INFO L93 Difference]: Finished difference Result 416 states and 579 transitions. [2021-11-13 01:31:49,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 01:31:49,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2021-11-13 01:31:49,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:49,873 INFO L225 Difference]: With dead ends: 416 [2021-11-13 01:31:49,873 INFO L226 Difference]: Without dead ends: 250 [2021-11-13 01:31:49,874 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-13 01:31:49,875 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 131 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.61ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.56ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:49,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 243 Invalid, 35 Unknown, 0 Unchecked, 2.61ms Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 41.56ms Time] [2021-11-13 01:31:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-11-13 01:31:49,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 223. [2021-11-13 01:31:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 165 states have (on average 1.2969696969696969) internal successors, (214), 164 states have internal predecessors, (214), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (52), 43 states have call predecessors, (52), 38 states have call successors, (52) [2021-11-13 01:31:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 308 transitions. [2021-11-13 01:31:49,898 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 308 transitions. Word has length 36 [2021-11-13 01:31:49,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:49,898 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 308 transitions. [2021-11-13 01:31:49,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-13 01:31:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 308 transitions. [2021-11-13 01:31:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-13 01:31:49,899 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:49,899 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] [2021-11-13 01:31:49,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-13 01:31:49,900 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:49,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:49,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1078882105, now seen corresponding path program 1 times [2021-11-13 01:31:49,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:49,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554498691] [2021-11-13 01:31:49,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:49,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:50,003 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-13 01:31:50,004 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:50,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554498691] [2021-11-13 01:31:50,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554498691] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:50,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:50,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 01:31:50,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691956248] [2021-11-13 01:31:50,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:50,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 01:31:50,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:50,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 01:31:50,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-13 01:31:50,006 INFO L87 Difference]: Start difference. First operand 223 states and 308 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-13 01:31:50,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:50,113 INFO L93 Difference]: Finished difference Result 424 states and 598 transitions. [2021-11-13 01:31:50,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 01:31:50,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2021-11-13 01:31:50,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:50,115 INFO L225 Difference]: With dead ends: 424 [2021-11-13 01:31:50,115 INFO L226 Difference]: Without dead ends: 216 [2021-11-13 01:31:50,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-13 01:31:50,117 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 13 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.08ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.34ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:50,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 651 Invalid, 97 Unknown, 0 Unchecked, 2.08ms Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 68.34ms Time] [2021-11-13 01:31:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-11-13 01:31:50,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2021-11-13 01:31:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 159 states have (on average 1.2767295597484276) internal successors, (203), 157 states have internal predecessors, (203), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (52), 43 states have call predecessors, (52), 38 states have call successors, (52) [2021-11-13 01:31:50,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 296 transitions. [2021-11-13 01:31:50,160 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 296 transitions. Word has length 37 [2021-11-13 01:31:50,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:50,160 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 296 transitions. [2021-11-13 01:31:50,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-13 01:31:50,161 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 296 transitions. [2021-11-13 01:31:50,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-13 01:31:50,161 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:50,162 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] [2021-11-13 01:31:50,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-13 01:31:50,162 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:50,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:50,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1864106336, now seen corresponding path program 1 times [2021-11-13 01:31:50,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:50,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940464043] [2021-11-13 01:31:50,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:50,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:50,203 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-13 01:31:50,204 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:50,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940464043] [2021-11-13 01:31:50,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940464043] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:50,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:50,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 01:31:50,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504147850] [2021-11-13 01:31:50,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:50,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 01:31:50,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:50,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 01:31:50,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 01:31:50,206 INFO L87 Difference]: Start difference. First operand 216 states and 296 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-13 01:31:50,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:50,393 INFO L93 Difference]: Finished difference Result 417 states and 584 transitions. [2021-11-13 01:31:50,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 01:31:50,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-11-13 01:31:50,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:50,396 INFO L225 Difference]: With dead ends: 417 [2021-11-13 01:31:50,396 INFO L226 Difference]: Without dead ends: 216 [2021-11-13 01:31:50,397 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-13 01:31:50,397 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 143 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 122.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.22ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 147.91ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:50,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 283 Invalid, 170 Unknown, 0 Unchecked, 2.22ms Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 147.91ms Time] [2021-11-13 01:31:50,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-11-13 01:31:50,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2021-11-13 01:31:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 159 states have (on average 1.270440251572327) internal successors, (202), 157 states have internal predecessors, (202), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (52), 43 states have call predecessors, (52), 38 states have call successors, (52) [2021-11-13 01:31:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 295 transitions. [2021-11-13 01:31:50,421 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 295 transitions. Word has length 41 [2021-11-13 01:31:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:50,421 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 295 transitions. [2021-11-13 01:31:50,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-13 01:31:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 295 transitions. [2021-11-13 01:31:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-13 01:31:50,422 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:50,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, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 01:31:50,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-13 01:31:50,423 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:50,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:50,424 INFO L85 PathProgramCache]: Analyzing trace with hash 198602331, now seen corresponding path program 1 times [2021-11-13 01:31:50,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:50,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513762438] [2021-11-13 01:31:50,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:50,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:50,574 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-13 01:31:50,575 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:50,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513762438] [2021-11-13 01:31:50,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513762438] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:50,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:50,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 01:31:50,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400361783] [2021-11-13 01:31:50,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:50,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 01:31:50,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:50,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 01:31:50,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-13 01:31:50,576 INFO L87 Difference]: Start difference. First operand 216 states and 295 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-13 01:31:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:50,873 INFO L93 Difference]: Finished difference Result 246 states and 332 transitions. [2021-11-13 01:31:50,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 01:31:50,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2021-11-13 01:31:50,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:50,876 INFO L225 Difference]: With dead ends: 246 [2021-11-13 01:31:50,876 INFO L226 Difference]: Without dead ends: 242 [2021-11-13 01:31:50,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-13 01:31:50,877 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 264 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 195.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.22ms SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 231.85ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:50,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 548 Invalid, 305 Unknown, 0 Unchecked, 4.22ms Time], IncrementalHoareTripleChecker [99 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 231.85ms Time] [2021-11-13 01:31:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-11-13 01:31:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2021-11-13 01:31:50,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 162 states have (on average 1.2654320987654322) internal successors, (205), 161 states have internal predecessors, (205), 42 states have call successors, (42), 16 states have call predecessors, (42), 17 states have return successors, (55), 44 states have call predecessors, (55), 39 states have call successors, (55) [2021-11-13 01:31:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 302 transitions. [2021-11-13 01:31:50,926 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 302 transitions. Word has length 42 [2021-11-13 01:31:50,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:50,926 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 302 transitions. [2021-11-13 01:31:50,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-13 01:31:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 302 transitions. [2021-11-13 01:31:50,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-13 01:31:50,928 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:50,928 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] [2021-11-13 01:31:50,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-13 01:31:50,928 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:50,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:50,929 INFO L85 PathProgramCache]: Analyzing trace with hash 959621875, now seen corresponding path program 1 times [2021-11-13 01:31:50,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:50,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655072082] [2021-11-13 01:31:50,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:50,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:51,040 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-13 01:31:51,041 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:51,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655072082] [2021-11-13 01:31:51,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655072082] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:51,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:51,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-13 01:31:51,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199981067] [2021-11-13 01:31:51,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:51,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 01:31:51,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:51,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 01:31:51,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-13 01:31:51,043 INFO L87 Difference]: Start difference. First operand 222 states and 302 transitions. Second operand has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-13 01:31:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:51,383 INFO L93 Difference]: Finished difference Result 398 states and 541 transitions. [2021-11-13 01:31:51,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-13 01:31:51,384 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2021-11-13 01:31:51,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:51,386 INFO L225 Difference]: With dead ends: 398 [2021-11-13 01:31:51,386 INFO L226 Difference]: Without dead ends: 209 [2021-11-13 01:31:51,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-11-13 01:31:51,388 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 36 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 224.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.56ms SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 271.92ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:51,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 637 Invalid, 432 Unknown, 0 Unchecked, 5.56ms Time], IncrementalHoareTripleChecker [33 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 271.92ms Time] [2021-11-13 01:31:51,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-11-13 01:31:51,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2021-11-13 01:31:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 155 states have (on average 1.270967741935484) internal successors, (197), 153 states have internal predecessors, (197), 38 states have call successors, (38), 17 states have call predecessors, (38), 15 states have return successors, (45), 38 states have call predecessors, (45), 35 states have call successors, (45) [2021-11-13 01:31:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 280 transitions. [2021-11-13 01:31:51,413 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 280 transitions. Word has length 50 [2021-11-13 01:31:51,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:51,413 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 280 transitions. [2021-11-13 01:31:51,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-13 01:31:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 280 transitions. [2021-11-13 01:31:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-13 01:31:51,415 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:51,415 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, 1, 1, 1, 1] [2021-11-13 01:31:51,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-13 01:31:51,415 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:51,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:51,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1556211664, now seen corresponding path program 1 times [2021-11-13 01:31:51,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:51,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568985867] [2021-11-13 01:31:51,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:51,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:51,503 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-13 01:31:51,503 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:51,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568985867] [2021-11-13 01:31:51,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568985867] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:51,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:51,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-13 01:31:51,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343463699] [2021-11-13 01:31:51,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:51,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-13 01:31:51,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:51,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-13 01:31:51,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-13 01:31:51,506 INFO L87 Difference]: Start difference. First operand 209 states and 280 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-13 01:31:51,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:51,693 INFO L93 Difference]: Finished difference Result 226 states and 296 transitions. [2021-11-13 01:31:51,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 01:31:51,693 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-11-13 01:31:51,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:51,695 INFO L225 Difference]: With dead ends: 226 [2021-11-13 01:31:51,696 INFO L226 Difference]: Without dead ends: 207 [2021-11-13 01:31:51,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-11-13 01:31:51,697 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 40 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 92.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.05ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 112.06ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:51,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 1156 Invalid, 215 Unknown, 0 Unchecked, 4.05ms Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 112.06ms Time] [2021-11-13 01:31:51,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-11-13 01:31:51,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-11-13 01:31:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 154 states have (on average 1.2727272727272727) internal successors, (196), 152 states have internal predecessors, (196), 37 states have call successors, (37), 17 states have call predecessors, (37), 15 states have return successors, (43), 37 states have call predecessors, (43), 34 states have call successors, (43) [2021-11-13 01:31:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 276 transitions. [2021-11-13 01:31:51,720 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 276 transitions. Word has length 58 [2021-11-13 01:31:51,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:51,721 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 276 transitions. [2021-11-13 01:31:51,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-13 01:31:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 276 transitions. [2021-11-13 01:31:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-13 01:31:51,722 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:51,722 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 01:31:51,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-13 01:31:51,723 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:51,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:51,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1240794923, now seen corresponding path program 1 times [2021-11-13 01:31:51,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:51,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667356289] [2021-11-13 01:31:51,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:51,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 01:31:51,829 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:51,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667356289] [2021-11-13 01:31:51,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667356289] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:51,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:51,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-13 01:31:51,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317185500] [2021-11-13 01:31:51,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:51,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-13 01:31:51,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:51,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-13 01:31:51,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-13 01:31:51,831 INFO L87 Difference]: Start difference. First operand 207 states and 276 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-13 01:31:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:52,034 INFO L93 Difference]: Finished difference Result 318 states and 451 transitions. [2021-11-13 01:31:52,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 01:31:52,035 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 63 [2021-11-13 01:31:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:52,037 INFO L225 Difference]: With dead ends: 318 [2021-11-13 01:31:52,038 INFO L226 Difference]: Without dead ends: 287 [2021-11-13 01:31:52,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-11-13 01:31:52,039 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 83 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.05ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 117.34ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:52,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 1351 Invalid, 215 Unknown, 0 Unchecked, 5.05ms Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 117.34ms Time] [2021-11-13 01:31:52,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-11-13 01:31:52,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 281. [2021-11-13 01:31:52,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 207 states have (on average 1.2753623188405796) internal successors, (264), 206 states have internal predecessors, (264), 58 states have call successors, (58), 17 states have call predecessors, (58), 15 states have return successors, (69), 57 states have call predecessors, (69), 54 states have call successors, (69) [2021-11-13 01:31:52,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 391 transitions. [2021-11-13 01:31:52,073 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 391 transitions. Word has length 63 [2021-11-13 01:31:52,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:52,073 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 391 transitions. [2021-11-13 01:31:52,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-13 01:31:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 391 transitions. [2021-11-13 01:31:52,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-13 01:31:52,075 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:52,075 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 01:31:52,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-13 01:31:52,075 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:52,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash -129726516, now seen corresponding path program 1 times [2021-11-13 01:31:52,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:52,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279674940] [2021-11-13 01:31:52,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:52,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:52,183 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-13 01:31:52,183 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:52,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279674940] [2021-11-13 01:31:52,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279674940] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:52,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:52,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-13 01:31:52,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872446739] [2021-11-13 01:31:52,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:52,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-13 01:31:52,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:52,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-13 01:31:52,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-13 01:31:52,186 INFO L87 Difference]: Start difference. First operand 281 states and 391 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-13 01:31:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:52,474 INFO L93 Difference]: Finished difference Result 299 states and 407 transitions. [2021-11-13 01:31:52,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 01:31:52,475 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2021-11-13 01:31:52,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:52,478 INFO L225 Difference]: With dead ends: 299 [2021-11-13 01:31:52,478 INFO L226 Difference]: Without dead ends: 278 [2021-11-13 01:31:52,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-11-13 01:31:52,479 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 153 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 153.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.38ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 186.46ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:52,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 990 Invalid, 271 Unknown, 0 Unchecked, 5.38ms Time], IncrementalHoareTripleChecker [1 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 186.46ms Time] [2021-11-13 01:31:52,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-11-13 01:31:52,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2021-11-13 01:31:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 204 states have (on average 1.2745098039215685) internal successors, (260), 203 states have internal predecessors, (260), 56 states have call successors, (56), 17 states have call predecessors, (56), 15 states have return successors, (67), 55 states have call predecessors, (67), 52 states have call successors, (67) [2021-11-13 01:31:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 383 transitions. [2021-11-13 01:31:52,522 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 383 transitions. Word has length 65 [2021-11-13 01:31:52,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:52,522 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 383 transitions. [2021-11-13 01:31:52,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-13 01:31:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 383 transitions. [2021-11-13 01:31:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-13 01:31:52,523 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:52,524 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-13 01:31:52,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-13 01:31:52,524 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:52,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:52,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1450914883, now seen corresponding path program 1 times [2021-11-13 01:31:52,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:52,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710105717] [2021-11-13 01:31:52,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:52,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-13 01:31:52,672 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:52,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710105717] [2021-11-13 01:31:52,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710105717] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:52,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:52,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-13 01:31:52,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095959523] [2021-11-13 01:31:52,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:52,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 01:31:52,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:52,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 01:31:52,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-13 01:31:52,675 INFO L87 Difference]: Start difference. First operand 276 states and 383 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-13 01:31:53,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:53,133 INFO L93 Difference]: Finished difference Result 328 states and 449 transitions. [2021-11-13 01:31:53,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 01:31:53,134 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 70 [2021-11-13 01:31:53,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:53,137 INFO L225 Difference]: With dead ends: 328 [2021-11-13 01:31:53,137 INFO L226 Difference]: Without dead ends: 322 [2021-11-13 01:31:53,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-11-13 01:31:53,138 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 240 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 300.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.46ms SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 360.14ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:53,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 595 Invalid, 548 Unknown, 0 Unchecked, 6.46ms Time], IncrementalHoareTripleChecker [118 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 360.14ms Time] [2021-11-13 01:31:53,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-11-13 01:31:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 284. [2021-11-13 01:31:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 209 states have (on average 1.2822966507177034) internal successors, (268), 210 states have internal predecessors, (268), 58 states have call successors, (58), 18 states have call predecessors, (58), 16 states have return successors, (69), 55 states have call predecessors, (69), 54 states have call successors, (69) [2021-11-13 01:31:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 395 transitions. [2021-11-13 01:31:53,177 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 395 transitions. Word has length 70 [2021-11-13 01:31:53,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:53,178 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 395 transitions. [2021-11-13 01:31:53,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-13 01:31:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 395 transitions. [2021-11-13 01:31:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-13 01:31:53,179 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:53,180 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-13 01:31:53,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-13 01:31:53,180 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:53,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:53,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1040518753, now seen corresponding path program 1 times [2021-11-13 01:31:53,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:53,181 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214343364] [2021-11-13 01:31:53,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:53,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-13 01:31:53,383 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:53,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214343364] [2021-11-13 01:31:53,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214343364] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:53,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:53,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-13 01:31:53,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721575363] [2021-11-13 01:31:53,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:53,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 01:31:53,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:53,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 01:31:53,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-13 01:31:53,387 INFO L87 Difference]: Start difference. First operand 284 states and 395 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-13 01:31:53,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:53,840 INFO L93 Difference]: Finished difference Result 312 states and 426 transitions. [2021-11-13 01:31:53,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 01:31:53,840 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 70 [2021-11-13 01:31:53,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:53,843 INFO L225 Difference]: With dead ends: 312 [2021-11-13 01:31:53,843 INFO L226 Difference]: Without dead ends: 306 [2021-11-13 01:31:53,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-11-13 01:31:53,844 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 345 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 286.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.85ms SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 342.50ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:53,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 587 Invalid, 590 Unknown, 0 Unchecked, 6.85ms Time], IncrementalHoareTripleChecker [167 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 342.50ms Time] [2021-11-13 01:31:53,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-11-13 01:31:53,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 284. [2021-11-13 01:31:53,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 209 states have (on average 1.277511961722488) internal successors, (267), 210 states have internal predecessors, (267), 58 states have call successors, (58), 18 states have call predecessors, (58), 16 states have return successors, (69), 55 states have call predecessors, (69), 54 states have call successors, (69) [2021-11-13 01:31:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 394 transitions. [2021-11-13 01:31:53,879 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 394 transitions. Word has length 70 [2021-11-13 01:31:53,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:53,880 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 394 transitions. [2021-11-13 01:31:53,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-13 01:31:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 394 transitions. [2021-11-13 01:31:53,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-13 01:31:53,881 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:53,881 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 01:31:53,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-13 01:31:53,882 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:53,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1218407741, now seen corresponding path program 1 times [2021-11-13 01:31:53,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:53,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831424516] [2021-11-13 01:31:53,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:53,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:53,986 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-13 01:31:53,986 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:53,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831424516] [2021-11-13 01:31:53,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831424516] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:53,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:53,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-13 01:31:53,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766481217] [2021-11-13 01:31:53,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:53,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-13 01:31:53,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:53,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-13 01:31:53,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-13 01:31:53,988 INFO L87 Difference]: Start difference. First operand 284 states and 394 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-13 01:31:54,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:54,322 INFO L93 Difference]: Finished difference Result 288 states and 396 transitions. [2021-11-13 01:31:54,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-13 01:31:54,323 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2021-11-13 01:31:54,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:54,325 INFO L225 Difference]: With dead ends: 288 [2021-11-13 01:31:54,325 INFO L226 Difference]: Without dead ends: 249 [2021-11-13 01:31:54,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2021-11-13 01:31:54,327 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 232 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 192.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.29ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 228.97ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:54,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 1039 Invalid, 364 Unknown, 0 Unchecked, 5.29ms Time], IncrementalHoareTripleChecker [19 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 228.97ms Time] [2021-11-13 01:31:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-11-13 01:31:54,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 162. [2021-11-13 01:31:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 114 states have (on average 1.1754385964912282) internal successors, (134), 117 states have internal predecessors, (134), 33 states have call successors, (33), 16 states have call predecessors, (33), 14 states have return successors, (37), 28 states have call predecessors, (37), 30 states have call successors, (37) [2021-11-13 01:31:54,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 204 transitions. [2021-11-13 01:31:54,361 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 204 transitions. Word has length 70 [2021-11-13 01:31:54,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:54,362 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 204 transitions. [2021-11-13 01:31:54,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-13 01:31:54,362 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 204 transitions. [2021-11-13 01:31:54,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-13 01:31:54,363 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:54,363 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-13 01:31:54,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-13 01:31:54,364 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:54,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:54,364 INFO L85 PathProgramCache]: Analyzing trace with hash 761882567, now seen corresponding path program 1 times [2021-11-13 01:31:54,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:54,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069590146] [2021-11-13 01:31:54,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:54,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:54,425 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-13 01:31:54,426 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:54,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069590146] [2021-11-13 01:31:54,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069590146] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:54,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:54,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 01:31:54,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231887842] [2021-11-13 01:31:54,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:54,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 01:31:54,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:54,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 01:31:54,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 01:31:54,430 INFO L87 Difference]: Start difference. First operand 162 states and 204 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-13 01:31:54,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:54,599 INFO L93 Difference]: Finished difference Result 283 states and 348 transitions. [2021-11-13 01:31:54,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 01:31:54,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 78 [2021-11-13 01:31:54,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:54,603 INFO L225 Difference]: With dead ends: 283 [2021-11-13 01:31:54,603 INFO L226 Difference]: Without dead ends: 171 [2021-11-13 01:31:54,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-13 01:31:54,606 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 103 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 112.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.36ms SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 134.61ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:54,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 260 Invalid, 212 Unknown, 0 Unchecked, 2.36ms Time], IncrementalHoareTripleChecker [39 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 134.61ms Time] [2021-11-13 01:31:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-11-13 01:31:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 149. [2021-11-13 01:31:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 106 states have (on average 1.1320754716981132) internal successors, (120), 109 states have internal predecessors, (120), 28 states have call successors, (28), 18 states have call predecessors, (28), 14 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-13 01:31:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2021-11-13 01:31:54,627 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 78 [2021-11-13 01:31:54,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:54,627 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2021-11-13 01:31:54,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-13 01:31:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2021-11-13 01:31:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-13 01:31:54,630 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:54,630 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-13 01:31:54,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-13 01:31:54,631 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:54,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:54,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1944861011, now seen corresponding path program 1 times [2021-11-13 01:31:54,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:54,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503910747] [2021-11-13 01:31:54,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:54,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-13 01:31:54,808 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:54,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503910747] [2021-11-13 01:31:54,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503910747] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:54,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:54,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-13 01:31:54,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602748516] [2021-11-13 01:31:54,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:54,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 01:31:54,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:54,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 01:31:54,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-13 01:31:54,810 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-13 01:31:55,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:55,195 INFO L93 Difference]: Finished difference Result 186 states and 216 transitions. [2021-11-13 01:31:55,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 01:31:55,196 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2021-11-13 01:31:55,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:55,198 INFO L225 Difference]: With dead ends: 186 [2021-11-13 01:31:55,198 INFO L226 Difference]: Without dead ends: 179 [2021-11-13 01:31:55,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-11-13 01:31:55,199 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 227 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 246.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.42ms SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 303.40ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:55,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 409 Invalid, 488 Unknown, 0 Unchecked, 4.42ms Time], IncrementalHoareTripleChecker [134 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 303.40ms Time] [2021-11-13 01:31:55,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-11-13 01:31:55,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 150. [2021-11-13 01:31:55,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 107 states have (on average 1.1308411214953271) internal successors, (121), 110 states have internal predecessors, (121), 28 states have call successors, (28), 18 states have call predecessors, (28), 14 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-13 01:31:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 174 transitions. [2021-11-13 01:31:55,221 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 174 transitions. Word has length 99 [2021-11-13 01:31:55,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:55,221 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 174 transitions. [2021-11-13 01:31:55,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-13 01:31:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 174 transitions. [2021-11-13 01:31:55,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-13 01:31:55,223 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:55,223 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-13 01:31:55,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-13 01:31:55,224 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:55,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:55,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1535391636, now seen corresponding path program 1 times [2021-11-13 01:31:55,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:55,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006630455] [2021-11-13 01:31:55,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:55,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-13 01:31:55,285 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:55,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006630455] [2021-11-13 01:31:55,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006630455] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:55,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:55,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 01:31:55,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517516349] [2021-11-13 01:31:55,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:55,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 01:31:55,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:55,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 01:31:55,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 01:31:55,287 INFO L87 Difference]: Start difference. First operand 150 states and 174 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-13 01:31:55,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:55,329 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2021-11-13 01:31:55,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 01:31:55,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2021-11-13 01:31:55,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:55,331 INFO L225 Difference]: With dead ends: 157 [2021-11-13 01:31:55,331 INFO L226 Difference]: Without dead ends: 150 [2021-11-13 01:31:55,331 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-13 01:31:55,332 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 25 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.72ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.09ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:55,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 163 Invalid, 27 Unknown, 0 Unchecked, 0.72ms Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 22.09ms Time] [2021-11-13 01:31:55,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-11-13 01:31:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-11-13 01:31:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 107 states have (on average 1.1214953271028036) internal successors, (120), 110 states have internal predecessors, (120), 28 states have call successors, (28), 18 states have call predecessors, (28), 14 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-13 01:31:55,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 173 transitions. [2021-11-13 01:31:55,352 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 173 transitions. Word has length 99 [2021-11-13 01:31:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:55,353 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 173 transitions. [2021-11-13 01:31:55,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-13 01:31:55,353 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 173 transitions. [2021-11-13 01:31:55,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-13 01:31:55,355 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:55,355 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:31:55,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-13 01:31:55,355 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:55,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:55,356 INFO L85 PathProgramCache]: Analyzing trace with hash 732312146, now seen corresponding path program 1 times [2021-11-13 01:31:55,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:55,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808840220] [2021-11-13 01:31:55,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:55,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-13 01:31:55,554 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:55,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808840220] [2021-11-13 01:31:55,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808840220] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:55,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:55,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-13 01:31:55,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284943780] [2021-11-13 01:31:55,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:55,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 01:31:55,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:55,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 01:31:55,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-13 01:31:55,559 INFO L87 Difference]: Start difference. First operand 150 states and 173 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-13 01:31:55,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:55,890 INFO L93 Difference]: Finished difference Result 198 states and 227 transitions. [2021-11-13 01:31:55,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 01:31:55,891 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 104 [2021-11-13 01:31:55,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:55,892 INFO L225 Difference]: With dead ends: 198 [2021-11-13 01:31:55,892 INFO L226 Difference]: Without dead ends: 190 [2021-11-13 01:31:55,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-11-13 01:31:55,893 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 140 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 211.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.71ms SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 250.65ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:55,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 419 Invalid, 398 Unknown, 0 Unchecked, 3.71ms Time], IncrementalHoareTripleChecker [66 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 250.65ms Time] [2021-11-13 01:31:55,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-11-13 01:31:55,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 150. [2021-11-13 01:31:55,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 106 states have (on average 1.1132075471698113) internal successors, (118), 110 states have internal predecessors, (118), 28 states have call successors, (28), 19 states have call predecessors, (28), 15 states have return successors, (25), 20 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-13 01:31:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 171 transitions. [2021-11-13 01:31:55,916 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 171 transitions. Word has length 104 [2021-11-13 01:31:55,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:55,916 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 171 transitions. [2021-11-13 01:31:55,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-13 01:31:55,917 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 171 transitions. [2021-11-13 01:31:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-13 01:31:55,918 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:55,918 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:31:55,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-13 01:31:55,919 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:55,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:55,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1350939513, now seen corresponding path program 1 times [2021-11-13 01:31:55,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:55,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009093693] [2021-11-13 01:31:55,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:55,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:56,256 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-13 01:31:56,257 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:56,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009093693] [2021-11-13 01:31:56,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009093693] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 01:31:56,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809881040] [2021-11-13 01:31:56,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:56,257 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 01:31:56,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/z3 [2021-11-13 01:31:56,266 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 01:31:56,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-13 01:31:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:56,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-13 01:31:56,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 01:31:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2021-11-13 01:31:56,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 01:31:57,292 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2021-11-13 01:31:57,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809881040] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:57,293 INFO L186 FreeRefinementEngine]: Found 2 perfect and 1 imperfect interpolant sequences. [2021-11-13 01:31:57,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [13] total 20 [2021-11-13 01:31:57,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257359375] [2021-11-13 01:31:57,294 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:57,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 01:31:57,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:57,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 01:31:57,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-11-13 01:31:57,295 INFO L87 Difference]: Start difference. First operand 150 states and 171 transitions. Second operand has 9 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-13 01:31:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:57,570 INFO L93 Difference]: Finished difference Result 186 states and 211 transitions. [2021-11-13 01:31:57,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 01:31:57,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 126 [2021-11-13 01:31:57,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:57,575 INFO L225 Difference]: With dead ends: 186 [2021-11-13 01:31:57,575 INFO L226 Difference]: Without dead ends: 178 [2021-11-13 01:31:57,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2021-11-13 01:31:57,576 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 77 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 175.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.24ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 204.31ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:57,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 602 Invalid, 301 Unknown, 0 Unchecked, 4.24ms Time], IncrementalHoareTripleChecker [11 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 204.31ms Time] [2021-11-13 01:31:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-11-13 01:31:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 135. [2021-11-13 01:31:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 96 states have (on average 1.09375) internal successors, (105), 100 states have internal predecessors, (105), 24 states have call successors, (24), 16 states have call predecessors, (24), 14 states have return successors, (22), 18 states have call predecessors, (22), 22 states have call successors, (22) [2021-11-13 01:31:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2021-11-13 01:31:57,600 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 126 [2021-11-13 01:31:57,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:57,601 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2021-11-13 01:31:57,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-13 01:31:57,601 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2021-11-13 01:31:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-13 01:31:57,603 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 01:31:57,603 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:31:57,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-13 01:31:57,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 01:31:57,818 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 01:31:57,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 01:31:57,818 INFO L85 PathProgramCache]: Analyzing trace with hash 2119651962, now seen corresponding path program 1 times [2021-11-13 01:31:57,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 01:31:57,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588083166] [2021-11-13 01:31:57,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 01:31:57,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 01:31:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 01:31:58,074 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2021-11-13 01:31:58,074 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-13 01:31:58,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588083166] [2021-11-13 01:31:58,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588083166] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 01:31:58,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 01:31:58,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-13 01:31:58,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747405082] [2021-11-13 01:31:58,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 01:31:58,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 01:31:58,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-13 01:31:58,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 01:31:58,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-13 01:31:58,077 INFO L87 Difference]: Start difference. First operand 135 states and 151 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 4 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-13 01:31:58,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 01:31:58,391 INFO L93 Difference]: Finished difference Result 164 states and 185 transitions. [2021-11-13 01:31:58,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 01:31:58,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 4 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 128 [2021-11-13 01:31:58,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 01:31:58,392 INFO L225 Difference]: With dead ends: 164 [2021-11-13 01:31:58,392 INFO L226 Difference]: Without dead ends: 0 [2021-11-13 01:31:58,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-11-13 01:31:58,403 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 207 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 195.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.90ms SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 233.04ms IncrementalHoareTripleChecker+Time [2021-11-13 01:31:58,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 402 Invalid, 363 Unknown, 0 Unchecked, 3.90ms Time], IncrementalHoareTripleChecker [104 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 233.04ms Time] [2021-11-13 01:31:58,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-13 01:31:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-13 01:31:58,405 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-13 01:31:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-13 01:31:58,405 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2021-11-13 01:31:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 01:31:58,407 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-13 01:31:58,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 4 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-13 01:31:58,407 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-13 01:31:58,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-13 01:31:58,410 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-13 01:31:58,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-13 01:31:58,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-13 01:32:49,805 INFO L858 garLoopResultBuilder]: For program point IoBuildDeviceIoControlRequestEXIT(lines 834 858) no Hoare annotation was computed. [2021-11-13 01:32:49,806 INFO L854 garLoopResultBuilder]: At program point IoBuildDeviceIoControlRequestENTRY(lines 834 858) the Hoare annotation is: (or (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (not (<= (+ 2 ~DC~0) ~SKIP2~0)) (= |old(~customIrp~0)| ~customIrp~0) (= ~pended~0 1) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= ~s~0 ~NP~0)) (not (= ~routine~0 0)) (not (<= ~NP~0 ~s~0)) (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 1))) [2021-11-13 01:32:49,806 INFO L854 garLoopResultBuilder]: At program point L987(lines 979 998) the Hoare annotation is: (let ((.cse0 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse2 (= ~pended~0 1)) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse4 (not (= ~routine~0 0))) (.cse5 (not (= |old(~setEventCalled~0)| 1))) (.cse6 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0)))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|))) (or .cse0 .cse1 (not (= |old(~customIrp~0)| 1)) .cse2 (and (= ~setEventCalled~0 1) (= ~customIrp~0 1) (= ~s~0 |old(~s~0)|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-11-13 01:32:49,806 INFO L858 garLoopResultBuilder]: For program point KeWaitForSingleObjectEXIT(lines 974 1015) no Hoare annotation was computed. [2021-11-13 01:32:49,807 INFO L858 garLoopResultBuilder]: For program point L979(lines 979 998) no Hoare annotation was computed. [2021-11-13 01:32:49,807 INFO L854 garLoopResultBuilder]: At program point L994(line 994) the Hoare annotation is: (let ((.cse0 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse2 (= ~pended~0 1)) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse4 (not (= ~routine~0 0))) (.cse5 (not (= |old(~setEventCalled~0)| 1))) (.cse6 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0)))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|))) (or .cse0 .cse1 (not (= |old(~customIrp~0)| 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-11-13 01:32:49,807 INFO L858 garLoopResultBuilder]: For program point L992(lines 992 996) no Hoare annotation was computed. [2021-11-13 01:32:49,807 INFO L854 garLoopResultBuilder]: At program point L992-1(lines 979 998) the Hoare annotation is: (let ((.cse0 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse2 (= ~pended~0 1)) (.cse7 (= ~s~0 ~NP~0)) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse4 (not (= ~routine~0 0))) (.cse5 (not (= |old(~setEventCalled~0)| 1))) (.cse6 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0)))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse9 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (= |old(~customIrp~0)| ~customIrp~0) .cse7) .cse8 .cse9 (not (= ~MPR3~0 |old(~s~0)|))) (or .cse0 .cse1 (not (= |old(~customIrp~0)| 1)) (and (= ~setEventCalled~0 1) .cse7) .cse2 (and .cse7 (= ~customIrp~0 1)) .cse3 .cse4 .cse5 .cse6 .cse8 .cse9))) [2021-11-13 01:32:49,807 INFO L858 garLoopResultBuilder]: For program point L980(lines 980 985) no Hoare annotation was computed. [2021-11-13 01:32:49,808 INFO L854 garLoopResultBuilder]: At program point KeWaitForSingleObjectENTRY(lines 974 1015) the Hoare annotation is: (let ((.cse0 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse4 (= ~pended~0 1)) (.cse2 (= ~setEventCalled~0 1)) (.cse3 (= ~s~0 |old(~s~0)|)) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (= ~routine~0 0))) (.cse7 (not (= |old(~setEventCalled~0)| 1))) (.cse8 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0)))) (.cse9 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse10 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 (and (= |old(~customIrp~0)| ~customIrp~0) .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~MPR3~0 |old(~s~0)|))) (or .cse0 .cse1 (not (= |old(~customIrp~0)| 1)) .cse4 (and .cse2 (= ~customIrp~0 1) .cse3) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2021-11-13 01:32:49,808 INFO L854 garLoopResultBuilder]: At program point L281(line 281) the Hoare annotation is: (or (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (not (<= (+ 2 ~DC~0) ~SKIP2~0)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= ~NP~0 |old(~s~0)|)) (and (= ~compRegistered~0 1) (or (= 259 DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (and (<= ~s~0 ~NP~0) (<= ~NP~0 ~s~0))) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 1) (not (= ~pended~0 1)) (= ~routine~0 0) (= DiskPerfForwardIrpSynchronous_~status~3 DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (= ~MPR3~0 ~s~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~routine~0)| 0)) (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) (not (<= (+ ~SKIP2~0 3) ~IPC~0))) [2021-11-13 01:32:49,808 INFO L858 garLoopResultBuilder]: For program point L281-1(line 281) no Hoare annotation was computed. [2021-11-13 01:32:49,808 INFO L858 garLoopResultBuilder]: For program point L279(lines 279 284) no Hoare annotation was computed. [2021-11-13 01:32:49,808 INFO L858 garLoopResultBuilder]: For program point L279-2(lines 279 284) no Hoare annotation was computed. [2021-11-13 01:32:49,808 INFO L858 garLoopResultBuilder]: For program point DiskPerfForwardIrpSynchronousEXIT(lines 237 288) no Hoare annotation was computed. [2021-11-13 01:32:49,809 INFO L854 garLoopResultBuilder]: At program point L275(line 275) the Hoare annotation is: (or (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (not (<= (+ 2 ~DC~0) ~SKIP2~0)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (and (= ~compRegistered~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)) (= ~routine~0 0) (= ~s~0 |old(~s~0)|)) (not (<= ~NP~0 |old(~s~0)|)) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~routine~0)| 0)) (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) (not (<= (+ ~SKIP2~0 3) ~IPC~0))) [2021-11-13 01:32:49,809 INFO L858 garLoopResultBuilder]: For program point L275-1(line 275) no Hoare annotation was computed. [2021-11-13 01:32:49,809 INFO L854 garLoopResultBuilder]: At program point L259(line 259) the Hoare annotation is: (or (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (not (<= (+ 2 ~DC~0) ~SKIP2~0)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= ~NP~0 |old(~s~0)|)) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~routine~0)| 0)) (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) (not (<= (+ ~SKIP2~0 3) ~IPC~0))) [2021-11-13 01:32:49,809 INFO L858 garLoopResultBuilder]: For program point L257(lines 257 270) no Hoare annotation was computed. [2021-11-13 01:32:49,809 INFO L854 garLoopResultBuilder]: At program point DiskPerfForwardIrpSynchronousENTRY(lines 237 288) the Hoare annotation is: (or (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (not (<= (+ 2 ~DC~0) ~SKIP2~0)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= ~NP~0 |old(~s~0)|)) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~routine~0)| 0)) (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) (and (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)) (= ~routine~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0))) [2021-11-13 01:32:49,809 INFO L854 garLoopResultBuilder]: At program point L264(line 264) the Hoare annotation is: (or (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (not (<= (+ 2 ~DC~0) ~SKIP2~0)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= ~NP~0 |old(~s~0)|)) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~routine~0)| 0)) (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) (not (<= (+ ~SKIP2~0 3) ~IPC~0))) [2021-11-13 01:32:49,809 INFO L858 garLoopResultBuilder]: For program point L262(lines 262 269) no Hoare annotation was computed. [2021-11-13 01:32:49,809 INFO L858 garLoopResultBuilder]: For program point L262-1(lines 257 270) no Hoare annotation was computed. [2021-11-13 01:32:49,809 INFO L854 garLoopResultBuilder]: At program point L960(line 960) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (= ~routine~0 0)))) (and (or (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (not (<= (+ 2 ~DC~0) ~SKIP2~0)) .cse0 (not (<= ~NP~0 |old(~s~0)|)) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) .cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 1))) (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1))) [2021-11-13 01:32:49,809 INFO L858 garLoopResultBuilder]: For program point L960-1(lines 952 965) no Hoare annotation was computed. [2021-11-13 01:32:49,810 INFO L858 garLoopResultBuilder]: For program point L956(lines 956 962) no Hoare annotation was computed. [2021-11-13 01:32:49,810 INFO L854 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 952 965) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (= ~routine~0 0)))) (and (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 (= ~s~0 ~NP~0) .cse1) (or (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (not (<= (+ 2 ~DC~0) ~SKIP2~0)) .cse0 (not (<= ~NP~0 |old(~s~0)|)) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) .cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (= ~s~0 |old(~s~0)|) (not (= ~compRegistered~0 1))))) [2021-11-13 01:32:49,810 INFO L858 garLoopResultBuilder]: For program point IofCompleteRequestEXIT(lines 952 965) no Hoare annotation was computed. [2021-11-13 01:32:49,810 INFO L861 garLoopResultBuilder]: At program point errorFnENTRY(lines 52 59) the Hoare annotation is: true [2021-11-13 01:32:49,810 INFO L858 garLoopResultBuilder]: For program point errorFnEXIT(lines 52 59) no Hoare annotation was computed. [2021-11-13 01:32:49,810 INFO L858 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-13 01:32:49,811 INFO L854 garLoopResultBuilder]: At program point L795(line 795) the Hoare annotation is: false [2021-11-13 01:32:49,811 INFO L854 garLoopResultBuilder]: At program point L630(lines 461 632) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,811 INFO L858 garLoopResultBuilder]: For program point L597(lines 597 599) no Hoare annotation was computed. [2021-11-13 01:32:49,812 INFO L854 garLoopResultBuilder]: At program point L564(lines 564 565) the Hoare annotation is: (and (not (= |ULTIMATE.start_DiskPerfRegisterDevice_~output~0#1| 0)) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (not (= ~pended~0 1))) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse3 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse4 (= ~routine~0 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|))) (.cse7 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0))) (.cse8 (<= (+ 2 ~DC~0) ~SKIP2~0))) (or (and .cse0 (= ~setEventCalled~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= ~customIrp~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (= ~s~0 ~NP~0)) [2021-11-13 01:32:49,812 INFO L858 garLoopResultBuilder]: For program point L564-1(lines 564 565) no Hoare annotation was computed. [2021-11-13 01:32:49,814 INFO L854 garLoopResultBuilder]: At program point L1093(line 1093) the Hoare annotation is: false [2021-11-13 01:32:49,814 INFO L854 garLoopResultBuilder]: At program point L1093-1(lines 1072 1097) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= |ULTIMATE.start_PoCallDriver_~returnVal~0#1| ~lowerDriverReturn~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|)) [2021-11-13 01:32:49,814 INFO L854 garLoopResultBuilder]: At program point L1028(line 1028) the Hoare annotation is: false [2021-11-13 01:32:49,814 INFO L858 garLoopResultBuilder]: For program point L1028-1(line 1028) no Hoare annotation was computed. [2021-11-13 01:32:49,815 INFO L861 garLoopResultBuilder]: At program point L831(lines 647 833) the Hoare annotation is: true [2021-11-13 01:32:49,815 INFO L858 garLoopResultBuilder]: For program point L567(lines 567 569) no Hoare annotation was computed. [2021-11-13 01:32:49,815 INFO L854 garLoopResultBuilder]: At program point L105(lines 105 132) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,816 INFO L854 garLoopResultBuilder]: At program point L601(line 601) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= |ULTIMATE.start_DiskPerfRegisterDevice_~output~0#1| 0)) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,816 INFO L858 garLoopResultBuilder]: For program point L601-1(line 601) no Hoare annotation was computed. [2021-11-13 01:32:49,816 INFO L854 garLoopResultBuilder]: At program point L535(lines 535 536) the Hoare annotation is: (and (not (= |ULTIMATE.start_DiskPerfRegisterDevice_~output~0#1| 0)) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (not (= ~pended~0 1))) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse3 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse4 (= ~routine~0 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|))) (.cse7 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0))) (.cse8 (<= (+ 2 ~DC~0) ~SKIP2~0))) (or (and .cse0 (= ~setEventCalled~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= ~customIrp~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (= ~s~0 ~NP~0)) [2021-11-13 01:32:49,816 INFO L858 garLoopResultBuilder]: For program point L535-1(lines 535 536) no Hoare annotation was computed. [2021-11-13 01:32:49,816 INFO L858 garLoopResultBuilder]: For program point L1031(lines 1031 1035) no Hoare annotation was computed. [2021-11-13 01:32:49,816 INFO L858 garLoopResultBuilder]: For program point L1031-2(lines 1026 1036) no Hoare annotation was computed. [2021-11-13 01:32:49,817 INFO L858 garLoopResultBuilder]: For program point L701(lines 701 703) no Hoare annotation was computed. [2021-11-13 01:32:49,817 INFO L854 garLoopResultBuilder]: At program point L404-2(lines 404 411) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,817 INFO L858 garLoopResultBuilder]: For program point L405(lines 404 411) no Hoare annotation was computed. [2021-11-13 01:32:49,817 INFO L854 garLoopResultBuilder]: At program point L207(line 207) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,817 INFO L854 garLoopResultBuilder]: At program point L207-1(line 207) the Hoare annotation is: (and (<= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfSendToNextDriver_#t~ret26#1|) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= |ULTIMATE.start_DiskPerfSendToNextDriver_#t~ret26#1| ~lowerDriverReturn~0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP2~0 ~s~0)) [2021-11-13 01:32:49,818 INFO L854 garLoopResultBuilder]: At program point L108(lines 108 131) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,818 INFO L854 garLoopResultBuilder]: At program point L1033(line 1033) the Hoare annotation is: false [2021-11-13 01:32:49,818 INFO L858 garLoopResultBuilder]: For program point L1033-1(line 1033) no Hoare annotation was computed. [2021-11-13 01:32:49,818 INFO L854 garLoopResultBuilder]: At program point L571(line 571) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= |ULTIMATE.start_DiskPerfRegisterDevice_~output~0#1| 0)) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,818 INFO L858 garLoopResultBuilder]: For program point L538(lines 538 540) no Hoare annotation was computed. [2021-11-13 01:32:49,818 INFO L858 garLoopResultBuilder]: For program point L571-1(line 571) no Hoare annotation was computed. [2021-11-13 01:32:49,819 INFO L858 garLoopResultBuilder]: For program point L605(lines 605 610) no Hoare annotation was computed. [2021-11-13 01:32:49,819 INFO L858 garLoopResultBuilder]: For program point L605-2(lines 526 624) no Hoare annotation was computed. [2021-11-13 01:32:49,819 INFO L854 garLoopResultBuilder]: At program point L1068(lines 1024 1099) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,824 INFO L854 garLoopResultBuilder]: At program point L804(lines 791 826) the Hoare annotation is: (let ((.cse8 (+ 2 ~DC~0))) (let ((.cse1 (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~6#1|)) (.cse6 (< |ULTIMATE.start_main_~status~6#1| (+ ~lowerDriverReturn~0 1))) (.cse14 (= ~s~0 ~DC~0)) (.cse2 (not (= ~pended~0 1))) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse5 (= ~routine~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (= ~compRegistered~0 0)) (.cse10 (<= .cse8 ~SKIP2~0))) (let ((.cse11 (not (= |ULTIMATE.start_main_~status~6#1| 259))) (.cse12 (not (= |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1| 259))) (.cse13 (not (= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| 259))) (.cse0 (or (and (<= ~s~0 ~DC~0) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_PoCallDriver_~returnVal~0#1| ~lowerDriverReturn~0) .cse7 .cse9 (<= ~lowerDriverReturn~0 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|)) (and (or (and (= ~compRegistered~0 1) .cse14 .cse2 .cse3 .cse5 .cse7) (and .cse14 .cse2 .cse3 .cse5 .cse7 .cse9)) .cse4)) .cse10) (and (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 (= |ULTIMATE.start_main_~status~6#1| ~lowerDriverReturn~0)))) (.cse15 (= |ULTIMATE.start_main_~status~6#1| 0))) (or (and .cse0 (<= (+ |ULTIMATE.start_main_~status~6#1| 1073741789) 0) (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) 0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse8 ~s~0) .cse9 .cse10) (and .cse11 .cse0 .cse12 (not (= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 259)) .cse13) (and .cse11 .cse0 (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) .cse12 .cse13) (and .cse14 .cse15 .cse2 .cse5) (and .cse0 .cse15 (= |ULTIMATE.start_DiskPerfDeviceControl_~status~4#1| 0) (= |ULTIMATE.start_DiskPerfDeviceControl_#res#1| 0)))))) [2021-11-13 01:32:49,825 INFO L854 garLoopResultBuilder]: At program point L607(line 607) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,826 INFO L858 garLoopResultBuilder]: For program point L607-1(line 607) no Hoare annotation was computed. [2021-11-13 01:32:49,826 INFO L854 garLoopResultBuilder]: At program point L508(lines 508 509) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,826 INFO L858 garLoopResultBuilder]: For program point L508-1(lines 508 509) no Hoare annotation was computed. [2021-11-13 01:32:49,826 INFO L858 garLoopResultBuilder]: For program point L806(lines 806 810) no Hoare annotation was computed. [2021-11-13 01:32:49,826 INFO L854 garLoopResultBuilder]: At program point L707(lines 707 766) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,827 INFO L858 garLoopResultBuilder]: For program point L575(lines 575 580) no Hoare annotation was computed. [2021-11-13 01:32:49,827 INFO L854 garLoopResultBuilder]: At program point L542(line 542) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= |ULTIMATE.start_DiskPerfRegisterDevice_~output~0#1| 0)) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,827 INFO L858 garLoopResultBuilder]: For program point L542-1(line 542) no Hoare annotation was computed. [2021-11-13 01:32:49,830 INFO L854 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,830 INFO L858 garLoopResultBuilder]: For program point L179-1(line 179) no Hoare annotation was computed. [2021-11-13 01:32:49,831 INFO L858 garLoopResultBuilder]: For program point L774(lines 774 778) no Hoare annotation was computed. [2021-11-13 01:32:49,831 INFO L858 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2021-11-13 01:32:49,831 INFO L854 garLoopResultBuilder]: At program point L808(line 808) the Hoare annotation is: false [2021-11-13 01:32:49,831 INFO L854 garLoopResultBuilder]: At program point L577(line 577) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (not (= |ULTIMATE.start_DiskPerfRegisterDevice_~output~0#1| 0)) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= (+ 2 ~DC~0) ~SKIP2~0) (or (= ~s~0 ~NP~0) (= |ULTIMATE.start_DiskPerfRegisterDevice_~__cil_tmp32~0#1| 259))) [2021-11-13 01:32:49,831 INFO L858 garLoopResultBuilder]: For program point L577-1(line 577) no Hoare annotation was computed. [2021-11-13 01:32:49,831 INFO L858 garLoopResultBuilder]: For program point L511(lines 511 513) no Hoare annotation was computed. [2021-11-13 01:32:49,832 INFO L854 garLoopResultBuilder]: At program point L412(lines 403 413) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,832 INFO L854 garLoopResultBuilder]: At program point L182(line 182) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 259)) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,832 INFO L854 garLoopResultBuilder]: At program point L182-1(line 182) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~s~0 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 259)) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,832 INFO L854 garLoopResultBuilder]: At program point L1041(line 1041) the Hoare annotation is: false [2021-11-13 01:32:49,832 INFO L858 garLoopResultBuilder]: For program point L546(lines 546 551) no Hoare annotation was computed. [2021-11-13 01:32:49,832 INFO L858 garLoopResultBuilder]: For program point L546-2(lines 546 551) no Hoare annotation was computed. [2021-11-13 01:32:49,833 INFO L854 garLoopResultBuilder]: At program point L712(lines 712 765) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,833 INFO L858 garLoopResultBuilder]: For program point L1076(lines 1076 1096) no Hoare annotation was computed. [2021-11-13 01:32:49,833 INFO L858 garLoopResultBuilder]: For program point L812(lines 812 824) no Hoare annotation was computed. [2021-11-13 01:32:49,833 INFO L854 garLoopResultBuilder]: At program point L548(line 548) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (not (= |ULTIMATE.start_DiskPerfRegisterDevice_~output~0#1| 0)) (or .cse0 (<= 259 |ULTIMATE.start_DiskPerfRegisterDevice_~status~5#1|)) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) (or (and (< 258 |ULTIMATE.start_DiskPerfRegisterDevice_~__cil_tmp27~0#1|) (<= |ULTIMATE.start_DiskPerfRegisterDevice_~__cil_tmp27~0#1| 259)) .cse0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= (+ 2 ~DC~0) ~SKIP2~0))) [2021-11-13 01:32:49,833 INFO L854 garLoopResultBuilder]: At program point L515(line 515) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,834 INFO L858 garLoopResultBuilder]: For program point L548-1(line 548) no Hoare annotation was computed. [2021-11-13 01:32:49,834 INFO L858 garLoopResultBuilder]: For program point L515-1(line 515) no Hoare annotation was computed. [2021-11-13 01:32:49,834 INFO L854 garLoopResultBuilder]: At program point L449(line 449) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,834 INFO L854 garLoopResultBuilder]: At program point L449-1(line 449) the Hoare annotation is: (and (<= |ULTIMATE.start_DiskPerfShutdownFlush_#t~ret78#1| ~lowerDriverReturn~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~s~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfShutdownFlush_#t~ret78#1|) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~IPC~0 ~s~0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,834 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-11-13 01:32:49,834 INFO L858 garLoopResultBuilder]: For program point L813(lines 813 817) no Hoare annotation was computed. [2021-11-13 01:32:49,835 INFO L854 garLoopResultBuilder]: At program point L780(lines 773 830) the Hoare annotation is: (let ((.cse2 (+ ~SKIP2~0 3))) (let ((.cse15 (= ~s~0 ~DC~0)) (.cse1 (not (= ~pended~0 1))) (.cse13 (<= .cse2 ~IPC~0)) (.cse4 (= ~routine~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~compRegistered~0 0))) (let ((.cse0 (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~6#1|)) (.cse5 (< |ULTIMATE.start_main_~status~6#1| (+ ~lowerDriverReturn~0 1))) (.cse14 (= ~SKIP2~0 ~s~0)) (.cse9 (not (= |ULTIMATE.start_main_~status~6#1| 259))) (.cse10 (or (and (= ~compRegistered~0 1) .cse15 .cse1 .cse13 .cse4 .cse6) (and .cse15 .cse1 .cse13 .cse4 .cse6 .cse7))) (.cse3 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse11 (not (= |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1| 259))) (.cse12 (not (= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| 259))) (.cse8 (<= (+ 2 ~DC~0) ~SKIP2~0))) (or (and .cse0 .cse1 (<= .cse2 ~s~0) .cse3 .cse4 .cse5 .cse6 (= ~IPC~0 ~s~0) .cse7 .cse8) (and .cse9 .cse10 .cse3 (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) .cse11 .cse12 .cse8) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_PoCallDriver_~returnVal~0#1| ~lowerDriverReturn~0) .cse6 .cse7 .cse8 .cse14 (<= ~lowerDriverReturn~0 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|)) (and .cse0 (<= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDispatchPnp_#res#1|) .cse1 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| ~lowerDriverReturn~0) .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14) (and .cse10 .cse3 (<= (+ |ULTIMATE.start_main_~status~6#1| 1073741789) 0) (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) 0) .cse8) (and .cse9 .cse10 .cse3 .cse11 (not (= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 259)) .cse12 .cse8) (= ~s~0 ~UNLOADED~0) (and .cse15 (= |ULTIMATE.start_main_~status~6#1| 0) .cse1 .cse4))))) [2021-11-13 01:32:49,835 INFO L858 garLoopResultBuilder]: For program point L616(lines 616 621) no Hoare annotation was computed. [2021-11-13 01:32:49,835 INFO L854 garLoopResultBuilder]: At program point L815(line 815) the Hoare annotation is: false [2021-11-13 01:32:49,836 INFO L858 garLoopResultBuilder]: For program point L782(lines 782 786) no Hoare annotation was computed. [2021-11-13 01:32:49,836 INFO L854 garLoopResultBuilder]: At program point L683(lines 683 772) the Hoare annotation is: (and (<= ~s~0 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~s~0 ~UNLOADED~0) (<= (+ 2 ~s~0) ~MPR1~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (not (= ~MPR3~0 ~s~0))) [2021-11-13 01:32:49,836 INFO L858 garLoopResultBuilder]: For program point L683-1(lines 678 832) no Hoare annotation was computed. [2021-11-13 01:32:49,837 INFO L854 garLoopResultBuilder]: At program point L617(lines 613 622) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,837 INFO L858 garLoopResultBuilder]: For program point L221(lines 221 227) no Hoare annotation was computed. [2021-11-13 01:32:49,837 INFO L854 garLoopResultBuilder]: At program point L717(lines 717 764) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,837 INFO L858 garLoopResultBuilder]: For program point L519(lines 519 524) no Hoare annotation was computed. [2021-11-13 01:32:49,837 INFO L858 garLoopResultBuilder]: For program point L519-2(lines 501 631) no Hoare annotation was computed. [2021-11-13 01:32:49,837 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 432) no Hoare annotation was computed. [2021-11-13 01:32:49,838 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 418) no Hoare annotation was computed. [2021-11-13 01:32:49,838 INFO L858 garLoopResultBuilder]: For program point L388-2(lines 388 418) no Hoare annotation was computed. [2021-11-13 01:32:49,838 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-13 01:32:49,838 INFO L854 garLoopResultBuilder]: At program point L157(line 157) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,838 INFO L854 garLoopResultBuilder]: At program point L157-1(line 157) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (not (= ~pended~0 1))) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse3 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse4 (= ~routine~0 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0))) (.cse7 (<= (+ 2 ~DC~0) ~SKIP2~0))) (or (and (not (= |ULTIMATE.start_DiskPerfStartDevice_#t~ret15#1| 259)) .cse0 (<= ~s~0 ~NP~0) (= ~setEventCalled~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~NP~0 ~s~0) .cse6 .cse7) (and .cse0 (<= |ULTIMATE.start_DiskPerfStartDevice_#t~ret15#1| 258) .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-11-13 01:32:49,839 INFO L854 garLoopResultBuilder]: At program point L521(line 521) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (or .cse0 (<= 259 |ULTIMATE.start_DiskPerfRegisterDevice_~status~5#1|)) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= (+ 2 ~DC~0) ~SKIP2~0) (or (and (<= |ULTIMATE.start_DiskPerfRegisterDevice_~__cil_tmp23~0#1| 259) (< 258 |ULTIMATE.start_DiskPerfRegisterDevice_~__cil_tmp23~0#1|)) .cse0))) [2021-11-13 01:32:49,839 INFO L858 garLoopResultBuilder]: For program point L521-1(line 521) no Hoare annotation was computed. [2021-11-13 01:32:49,839 INFO L854 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse0 (not (= ~pended~0 1))) (.cse1 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse4 (= ~routine~0 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~compRegistered~0 0)) (.cse7 (<= (+ 2 ~DC~0) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ |ULTIMATE.start_DiskPerfDeviceControl_~status~4#1| 1073741789) 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_DiskPerfDeviceControl_~status~4#1| 0) .cse6 .cse7))) [2021-11-13 01:32:49,839 INFO L858 garLoopResultBuilder]: For program point L422-1(line 422) no Hoare annotation was computed. [2021-11-13 01:32:49,839 INFO L858 garLoopResultBuilder]: For program point L819(lines 819 823) no Hoare annotation was computed. [2021-11-13 01:32:49,839 INFO L858 garLoopResultBuilder]: For program point L555(lines 555 582) no Hoare annotation was computed. [2021-11-13 01:32:49,840 INFO L858 garLoopResultBuilder]: For program point L555-1(lines 526 624) no Hoare annotation was computed. [2021-11-13 01:32:49,840 INFO L854 garLoopResultBuilder]: At program point L225(line 225) the Hoare annotation is: false [2021-11-13 01:32:49,840 INFO L858 garLoopResultBuilder]: For program point L225-1(lines 221 227) no Hoare annotation was computed. [2021-11-13 01:32:49,840 INFO L854 garLoopResultBuilder]: At program point L821(line 821) the Hoare annotation is: false [2021-11-13 01:32:49,840 INFO L854 garLoopResultBuilder]: At program point L788(lines 781 829) the Hoare annotation is: (let ((.cse2 (+ ~SKIP2~0 3))) (let ((.cse15 (= ~s~0 ~DC~0)) (.cse1 (not (= ~pended~0 1))) (.cse13 (<= .cse2 ~IPC~0)) (.cse4 (= ~routine~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~compRegistered~0 0))) (let ((.cse0 (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~6#1|)) (.cse5 (< |ULTIMATE.start_main_~status~6#1| (+ ~lowerDriverReturn~0 1))) (.cse14 (= ~SKIP2~0 ~s~0)) (.cse9 (not (= |ULTIMATE.start_main_~status~6#1| 259))) (.cse10 (or (and (= ~compRegistered~0 1) .cse15 .cse1 .cse13 .cse4 .cse6) (and .cse15 .cse1 .cse13 .cse4 .cse6 .cse7))) (.cse3 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse11 (not (= |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1| 259))) (.cse12 (not (= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| 259))) (.cse8 (<= (+ 2 ~DC~0) ~SKIP2~0))) (or (and .cse0 .cse1 (<= .cse2 ~s~0) .cse3 .cse4 .cse5 .cse6 (= ~IPC~0 ~s~0) .cse7 .cse8) (and .cse9 .cse10 .cse3 (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) .cse11 .cse12 .cse8) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_PoCallDriver_~returnVal~0#1| ~lowerDriverReturn~0) .cse6 .cse7 .cse8 .cse14 (<= ~lowerDriverReturn~0 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|)) (and .cse0 (<= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDispatchPnp_#res#1|) .cse1 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| ~lowerDriverReturn~0) .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14) (and .cse10 .cse3 (<= (+ |ULTIMATE.start_main_~status~6#1| 1073741789) 0) (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) 0) .cse8) (and .cse9 .cse10 .cse3 .cse11 (not (= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 259)) .cse12 .cse8) (= ~s~0 ~UNLOADED~0) (and .cse15 (= |ULTIMATE.start_main_~status~6#1| 0) .cse1 .cse4))))) [2021-11-13 01:32:49,841 INFO L854 garLoopResultBuilder]: At program point L722(lines 722 763) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,841 INFO L858 garLoopResultBuilder]: For program point L557(lines 557 559) no Hoare annotation was computed. [2021-11-13 01:32:49,841 INFO L858 garLoopResultBuilder]: For program point L789(lines 773 830) no Hoare annotation was computed. [2021-11-13 01:32:49,841 INFO L858 garLoopResultBuilder]: For program point L393(lines 393 400) no Hoare annotation was computed. [2021-11-13 01:32:49,841 INFO L854 garLoopResultBuilder]: At program point L162(line 162) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,841 INFO L854 garLoopResultBuilder]: At program point L162-1(line 162) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~s~0 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,842 INFO L854 garLoopResultBuilder]: At program point L129(lines 112 130) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (= ~s~0 ~DC~0)) (.cse2 (not (= ~pended~0 1))) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse5 (= ~routine~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (not (= |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1| 259))) (.cse8 (<= (+ 2 ~DC~0) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 259)) .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) .cse7 .cse8))) [2021-11-13 01:32:49,842 INFO L858 garLoopResultBuilder]: For program point L790(lines 790 827) no Hoare annotation was computed. [2021-11-13 01:32:49,842 INFO L858 garLoopResultBuilder]: For program point L526(lines 501 631) no Hoare annotation was computed. [2021-11-13 01:32:49,842 INFO L854 garLoopResultBuilder]: At program point L295(line 295) the Hoare annotation is: (and (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~routine~0 0) (= ~compRegistered~0 0)) [2021-11-13 01:32:49,842 INFO L854 garLoopResultBuilder]: At program point L295-1(line 295) the Hoare annotation is: (and (= ~s~0 ~DC~0) (not (= ~pended~0 1)) (= ~routine~0 0) (= ~compRegistered~0 0)) [2021-11-13 01:32:49,842 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 202) no Hoare annotation was computed. [2021-11-13 01:32:49,843 INFO L858 garLoopResultBuilder]: For program point L1088(lines 1088 1095) no Hoare annotation was computed. [2021-11-13 01:32:49,843 INFO L858 garLoopResultBuilder]: For program point L791(lines 791 826) no Hoare annotation was computed. [2021-11-13 01:32:49,843 INFO L854 garLoopResultBuilder]: At program point L593(lines 593 595) the Hoare annotation is: (and (not (= |ULTIMATE.start_DiskPerfRegisterDevice_~output~0#1| 0)) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (not (= ~pended~0 1))) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse3 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse4 (= ~routine~0 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|))) (.cse7 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0))) (.cse8 (<= (+ 2 ~DC~0) ~SKIP2~0))) (or (and .cse0 (= ~setEventCalled~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= ~customIrp~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (= ~s~0 ~NP~0)) [2021-11-13 01:32:49,843 INFO L858 garLoopResultBuilder]: For program point L593-1(lines 593 595) no Hoare annotation was computed. [2021-11-13 01:32:49,843 INFO L858 garLoopResultBuilder]: For program point L792(lines 792 802) no Hoare annotation was computed. [2021-11-13 01:32:49,843 INFO L858 garLoopResultBuilder]: For program point L528(lines 528 530) no Hoare annotation was computed. [2021-11-13 01:32:49,844 INFO L854 garLoopResultBuilder]: At program point L429(line 429) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,844 INFO L858 garLoopResultBuilder]: For program point L429-1(line 429) no Hoare annotation was computed. [2021-11-13 01:32:49,844 INFO L858 garLoopResultBuilder]: For program point L793(lines 793 799) no Hoare annotation was computed. [2021-11-13 01:32:49,844 INFO L854 garLoopResultBuilder]: At program point L760(lines 683 772) the Hoare annotation is: (let ((.cse2 (+ ~SKIP2~0 3))) (let ((.cse15 (= ~s~0 ~DC~0)) (.cse1 (not (= ~pended~0 1))) (.cse13 (<= .cse2 ~IPC~0)) (.cse4 (= ~routine~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~compRegistered~0 0))) (let ((.cse0 (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~6#1|)) (.cse5 (< |ULTIMATE.start_main_~status~6#1| (+ ~lowerDriverReturn~0 1))) (.cse14 (= ~SKIP2~0 ~s~0)) (.cse9 (not (= |ULTIMATE.start_main_~status~6#1| 259))) (.cse10 (or (and (= ~compRegistered~0 1) .cse15 .cse1 .cse13 .cse4 .cse6) (and .cse15 .cse1 .cse13 .cse4 .cse6 .cse7))) (.cse3 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse11 (not (= |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1| 259))) (.cse12 (not (= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| 259))) (.cse8 (<= (+ 2 ~DC~0) ~SKIP2~0))) (or (and .cse0 .cse1 (<= .cse2 ~s~0) .cse3 .cse4 .cse5 .cse6 (= ~IPC~0 ~s~0) .cse7 .cse8) (and .cse9 .cse10 .cse3 (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) .cse11 .cse12 .cse8) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_PoCallDriver_~returnVal~0#1| ~lowerDriverReturn~0) .cse6 .cse7 .cse8 .cse14 (<= ~lowerDriverReturn~0 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|)) (and .cse0 (<= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDispatchPnp_#res#1|) .cse1 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| ~lowerDriverReturn~0) .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14) (and .cse10 .cse3 (<= (+ |ULTIMATE.start_main_~status~6#1| 1073741789) 0) (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) 0) .cse8) (and .cse9 .cse10 .cse3 .cse11 (not (= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 259)) .cse12 .cse8) (and .cse15 (= |ULTIMATE.start_main_~status~6#1| 0) .cse1 .cse4))))) [2021-11-13 01:32:49,845 INFO L854 garLoopResultBuilder]: At program point L727(lines 727 762) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,845 INFO L854 garLoopResultBuilder]: At program point L397(line 397) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,845 INFO L858 garLoopResultBuilder]: For program point L397-1(line 397) no Hoare annotation was computed. [2021-11-13 01:32:49,845 INFO L854 garLoopResultBuilder]: At program point L133(lines 96 135) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (= ~s~0 ~DC~0)) (.cse7 (not (= |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1| 259))) (.cse8 (not (= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| 259))) (.cse2 (not (= ~pended~0 1))) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse5 (= ~routine~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (<= (+ 2 ~DC~0) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 259)) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 259 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|)) .cse7 .cse8 .cse9) (and (<= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDispatchPnp_#res#1|) .cse2 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| ~lowerDriverReturn~0) .cse3 .cse4 .cse5 .cse6 (= ~compRegistered~0 0) .cse9 (= ~SKIP2~0 ~s~0)))) [2021-11-13 01:32:49,845 INFO L858 garLoopResultBuilder]: For program point L1025(lines 1025 1045) no Hoare annotation was computed. [2021-11-13 01:32:49,846 INFO L854 garLoopResultBuilder]: At program point L1025-1(lines 1025 1045) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0)) [2021-11-13 01:32:49,846 INFO L854 garLoopResultBuilder]: At program point L431(lines 354 435) the Hoare annotation is: (let ((.cse8 (+ ~SKIP2~0 3))) (let ((.cse0 (= ~s~0 ~DC~0)) (.cse2 (<= .cse8 ~IPC~0)) (.cse1 (not (= ~pended~0 1))) (.cse3 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse4 (= ~routine~0 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~compRegistered~0 0)) (.cse7 (<= (+ 2 ~DC~0) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_DiskPerfDeviceControl_~status~4#1| 0) (= |ULTIMATE.start_DiskPerfDeviceControl_#res#1| 0) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) 0) .cse6 .cse7) (and (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) .cse1 (<= .cse8 ~s~0) .cse3 .cse4 .cse5 (= ~IPC~0 ~s~0) .cse6 .cse7)))) [2021-11-13 01:32:49,846 INFO L854 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2021-11-13 01:32:49,846 INFO L858 garLoopResultBuilder]: For program point L200-1(lines 196 202) no Hoare annotation was computed. [2021-11-13 01:32:49,846 INFO L858 garLoopResultBuilder]: For program point L1026(lines 1026 1036) no Hoare annotation was computed. [2021-11-13 01:32:49,846 INFO L858 garLoopResultBuilder]: For program point L882(lines 882 890) no Hoare annotation was computed. [2021-11-13 01:32:49,847 INFO L858 garLoopResultBuilder]: For program point L882-2(lines 882 890) no Hoare annotation was computed. [2021-11-13 01:32:49,847 INFO L854 garLoopResultBuilder]: At program point L944(line 944) the Hoare annotation is: (let ((.cse8 (+ 2 ~NP~0))) (let ((.cse0 (not (<= .cse8 ~SKIP1~0))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse7 (not (= ~compRegistered~0 0))) (.cse3 (= |old(~pended~0)| 1)) (.cse5 (not (= ~routine~0 0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse6 (not (= ~compRegistered~0 1))) (or .cse0 .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (or (not (<= .cse8 |old(~s~0)|)) .cse1 .cse7 .cse3 (not (<= (+ 2 |old(~s~0)|) ~MPR1~0)) .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6)))) [2021-11-13 01:32:49,847 INFO L858 garLoopResultBuilder]: For program point L944-1(lines 926 948) no Hoare annotation was computed. [2021-11-13 01:32:49,847 INFO L854 garLoopResultBuilder]: At program point L895(line 895) the Hoare annotation is: (let ((.cse10 (+ 2 ~NP~0))) (let ((.cse0 (not (<= .cse10 ~SKIP1~0))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse9 (not (= ~compRegistered~0 0))) (.cse3 (= |old(~pended~0)| 1)) (.cse7 (not (= ~routine~0 0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (let ((.cse5 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse4 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (<= ~s~0 ~NP~0) (= ~setEventCalled~0 1) (<= .cse4 0) (not (= ~pended~0 1)) (<= 0 .cse5) (<= ~NP~0 ~s~0) (<= .cse5 0) (<= 0 .cse4))) .cse6 .cse7 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse8 (not (= ~compRegistered~0 1))) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse6 .cse7 .cse8) (or (not (<= .cse10 |old(~s~0)|)) .cse1 .cse9 .cse3 (not (<= (+ 2 |old(~s~0)|) ~MPR1~0)) .cse7 (not (= ~SKIP1~0 |old(~s~0)|)) .cse8)))) [2021-11-13 01:32:49,848 INFO L854 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 873 951) the Hoare annotation is: (let ((.cse10 (not (= ~pended~0 1))) (.cse9 (+ 2 ~NP~0))) (let ((.cse0 (not (<= .cse9 ~SKIP1~0))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse4 (and .cse10 (= ~s~0 ~NP~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse3 (= |old(~pended~0)| 1)) (.cse6 (not (= ~routine~0 0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse7 (not (= ~compRegistered~0 1))) (or .cse0 .cse1 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6 .cse7) (or (not (<= .cse9 |old(~s~0)|)) .cse1 .cse8 .cse3 (not (<= (+ 2 |old(~s~0)|) ~MPR1~0)) (and .cse10 (= ~SKIP1~0 ~s~0)) .cse6 (not (= ~SKIP1~0 |old(~s~0)|)) .cse7)))) [2021-11-13 01:32:49,848 INFO L854 garLoopResultBuilder]: At program point L888(line 888) the Hoare annotation is: (let ((.cse8 (+ 2 ~NP~0))) (let ((.cse0 (not (<= .cse8 ~SKIP1~0))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse7 (not (= ~compRegistered~0 0))) (.cse3 (= |old(~pended~0)| 1)) (.cse5 (not (= ~routine~0 0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse6 (not (= ~compRegistered~0 1))) (or .cse0 .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (or (not (<= .cse8 |old(~s~0)|)) .cse1 .cse7 .cse3 (not (<= (+ 2 |old(~s~0)|) ~MPR1~0)) .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6)))) [2021-11-13 01:32:49,848 INFO L858 garLoopResultBuilder]: For program point L888-1(line 888) no Hoare annotation was computed. [2021-11-13 01:32:49,848 INFO L858 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 873 951) no Hoare annotation was computed. [2021-11-13 01:32:49,848 INFO L854 garLoopResultBuilder]: At program point L884(line 884) the Hoare annotation is: (let ((.cse8 (+ 2 ~NP~0))) (let ((.cse0 (not (<= .cse8 ~SKIP1~0))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse7 (not (= ~compRegistered~0 0))) (.cse3 (= |old(~pended~0)| 1)) (.cse5 (not (= ~routine~0 0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and (not (= ~pended~0 1)) (= ~s~0 ~NP~0)) .cse4 .cse5 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse6 (not (= ~compRegistered~0 1))) (or .cse0 .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (or (not (<= .cse8 |old(~s~0)|)) .cse1 .cse7 .cse3 (not (<= (+ 2 |old(~s~0)|) ~MPR1~0)) .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6)))) [2021-11-13 01:32:49,849 INFO L858 garLoopResultBuilder]: For program point L884-1(line 884) no Hoare annotation was computed. [2021-11-13 01:32:49,850 INFO L858 garLoopResultBuilder]: For program point L930(lines 930 947) no Hoare annotation was computed. [2021-11-13 01:32:49,850 INFO L858 garLoopResultBuilder]: For program point L893(lines 893 897) no Hoare annotation was computed. [2021-11-13 01:32:49,850 INFO L854 garLoopResultBuilder]: At program point L922(lines 880 950) the Hoare annotation is: (let ((.cse11 (+ 2 ~NP~0))) (let ((.cse0 (not (<= .cse11 ~SKIP1~0))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (= |old(~pended~0)| 1)) (.cse5 (not (= ~pended~0 1))) (.cse7 (not (= ~routine~0 0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 (= ~s~0 ~NP~0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 (let ((.cse10 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse9 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~setEventCalled~0 1) (<= .cse9 0) .cse5 (<= 0 .cse10) (<= .cse10 0) (<= 0 .cse9) (= ~MPR1~0 ~s~0))) .cse2 .cse4 .cse6 .cse7 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse8 (not (= ~compRegistered~0 1))) (or (not (<= .cse11 |old(~s~0)|)) .cse1 .cse3 .cse4 (not (<= (+ 2 |old(~s~0)|) ~MPR1~0)) (and .cse5 (= ~SKIP1~0 ~s~0)) .cse7 (not (= ~SKIP1~0 |old(~s~0)|)) .cse8)))) [2021-11-13 01:32:49,850 INFO L858 garLoopResultBuilder]: For program point L881(lines 881 899) no Hoare annotation was computed. [2021-11-13 01:32:49,851 INFO L854 garLoopResultBuilder]: At program point L881-1(lines 881 899) the Hoare annotation is: (let ((.cse11 (+ 2 ~NP~0))) (let ((.cse0 (not (<= .cse11 ~SKIP1~0))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (= |old(~pended~0)| 1)) (.cse5 (not (= ~pended~0 1))) (.cse7 (not (= ~routine~0 0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 (= ~s~0 ~NP~0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 (let ((.cse10 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse9 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~setEventCalled~0 1) (<= .cse9 0) .cse5 (<= 0 .cse10) (<= .cse10 0) (<= 0 .cse9) (= ~MPR1~0 ~s~0))) .cse2 .cse4 .cse6 .cse7 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse8 (not (= ~compRegistered~0 1))) (or (not (<= .cse11 |old(~s~0)|)) .cse1 .cse3 .cse4 (not (<= (+ 2 |old(~s~0)|) ~MPR1~0)) (and .cse5 (= ~SKIP1~0 ~s~0)) .cse7 (not (= ~SKIP1~0 |old(~s~0)|)) .cse8)))) [2021-11-13 01:32:49,851 INFO L858 garLoopResultBuilder]: For program point L939(lines 939 946) no Hoare annotation was computed. [2021-11-13 01:32:49,851 INFO L858 garLoopResultBuilder]: For program point DiskPerfIrpCompletionEXIT(lines 136 146) no Hoare annotation was computed. [2021-11-13 01:32:49,851 INFO L861 garLoopResultBuilder]: At program point DiskPerfIrpCompletionENTRY(lines 136 146) the Hoare annotation is: true [2021-11-13 01:32:49,851 INFO L854 garLoopResultBuilder]: At program point stubMoreProcessingRequiredENTRY(lines 859 872) the Hoare annotation is: (or (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (not (<= (+ 2 ~DC~0) ~SKIP2~0)) (= ~pended~0 1) (not (<= ~NP~0 |old(~s~0)|)) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~routine~0 0)) (not (= ~setEventCalled~0 1)) (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (= ~s~0 |old(~s~0)|) (not (= ~compRegistered~0 1))) [2021-11-13 01:32:49,851 INFO L858 garLoopResultBuilder]: For program point stubMoreProcessingRequiredEXIT(lines 859 872) no Hoare annotation was computed. [2021-11-13 01:32:49,852 INFO L854 garLoopResultBuilder]: At program point L867(line 867) the Hoare annotation is: (or (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (not (<= (+ 2 ~DC~0) ~SKIP2~0)) (= ~pended~0 1) (not (<= ~NP~0 |old(~s~0)|)) (not (<= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~routine~0 0)) (not (= ~setEventCalled~0 1)) (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 1))) [2021-11-13 01:32:49,852 INFO L858 garLoopResultBuilder]: For program point L867-1(lines 859 872) no Hoare annotation was computed. [2021-11-13 01:32:49,852 INFO L858 garLoopResultBuilder]: For program point L318(lines 318 320) no Hoare annotation was computed. [2021-11-13 01:32:49,852 INFO L858 garLoopResultBuilder]: For program point L341(lines 341 350) no Hoare annotation was computed. [2021-11-13 01:32:49,852 INFO L858 garLoopResultBuilder]: For program point DiskPerfIoCompletionFINAL(lines 300 353) no Hoare annotation was computed. [2021-11-13 01:32:49,852 INFO L861 garLoopResultBuilder]: At program point L346(line 346) the Hoare annotation is: true [2021-11-13 01:32:49,852 INFO L858 garLoopResultBuilder]: For program point L342(lines 342 348) no Hoare annotation was computed. [2021-11-13 01:32:49,853 INFO L858 garLoopResultBuilder]: For program point DiskPerfIoCompletionEXIT(lines 300 353) no Hoare annotation was computed. [2021-11-13 01:32:49,853 INFO L858 garLoopResultBuilder]: For program point L336-1(lines 317 352) no Hoare annotation was computed. [2021-11-13 01:32:49,853 INFO L861 garLoopResultBuilder]: At program point DiskPerfIoCompletionENTRY(lines 300 353) the Hoare annotation is: true [2021-11-13 01:32:49,858 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, 1, 1] [2021-11-13 01:32:49,860 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-13 01:32:49,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:32:49 BoogieIcfgContainer [2021-11-13 01:32:49,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-13 01:32:49,948 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-13 01:32:49,948 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-13 01:32:49,948 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-13 01:32:49,949 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:31:42" (3/4) ... [2021-11-13 01:32:49,952 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-13 01:32:49,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2021-11-13 01:32:49,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2021-11-13 01:32:49,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2021-11-13 01:32:49,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2021-11-13 01:32:49,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2021-11-13 01:32:49,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2021-11-13 01:32:49,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2021-11-13 01:32:49,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2021-11-13 01:32:49,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2021-11-13 01:32:49,980 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 90 nodes and edges [2021-11-13 01:32:49,983 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2021-11-13 01:32:49,985 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-13 01:32:49,987 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-13 01:32:50,014 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && IPC == s) && compRegistered == 0) && 2 + DC <= SKIP2) || ((((((!(status == 259) && ((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0))) && 2 + NP <= SKIP1) && !(259 == status)) && !(status == 259)) && !(\result == 259)) && 2 + DC <= SKIP2)) || (((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && lowerDriverReturn <= returnVal)) || (((((((((((lowerDriverReturn <= status && lowerDriverReturn <= \result) && !(pended == 1)) && \result <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s)) || ((((((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0)) && 2 + NP <= SKIP1) && status + 1073741789 <= 0) && 1073741789 + \result <= 0) && 2 + DC <= SKIP2)) || ((((((!(status == 259) && ((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0))) && 2 + NP <= SKIP1) && !(status == 259)) && !(status == 259)) && !(\result == 259)) && 2 + DC <= SKIP2)) || s == UNLOADED) || (((s == DC && status == 0) && !(pended == 1)) && routine == 0) [2021-11-13 01:32:50,015 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && IPC == s) && compRegistered == 0) && 2 + DC <= SKIP2) || ((((((!(status == 259) && ((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0))) && 2 + NP <= SKIP1) && !(259 == status)) && !(status == 259)) && !(\result == 259)) && 2 + DC <= SKIP2)) || (((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && lowerDriverReturn <= returnVal)) || (((((((((((lowerDriverReturn <= status && lowerDriverReturn <= \result) && !(pended == 1)) && \result <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s)) || ((((((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0)) && 2 + NP <= SKIP1) && status + 1073741789 <= 0) && 1073741789 + \result <= 0) && 2 + DC <= SKIP2)) || ((((((!(status == 259) && ((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0))) && 2 + NP <= SKIP1) && !(status == 259)) && !(status == 259)) && !(\result == 259)) && 2 + DC <= SKIP2)) || s == UNLOADED) || (((s == DC && status == 0) && !(pended == 1)) && routine == 0) [2021-11-13 01:32:50,015 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((s <= DC && ((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && lowerDriverReturn <= returnVal) || (((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0)) && 2 + NP <= SKIP1))) && 2 + DC <= SKIP2) || ((((((((lowerDriverReturn == \result && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && status == lowerDriverReturn)) && status + 1073741789 <= 0) && 1073741789 + \result <= 0) || (((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && 2 + DC <= s) && compRegistered == 0) && 2 + DC <= SKIP2)) || ((((!(status == 259) && (((s <= DC && ((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && lowerDriverReturn <= returnVal) || (((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0)) && 2 + NP <= SKIP1))) && 2 + DC <= SKIP2) || ((((((((lowerDriverReturn == \result && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && status == lowerDriverReturn))) && !(status == 259)) && !(status == 259)) && !(\result == 259))) || ((((!(status == 259) && (((s <= DC && ((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && lowerDriverReturn <= returnVal) || (((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0)) && 2 + NP <= SKIP1))) && 2 + DC <= SKIP2) || ((((((((lowerDriverReturn == \result && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && status == lowerDriverReturn))) && !(259 == status)) && !(status == 259)) && !(\result == 259))) || (((s == DC && status == 0) && !(pended == 1)) && routine == 0)) || ((((((s <= DC && ((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && lowerDriverReturn <= returnVal) || (((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0)) && 2 + NP <= SKIP1))) && 2 + DC <= SKIP2) || ((((((((lowerDriverReturn == \result && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && status == lowerDriverReturn)) && status == 0) && status == 0) && \result == 0) [2021-11-13 01:32:50,016 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(2 + NP <= SKIP1) || !(2 + DC <= SKIP2)) || pended == 1) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || (\old(customIrp) == customIrp && s == NP)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) && (((((((((((!(2 + NP <= SKIP1) || !(2 + DC <= SKIP2)) || !(\old(customIrp) == 1)) || (setEventCalled == 1 && s == NP)) || pended == 1) || (s == NP && customIrp == 1)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) [2021-11-13 01:32:50,017 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(2 + NP <= SKIP1) || !(2 + DC <= SKIP2)) || !(NP == \old(s))) || !(compRegistered == 0)) || \old(pended) == 1) || (!(pended == 1) && s == NP)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(SKIP2 + 3 <= IPC)) && (((((((((!(2 + NP <= SKIP1) || !(2 + DC <= SKIP2)) || ((((((setEventCalled == 1 && compRetStatus + 1073741802 <= 0) && !(pended == 1)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s)) || !(NP == \old(s))) || \old(pended) == 1) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1))) && ((((((((!(2 + NP <= \old(s)) || !(2 + DC <= SKIP2)) || !(compRegistered == 0)) || \old(pended) == 1) || !(2 + \old(s) <= MPR1)) || (!(pended == 1) && SKIP1 == s)) || !(routine == 0)) || !(SKIP1 == \old(s))) || !(SKIP2 + 3 <= IPC)) [2021-11-13 01:32:50,017 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && status == 0) && \result == 0) && compRegistered == 0) && 2 + DC <= SKIP2) || ((((((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && 1073741789 + \result <= 0) && compRegistered == 0) && 2 + DC <= SKIP2)) || ((((((((lowerDriverReturn == \result && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && IPC == s) && compRegistered == 0) && 2 + DC <= SKIP2) [2021-11-13 01:32:50,018 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && IPC == s) && compRegistered == 0) && 2 + DC <= SKIP2) || ((((((!(status == 259) && ((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0))) && 2 + NP <= SKIP1) && !(259 == status)) && !(status == 259)) && !(\result == 259)) && 2 + DC <= SKIP2)) || (((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && lowerDriverReturn <= returnVal)) || (((((((((((lowerDriverReturn <= status && lowerDriverReturn <= \result) && !(pended == 1)) && \result <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s)) || ((((((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0)) && 2 + NP <= SKIP1) && status + 1073741789 <= 0) && 1073741789 + \result <= 0) && 2 + DC <= SKIP2)) || ((((((!(status == 259) && ((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0))) && 2 + NP <= SKIP1) && !(status == 259)) && !(status == 259)) && !(\result == 259)) && 2 + DC <= SKIP2)) || (((s == DC && status == 0) && !(pended == 1)) && routine == 0) [2021-11-13 01:32:50,019 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && !(status == 259)) && !(status == 259)) && !(\result == 259)) && 2 + DC <= SKIP2) || ((((((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && !(259 == status)) && !(status == 259)) && !(\result == 259)) && 2 + DC <= SKIP2)) || (((((((((lowerDriverReturn <= \result && !(pended == 1)) && \result <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) [2021-11-13 01:32:50,020 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(2 + NP <= SKIP1) || !(2 + DC <= SKIP2)) || !(NP == \old(s))) || !(compRegistered == 0)) || \old(pended) == 1) || (!(pended == 1) && s == NP)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(SKIP2 + 3 <= IPC)) && (((((((((!(2 + NP <= SKIP1) || !(2 + DC <= SKIP2)) || ((((((setEventCalled == 1 && compRetStatus + 1073741802 <= 0) && !(pended == 1)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s)) || !(NP == \old(s))) || \old(pended) == 1) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1))) && ((((((((!(2 + NP <= \old(s)) || !(2 + DC <= SKIP2)) || !(compRegistered == 0)) || \old(pended) == 1) || !(2 + \old(s) <= MPR1)) || (!(pended == 1) && SKIP1 == s)) || !(routine == 0)) || !(SKIP1 == \old(s))) || !(SKIP2 + 3 <= IPC)) [2021-11-13 01:32:50,020 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(2 + NP <= SKIP1) || !(2 + DC <= SKIP2)) || pended == 1) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) && ((((((((((!(2 + NP <= SKIP1) || !(2 + DC <= SKIP2)) || !(\old(customIrp) == 1)) || pended == 1) || ((setEventCalled == 1 && customIrp == 1) && s == \old(s))) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) [2021-11-13 01:32:50,022 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(2 + NP <= SKIP1) || !(2 + DC <= SKIP2)) || \old(customIrp) == customIrp) || pended == 1) || !(SKIP1 + 2 <= MPR1)) || !(s <= NP)) || !(routine == 0)) || !(NP <= s)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1) [2021-11-13 01:32:50,123 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/witness.graphml [2021-11-13 01:32:50,123 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-13 01:32:50,124 INFO L158 Benchmark]: Toolchain (without parser) took 70066.28ms. Allocated memory was 79.7MB in the beginning and 413.1MB in the end (delta: 333.4MB). Free memory was 42.5MB in the beginning and 269.4MB in the end (delta: -226.9MB). Peak memory consumption was 105.6MB. Max. memory is 16.1GB. [2021-11-13 01:32:50,124 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 79.7MB. Free memory was 59.8MB in the beginning and 59.8MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 01:32:50,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 597.53ms. Allocated memory was 79.7MB in the beginning and 107.0MB in the end (delta: 27.3MB). Free memory was 42.3MB in the beginning and 74.0MB in the end (delta: -31.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-13 01:32:50,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 135.50ms. Allocated memory is still 107.0MB. Free memory was 74.0MB in the beginning and 69.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-13 01:32:50,125 INFO L158 Benchmark]: Boogie Preprocessor took 59.59ms. Allocated memory is still 107.0MB. Free memory was 69.4MB in the beginning and 66.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 01:32:50,125 INFO L158 Benchmark]: RCFGBuilder took 1181.27ms. Allocated memory is still 107.0MB. Free memory was 66.3MB in the beginning and 51.7MB in the end (delta: 14.6MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2021-11-13 01:32:50,125 INFO L158 Benchmark]: TraceAbstraction took 67895.85ms. Allocated memory was 107.0MB in the beginning and 413.1MB in the end (delta: 306.2MB). Free memory was 51.2MB in the beginning and 290.4MB in the end (delta: -239.1MB). Peak memory consumption was 224.2MB. Max. memory is 16.1GB. [2021-11-13 01:32:50,126 INFO L158 Benchmark]: Witness Printer took 175.43ms. Allocated memory is still 413.1MB. Free memory was 290.4MB in the beginning and 269.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-13 01:32:50,127 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.28ms. Allocated memory is still 79.7MB. Free memory was 59.8MB in the beginning and 59.8MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 597.53ms. Allocated memory was 79.7MB in the beginning and 107.0MB in the end (delta: 27.3MB). Free memory was 42.3MB in the beginning and 74.0MB in the end (delta: -31.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 135.50ms. Allocated memory is still 107.0MB. Free memory was 74.0MB in the beginning and 69.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.59ms. Allocated memory is still 107.0MB. Free memory was 69.4MB in the beginning and 66.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1181.27ms. Allocated memory is still 107.0MB. Free memory was 66.3MB in the beginning and 51.7MB in the end (delta: 14.6MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * TraceAbstraction took 67895.85ms. Allocated memory was 107.0MB in the beginning and 413.1MB in the end (delta: 306.2MB). Free memory was 51.2MB in the beginning and 290.4MB in the end (delta: -239.1MB). Peak memory consumption was 224.2MB. Max. memory is 16.1GB. * Witness Printer took 175.43ms. Allocated memory is still 413.1MB. Free memory was 290.4MB in the beginning and 269.4MB 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: 56]: 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 10 procedures, 189 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.7s, OverallIterations: 43, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 51.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6024 SdHoareTripleChecker+Valid, 6594.34ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5937 mSDsluCounter, 22095 SdHoareTripleChecker+Invalid, 5442.39ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16364 mSDsCounter, 1126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7641 IncrementalHoareTripleChecker+Invalid, 8767 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1126 mSolverCounterUnsat, 7536 mSDtfsCounter, 7641 mSolverCounterSat, 164.31ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 365 SyntacticMatches, 2 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=647occurred in iteration=6, InterpolantAutomatonStates: 241, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 43 MinimizatonAttempts, 975 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 87 LocationsWithAnnotation, 1518 PreInvPairs, 1677 NumberOfFragments, 6465 HoareAnnotationTreeSize, 1518 FomulaSimplifications, 2978 FormulaSimplificationTreeSizeReduction, 42.0s HoareSimplificationTime, 87 FomulaSimplificationsInter, 2736743 FormulaSimplificationTreeSizeReductionInter, 9.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1991 NumberOfCodeBlocks, 1991 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2072 ConstructedInterpolants, 0 QuantifiedInterpolants, 4612 SizeOfPredicates, 6 NumberOfNonLiveVariables, 947 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 45 InterpolantComputations, 44 PerfectInterpolantSequences, 678/682 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: 1072]: Loop Invariant Derived loop invariant: ((((((((!(pended == 1) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && lowerDriverReturn <= returnVal - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: ((((((((lowerDriverReturn <= aux-IofCallDriver(deviceExtension__TargetDeviceObject, Irp)-aux && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && aux-IofCallDriver(deviceExtension__TargetDeviceObject, Irp)-aux <= lowerDriverReturn) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s - InvariantResult [Line: 773]: Loop Invariant Derived loop invariant: (((((((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && IPC == s) && compRegistered == 0) && 2 + DC <= SKIP2) || ((((((!(status == 259) && ((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0))) && 2 + NP <= SKIP1) && !(259 == status)) && !(status == 259)) && !(\result == 259)) && 2 + DC <= SKIP2)) || (((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && lowerDriverReturn <= returnVal)) || (((((((((((lowerDriverReturn <= status && lowerDriverReturn <= \result) && !(pended == 1)) && \result <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s)) || ((((((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0)) && 2 + NP <= SKIP1) && status + 1073741789 <= 0) && 1073741789 + \result <= 0) && 2 + DC <= SKIP2)) || ((((((!(status == 259) && ((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0))) && 2 + NP <= SKIP1) && !(status == 259)) && !(status == 259)) && !(\result == 259)) && 2 + DC <= SKIP2)) || s == UNLOADED) || (((s == DC && status == 0) && !(pended == 1)) && routine == 0) - InvariantResult [Line: 707]: Loop Invariant Derived loop invariant: (((((((!(pended == 1) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0) && 2 + DC <= SKIP2 - InvariantResult [Line: 791]: Loop Invariant Derived loop invariant: (((((((((s <= DC && ((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && lowerDriverReturn <= returnVal) || (((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0)) && 2 + NP <= SKIP1))) && 2 + DC <= SKIP2) || ((((((((lowerDriverReturn == \result && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && status == lowerDriverReturn)) && status + 1073741789 <= 0) && 1073741789 + \result <= 0) || (((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && 2 + DC <= s) && compRegistered == 0) && 2 + DC <= SKIP2)) || ((((!(status == 259) && (((s <= DC && ((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && lowerDriverReturn <= returnVal) || (((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0)) && 2 + NP <= SKIP1))) && 2 + DC <= SKIP2) || ((((((((lowerDriverReturn == \result && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && status == lowerDriverReturn))) && !(status == 259)) && !(status == 259)) && !(\result == 259))) || ((((!(status == 259) && (((s <= DC && ((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && lowerDriverReturn <= returnVal) || (((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0)) && 2 + NP <= SKIP1))) && 2 + DC <= SKIP2) || ((((((((lowerDriverReturn == \result && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && status == lowerDriverReturn))) && !(259 == status)) && !(status == 259)) && !(\result == 259))) || (((s == DC && status == 0) && !(pended == 1)) && routine == 0)) || ((((((s <= DC && ((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && lowerDriverReturn <= returnVal) || (((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0)) && 2 + NP <= SKIP1))) && 2 + DC <= SKIP2) || ((((((((lowerDriverReturn == \result && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && status == lowerDriverReturn)) && status == 0) && status == 0) && \result == 0) - InvariantResult [Line: 979]: Loop Invariant Derived loop invariant: ((((((((((!(2 + NP <= SKIP1) || !(2 + DC <= SKIP2)) || pended == 1) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || (\old(customIrp) == customIrp && s == NP)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) && (((((((((((!(2 + NP <= SKIP1) || !(2 + DC <= SKIP2)) || !(\old(customIrp) == 1)) || (setEventCalled == 1 && s == NP)) || pended == 1) || (s == NP && customIrp == 1)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && !(status == 259)) && !(status == 259)) && !(\result == 259)) && 2 + DC <= SKIP2) || ((((((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && !(259 == status)) && !(status == 259)) && !(\result == 259)) && 2 + DC <= SKIP2)) || (((((((((lowerDriverReturn <= \result && !(pended == 1)) && \result <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) - InvariantResult [Line: 683]: Loop Invariant Derived loop invariant: ((((((((((s <= DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && s == UNLOADED) && 2 + s <= MPR1) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0) && 2 + DC <= SKIP2) && !(MPR3 == s) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && !(status == 259)) && !(status == 259)) && 2 + DC <= SKIP2) || (((((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && !(259 == status)) && !(status == 259)) && 2 + DC <= SKIP2) - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((((((((!(2 + NP <= SKIP1) || !(2 + DC <= SKIP2)) || !(NP == \old(s))) || !(compRegistered == 0)) || \old(pended) == 1) || (!(pended == 1) && s == NP)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(SKIP2 + 3 <= IPC)) && (((((((((!(2 + NP <= SKIP1) || !(2 + DC <= SKIP2)) || ((((((setEventCalled == 1 && compRetStatus + 1073741802 <= 0) && !(pended == 1)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s)) || !(NP == \old(s))) || \old(pended) == 1) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1))) && ((((((((!(2 + NP <= \old(s)) || !(2 + DC <= SKIP2)) || !(compRegistered == 0)) || \old(pended) == 1) || !(2 + \old(s) <= MPR1)) || (!(pended == 1) && SKIP1 == s)) || !(routine == 0)) || !(SKIP1 == \old(s))) || !(SKIP2 + 3 <= IPC)) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && !(259 == status)) && 2 + DC <= SKIP2 - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: (((((((compRegistered == 1 && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && !(259 == status)) && 2 + DC <= SKIP2 - InvariantResult [Line: 727]: Loop Invariant Derived loop invariant: ((((((!(pended == 1) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((!(aux-DiskPerfForwardIrpSynchronous(DeviceObject, Irp)-aux == 259) && compRegistered == 1) && s <= NP) && setEventCalled == 1) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP <= s) && (myStatus == 0 || myStatus + 1073741637 == 0)) && 2 + DC <= SKIP2) || (((((((((compRegistered == 1 && aux-DiskPerfForwardIrpSynchronous(DeviceObject, Irp)-aux <= 258) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && (myStatus == 0 || myStatus + 1073741637 == 0)) && 2 + DC <= SKIP2) - InvariantResult [Line: 979]: Loop Invariant Derived loop invariant: (((((((((!(2 + NP <= SKIP1) || !(2 + DC <= SKIP2)) || pended == 1) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) && ((((((((((!(2 + NP <= SKIP1) || !(2 + DC <= SKIP2)) || !(\old(customIrp) == 1)) || pended == 1) || ((setEventCalled == 1 && customIrp == 1) && s == \old(s))) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) - InvariantResult [Line: 1024]: Loop Invariant Derived loop invariant: ((((((!(pended == 1) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && 2 + s <= MPR1) && SKIP1 == s) && compRegistered == 0) && 2 + DC <= SKIP2 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((((!(pended == 1) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0) && 2 + DC <= SKIP2 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 717]: Loop Invariant Derived loop invariant: (((((((!(pended == 1) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0) && 2 + DC <= SKIP2 - InvariantResult [Line: 683]: Loop Invariant Derived loop invariant: ((((((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && IPC == s) && compRegistered == 0) && 2 + DC <= SKIP2) || ((((((!(status == 259) && ((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0))) && 2 + NP <= SKIP1) && !(259 == status)) && !(status == 259)) && !(\result == 259)) && 2 + DC <= SKIP2)) || (((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && lowerDriverReturn <= returnVal)) || (((((((((((lowerDriverReturn <= status && lowerDriverReturn <= \result) && !(pended == 1)) && \result <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s)) || ((((((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0)) && 2 + NP <= SKIP1) && status + 1073741789 <= 0) && 1073741789 + \result <= 0) && 2 + DC <= SKIP2)) || ((((((!(status == 259) && ((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0))) && 2 + NP <= SKIP1) && !(status == 259)) && !(status == 259)) && !(\result == 259)) && 2 + DC <= SKIP2)) || (((s == DC && status == 0) && !(pended == 1)) && routine == 0) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((((!(pended == 1) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0) && 2 + DC <= SKIP2 - InvariantResult [Line: 647]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((!(pended == 1) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2 - InvariantResult [Line: 1025]: Loop Invariant Derived loop invariant: ((((((!(pended == 1) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && 2 + s <= MPR1) && SKIP1 == s) && compRegistered == 0) && 2 + DC <= SKIP2 - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: ((((((((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && status == 0) && \result == 0) && compRegistered == 0) && 2 + DC <= SKIP2) || ((((((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && 1073741789 + \result <= 0) && compRegistered == 0) && 2 + DC <= SKIP2)) || ((((((((lowerDriverReturn == \result && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && IPC == s) && compRegistered == 0) && 2 + DC <= SKIP2) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((((((!(pended == 1) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2 - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: ((((((((aux-IofCallDriver(deviceExtension__TargetDeviceObject, Irp)-aux <= lowerDriverReturn && !(pended == 1)) && SKIP2 + 3 <= s) && lowerDriverReturn <= aux-IofCallDriver(deviceExtension__TargetDeviceObject, Irp)-aux) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && IPC == s) && compRegistered == 0) && 2 + DC <= SKIP2 - InvariantResult [Line: 722]: Loop Invariant Derived loop invariant: ((((((!(pended == 1) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2 - InvariantResult [Line: 834]: Loop Invariant Derived loop invariant: (((((((((!(2 + NP <= SKIP1) || !(2 + DC <= SKIP2)) || \old(customIrp) == customIrp) || pended == 1) || !(SKIP1 + 2 <= MPR1)) || !(s <= NP)) || !(routine == 0)) || !(NP <= s)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1) - InvariantResult [Line: 712]: Loop Invariant Derived loop invariant: (((((((!(pended == 1) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0) && 2 + DC <= SKIP2 - InvariantResult [Line: 781]: Loop Invariant Derived loop invariant: (((((((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && IPC == s) && compRegistered == 0) && 2 + DC <= SKIP2) || ((((((!(status == 259) && ((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0))) && 2 + NP <= SKIP1) && !(259 == status)) && !(status == 259)) && !(\result == 259)) && 2 + DC <= SKIP2)) || (((((((((((lowerDriverReturn <= status && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && lowerDriverReturn <= returnVal)) || (((((((((((lowerDriverReturn <= status && lowerDriverReturn <= \result) && !(pended == 1)) && \result <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s)) || ((((((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0)) && 2 + NP <= SKIP1) && status + 1073741789 <= 0) && 1073741789 + \result <= 0) && 2 + DC <= SKIP2)) || ((((((!(status == 259) && ((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) || (((((s == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && compRegistered == 0))) && 2 + NP <= SKIP1) && !(status == 259)) && !(status == 259)) && !(\result == 259)) && 2 + DC <= SKIP2)) || s == UNLOADED) || (((s == DC && status == 0) && !(pended == 1)) && routine == 0) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: (((((((compRegistered == 1 && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && !(259 == status)) && 2 + DC <= SKIP2 - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: (((((((compRegistered == 1 && s == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && !(status == 259)) && 2 + DC <= SKIP2 - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((s == DC && !(pended == 1)) && routine == 0) && compRegistered == 0 - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: (((((((((!(2 + NP <= SKIP1) || !(2 + DC <= SKIP2)) || !(NP == \old(s))) || !(compRegistered == 0)) || \old(pended) == 1) || (!(pended == 1) && s == NP)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(SKIP2 + 3 <= IPC)) && (((((((((!(2 + NP <= SKIP1) || !(2 + DC <= SKIP2)) || ((((((setEventCalled == 1 && compRetStatus + 1073741802 <= 0) && !(pended == 1)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s)) || !(NP == \old(s))) || \old(pended) == 1) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1))) && ((((((((!(2 + NP <= \old(s)) || !(2 + DC <= SKIP2)) || !(compRegistered == 0)) || \old(pended) == 1) || !(2 + \old(s) <= MPR1)) || (!(pended == 1) && SKIP1 == s)) || !(routine == 0)) || !(SKIP1 == \old(s))) || !(SKIP2 + 3 <= IPC)) RESULT: Ultimate proved your program to be correct! [2021-11-13 01:32:50,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb0720b3-0dd5-4cc2-8fbc-5db155274e94/bin/utaipan-vmNK8stdcF/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