./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 64bit --witnessprinter.graph.data.programhash 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 12:22:07,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 12:22:07,136 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-64bit-Taipan_Default.epf [2023-12-02 12:22:07,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 12:22:07,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 12:22:07,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 12:22:07,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 12:22:07,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 12:22:07,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 12:22:07,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 12:22:07,172 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 12:22:07,172 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 12:22:07,173 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 12:22:07,174 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 12:22:07,174 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 12:22:07,175 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 12:22:07,175 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 12:22:07,176 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 12:22:07,176 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 12:22:07,177 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 12:22:07,177 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 12:22:07,178 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 12:22:07,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 12:22:07,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 12:22:07,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 12:22:07,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 12:22:07,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 12:22:07,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 12:22:07,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 12:22:07,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 12:22:07,182 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 12:22:07,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 12:22:07,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 12:22:07,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 12:22:07,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:22:07,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 12:22:07,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 12:22:07,185 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 12:22:07,185 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 12:22:07,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 12:22:07,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 12:22:07,186 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 12:22:07,186 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 12:22:07,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 12:22:07,187 INFO L153 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_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/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_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a [2023-12-02 12:22:07,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 12:22:07,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 12:22:07,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 12:22:07,454 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 12:22:07,454 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 12:22:07,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2023-12-02 12:22:10,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 12:22:10,549 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 12:22:10,550 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2023-12-02 12:22:10,574 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/data/95329cae4/55a6601154bc45ac927fa8b2ada3e3ba/FLAG5aa0e0855 [2023-12-02 12:22:10,586 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/data/95329cae4/55a6601154bc45ac927fa8b2ada3e3ba [2023-12-02 12:22:10,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 12:22:10,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 12:22:10,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 12:22:10,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 12:22:10,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 12:22:10,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:22:10" (1/1) ... [2023-12-02 12:22:10,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@397a8a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:10, skipping insertion in model container [2023-12-02 12:22:10,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:22:10" (1/1) ... [2023-12-02 12:22:10,697 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:22:11,248 WARN L240 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_95403604-366e-4e22-b2d7-fcbab52d2a14/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2023-12-02 12:22:11,276 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:22:11,305 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 12:22:11,432 WARN L240 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_95403604-366e-4e22-b2d7-fcbab52d2a14/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2023-12-02 12:22:11,441 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:22:11,475 INFO L206 MainTranslator]: Completed translation [2023-12-02 12:22:11,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:11 WrapperNode [2023-12-02 12:22:11,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 12:22:11,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 12:22:11,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 12:22:11,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 12:22:11,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:11" (1/1) ... [2023-12-02 12:22:11,510 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:11" (1/1) ... [2023-12-02 12:22:11,567 INFO L138 Inliner]: procedures = 77, calls = 266, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 823 [2023-12-02 12:22:11,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 12:22:11,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 12:22:11,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 12:22:11,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 12:22:11,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:11" (1/1) ... [2023-12-02 12:22:11,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:11" (1/1) ... [2023-12-02 12:22:11,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:11" (1/1) ... [2023-12-02 12:22:11,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:11" (1/1) ... [2023-12-02 12:22:11,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:11" (1/1) ... [2023-12-02 12:22:11,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:11" (1/1) ... [2023-12-02 12:22:11,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:11" (1/1) ... [2023-12-02 12:22:11,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:11" (1/1) ... [2023-12-02 12:22:11,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 12:22:11,661 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 12:22:11,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 12:22:11,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 12:22:11,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:11" (1/1) ... [2023-12-02 12:22:11,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:22:11,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:22:11,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 12:22:11,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 12:22:11,733 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2023-12-02 12:22:11,734 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2023-12-02 12:22:11,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 12:22:11,734 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2023-12-02 12:22:11,734 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2023-12-02 12:22:11,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 12:22:11,734 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2023-12-02 12:22:11,734 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2023-12-02 12:22:11,734 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2023-12-02 12:22:11,735 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2023-12-02 12:22:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2023-12-02 12:22:11,735 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2023-12-02 12:22:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 12:22:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 12:22:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2023-12-02 12:22:11,735 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2023-12-02 12:22:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-12-02 12:22:11,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-12-02 12:22:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2023-12-02 12:22:11,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2023-12-02 12:22:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 12:22:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2023-12-02 12:22:11,736 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2023-12-02 12:22:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 12:22:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-12-02 12:22:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-12-02 12:22:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-12-02 12:22:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-12-02 12:22:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 12:22:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2023-12-02 12:22:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2023-12-02 12:22:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2023-12-02 12:22:11,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2023-12-02 12:22:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2023-12-02 12:22:11,738 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2023-12-02 12:22:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2023-12-02 12:22:11,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2023-12-02 12:22:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 12:22:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 12:22:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 12:22:11,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 12:22:11,975 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 12:22:11,977 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 12:22:12,090 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2023-12-02 12:22:12,142 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-12-02 12:22:12,815 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2023-12-02 12:22:12,816 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2023-12-02 12:22:12,832 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 12:22:13,117 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 12:22:13,117 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-02 12:22:13,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:22:13 BoogieIcfgContainer [2023-12-02 12:22:13,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 12:22:13,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 12:22:13,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 12:22:13,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 12:22:13,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:22:10" (1/3) ... [2023-12-02 12:22:13,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c155f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:22:13, skipping insertion in model container [2023-12-02 12:22:13,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:22:11" (2/3) ... [2023-12-02 12:22:13,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c155f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:22:13, skipping insertion in model container [2023-12-02 12:22:13,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:22:13" (3/3) ... [2023-12-02 12:22:13,127 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2023-12-02 12:22:13,146 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 12:22:13,146 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 12:22:13,196 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 12:22:13,203 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7f03aca7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 12:22:13,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 12:22:13,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 85 states have internal predecessors, (106), 30 states have call successors, (30), 15 states have call predecessors, (30), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-02 12:22:13,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 12:22:13,216 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:13,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:13,217 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:22:13,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:13,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1001973851, now seen corresponding path program 1 times [2023-12-02 12:22:13,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:13,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276842949] [2023-12-02 12:22:13,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:13,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:22:14,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:14,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276842949] [2023-12-02 12:22:14,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276842949] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:14,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:22:14,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:22:14,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421497187] [2023-12-02 12:22:14,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:14,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:22:14,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:14,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:22:14,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:22:14,407 INFO L87 Difference]: Start difference. First operand has 123 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 85 states have internal predecessors, (106), 30 states have call successors, (30), 15 states have call predecessors, (30), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2023-12-02 12:22:16,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:22:17,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:17,473 INFO L93 Difference]: Finished difference Result 318 states and 434 transitions. [2023-12-02 12:22:17,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:22:17,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 12 [2023-12-02 12:22:17,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:17,485 INFO L225 Difference]: With dead ends: 318 [2023-12-02 12:22:17,485 INFO L226 Difference]: Without dead ends: 199 [2023-12-02 12:22:17,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:22:17,491 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 116 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:17,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 232 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2023-12-02 12:22:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-12-02 12:22:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 194. [2023-12-02 12:22:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 127 states have (on average 1.2598425196850394) internal successors, (160), 132 states have internal predecessors, (160), 43 states have call successors, (43), 24 states have call predecessors, (43), 23 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-02 12:22:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 242 transitions. [2023-12-02 12:22:17,550 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 242 transitions. Word has length 12 [2023-12-02 12:22:17,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:17,551 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 242 transitions. [2023-12-02 12:22:17,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2023-12-02 12:22:17,551 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 242 transitions. [2023-12-02 12:22:17,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 12:22:17,552 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:17,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:17,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 12:22:17,553 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:22:17,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:17,554 INFO L85 PathProgramCache]: Analyzing trace with hash 996294858, now seen corresponding path program 1 times [2023-12-02 12:22:17,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:17,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138921319] [2023-12-02 12:22:17,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:17,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:22:18,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:18,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138921319] [2023-12-02 12:22:18,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138921319] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:18,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:22:18,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:22:18,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223245099] [2023-12-02 12:22:18,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:18,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:22:18,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:18,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:22:18,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:22:18,370 INFO L87 Difference]: Start difference. First operand 194 states and 242 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-12-02 12:22:20,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:22:22,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:22:22,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:22,763 INFO L93 Difference]: Finished difference Result 453 states and 563 transitions. [2023-12-02 12:22:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:22:22,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 13 [2023-12-02 12:22:22,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:22,768 INFO L225 Difference]: With dead ends: 453 [2023-12-02 12:22:22,768 INFO L226 Difference]: Without dead ends: 265 [2023-12-02 12:22:22,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:22:22,772 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 97 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:22,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 225 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2023-12-02 12:22:22,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-12-02 12:22:22,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2023-12-02 12:22:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 170 states have (on average 1.2411764705882353) internal successors, (211), 175 states have internal predecessors, (211), 56 states have call successors, (56), 33 states have call predecessors, (56), 32 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-02 12:22:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 319 transitions. [2023-12-02 12:22:22,802 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 319 transitions. Word has length 13 [2023-12-02 12:22:22,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:22,802 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 319 transitions. [2023-12-02 12:22:22,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-12-02 12:22:22,802 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 319 transitions. [2023-12-02 12:22:22,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 12:22:22,804 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:22,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:22,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 12:22:22,805 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:22:22,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:22,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1422597334, now seen corresponding path program 1 times [2023-12-02 12:22:22,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:22,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660289412] [2023-12-02 12:22:22,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:22,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:22:23,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:23,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660289412] [2023-12-02 12:22:23,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660289412] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:23,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:22:23,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:22:23,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162659555] [2023-12-02 12:22:23,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:23,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:22:23,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:23,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:22:23,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:22:23,484 INFO L87 Difference]: Start difference. First operand 259 states and 319 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 12:22:25,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:22:25,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:25,751 INFO L93 Difference]: Finished difference Result 530 states and 666 transitions. [2023-12-02 12:22:25,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:22:25,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-12-02 12:22:25,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:25,754 INFO L225 Difference]: With dead ends: 530 [2023-12-02 12:22:25,754 INFO L226 Difference]: Without dead ends: 282 [2023-12-02 12:22:25,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:22:25,756 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 39 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:25,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 190 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2023-12-02 12:22:25,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-12-02 12:22:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2023-12-02 12:22:25,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 193 states have (on average 1.2538860103626943) internal successors, (242), 198 states have internal predecessors, (242), 56 states have call successors, (56), 33 states have call predecessors, (56), 32 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-02 12:22:25,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 350 transitions. [2023-12-02 12:22:25,781 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 350 transitions. Word has length 38 [2023-12-02 12:22:25,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:25,782 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 350 transitions. [2023-12-02 12:22:25,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 12:22:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 350 transitions. [2023-12-02 12:22:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-02 12:22:25,785 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:25,785 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:25,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 12:22:25,786 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:22:25,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:25,787 INFO L85 PathProgramCache]: Analyzing trace with hash -932600488, now seen corresponding path program 1 times [2023-12-02 12:22:25,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:25,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91490721] [2023-12-02 12:22:25,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:25,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 12:22:27,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:27,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91490721] [2023-12-02 12:22:27,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91490721] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:27,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:22:27,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 12:22:27,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453112753] [2023-12-02 12:22:27,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:27,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:22:27,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:27,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:22:27,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:22:27,022 INFO L87 Difference]: Start difference. First operand 282 states and 350 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-02 12:22:29,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:22:31,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:22:32,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:22:33,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:22:35,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:22:35,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:35,898 INFO L93 Difference]: Finished difference Result 556 states and 691 transitions. [2023-12-02 12:22:35,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:22:35,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2023-12-02 12:22:35,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:35,902 INFO L225 Difference]: With dead ends: 556 [2023-12-02 12:22:35,902 INFO L226 Difference]: Without dead ends: 282 [2023-12-02 12:22:35,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:22:35,904 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:35,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 587 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2023-12-02 12:22:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-12-02 12:22:35,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2023-12-02 12:22:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 193 states have (on average 1.2487046632124352) internal successors, (241), 198 states have internal predecessors, (241), 56 states have call successors, (56), 33 states have call predecessors, (56), 32 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-02 12:22:35,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 349 transitions. [2023-12-02 12:22:35,926 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 349 transitions. Word has length 56 [2023-12-02 12:22:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:35,926 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 349 transitions. [2023-12-02 12:22:35,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-02 12:22:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 349 transitions. [2023-12-02 12:22:35,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-02 12:22:35,928 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:35,929 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:35,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 12:22:35,929 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:22:35,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:35,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1229353319, now seen corresponding path program 1 times [2023-12-02 12:22:35,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:35,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287819539] [2023-12-02 12:22:35,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:35,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 12:22:37,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:37,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287819539] [2023-12-02 12:22:37,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287819539] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:37,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:22:37,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:22:37,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906790062] [2023-12-02 12:22:37,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:37,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:22:37,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:37,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:22:37,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:22:37,472 INFO L87 Difference]: Start difference. First operand 282 states and 349 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-02 12:22:39,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:22:40,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:22:42,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:22:44,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:22:45,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:22:45,469 INFO L93 Difference]: Finished difference Result 538 states and 684 transitions. [2023-12-02 12:22:45,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 12:22:45,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 60 [2023-12-02 12:22:45,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:22:45,473 INFO L225 Difference]: With dead ends: 538 [2023-12-02 12:22:45,473 INFO L226 Difference]: Without dead ends: 333 [2023-12-02 12:22:45,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:22:45,475 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 171 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2023-12-02 12:22:45,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 365 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 182 Invalid, 1 Unknown, 0 Unchecked, 7.9s Time] [2023-12-02 12:22:45,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-12-02 12:22:45,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 208. [2023-12-02 12:22:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 140 states have (on average 1.2357142857142858) internal successors, (173), 144 states have internal predecessors, (173), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-02 12:22:45,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 255 transitions. [2023-12-02 12:22:45,492 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 255 transitions. Word has length 60 [2023-12-02 12:22:45,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:22:45,492 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 255 transitions. [2023-12-02 12:22:45,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-02 12:22:45,493 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 255 transitions. [2023-12-02 12:22:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 12:22:45,494 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:22:45,494 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:22:45,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 12:22:45,495 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:22:45,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:22:45,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1264503498, now seen corresponding path program 1 times [2023-12-02 12:22:45,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:22:45,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140239623] [2023-12-02 12:22:45,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:22:45,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:22:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:22:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-02 12:22:47,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:22:47,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140239623] [2023-12-02 12:22:47,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140239623] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:22:47,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:22:47,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 12:22:47,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346570652] [2023-12-02 12:22:47,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:22:47,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 12:22:47,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:22:47,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 12:22:47,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-02 12:22:47,341 INFO L87 Difference]: Start difference. First operand 208 states and 255 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-02 12:22:50,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:22:52,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:22:54,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:22:55,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:22:57,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:22:59,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:01,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:03,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:06,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:07,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:09,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:11,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:23:11,873 INFO L93 Difference]: Finished difference Result 491 states and 635 transitions. [2023-12-02 12:23:11,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 12:23:11,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 64 [2023-12-02 12:23:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:23:11,877 INFO L225 Difference]: With dead ends: 491 [2023-12-02 12:23:11,877 INFO L226 Difference]: Without dead ends: 488 [2023-12-02 12:23:11,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-12-02 12:23:11,879 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 607 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 238 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:23:11,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 762 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 741 Invalid, 8 Unknown, 0 Unchecked, 24.4s Time] [2023-12-02 12:23:11,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2023-12-02 12:23:11,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 388. [2023-12-02 12:23:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 265 states have (on average 1.2452830188679245) internal successors, (330), 270 states have internal predecessors, (330), 78 states have call successors, (78), 44 states have call predecessors, (78), 44 states have return successors, (78), 73 states have call predecessors, (78), 74 states have call successors, (78) [2023-12-02 12:23:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 486 transitions. [2023-12-02 12:23:11,910 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 486 transitions. Word has length 64 [2023-12-02 12:23:11,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:23:11,911 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 486 transitions. [2023-12-02 12:23:11,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-02 12:23:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 486 transitions. [2023-12-02 12:23:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-02 12:23:11,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:23:11,913 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:23:11,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 12:23:11,914 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:23:11,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:23:11,914 INFO L85 PathProgramCache]: Analyzing trace with hash 279545853, now seen corresponding path program 1 times [2023-12-02 12:23:11,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:23:11,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006284280] [2023-12-02 12:23:11,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:23:11,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:23:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:23:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 12:23:12,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:23:12,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006284280] [2023-12-02 12:23:12,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006284280] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:23:12,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:23:12,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:23:12,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608645947] [2023-12-02 12:23:12,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:23:12,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:23:12,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:23:12,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:23:12,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:23:12,588 INFO L87 Difference]: Start difference. First operand 388 states and 486 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 12:23:14,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:16,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:18,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:18,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:23:18,854 INFO L93 Difference]: Finished difference Result 589 states and 734 transitions. [2023-12-02 12:23:18,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:23:18,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 71 [2023-12-02 12:23:18,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:23:18,856 INFO L225 Difference]: With dead ends: 589 [2023-12-02 12:23:18,856 INFO L226 Difference]: Without dead ends: 199 [2023-12-02 12:23:18,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:23:18,858 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 33 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:23:18,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 438 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2023-12-02 12:23:18,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-12-02 12:23:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2023-12-02 12:23:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 125 states have (on average 1.2) internal successors, (150), 130 states have internal predecessors, (150), 39 states have call successors, (39), 21 states have call predecessors, (39), 21 states have return successors, (39), 34 states have call predecessors, (39), 35 states have call successors, (39) [2023-12-02 12:23:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 228 transitions. [2023-12-02 12:23:18,870 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 228 transitions. Word has length 71 [2023-12-02 12:23:18,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:23:18,870 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 228 transitions. [2023-12-02 12:23:18,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 12:23:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 228 transitions. [2023-12-02 12:23:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-02 12:23:18,872 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:23:18,872 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:23:18,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 12:23:18,873 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:23:18,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:23:18,873 INFO L85 PathProgramCache]: Analyzing trace with hash 967892077, now seen corresponding path program 1 times [2023-12-02 12:23:18,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:23:18,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591311321] [2023-12-02 12:23:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:23:18,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:23:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:23:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-02 12:23:20,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:23:20,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591311321] [2023-12-02 12:23:20,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591311321] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:23:20,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:23:20,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 12:23:20,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245509185] [2023-12-02 12:23:20,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:23:20,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:23:20,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:23:20,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:23:20,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:23:20,439 INFO L87 Difference]: Start difference. First operand 186 states and 228 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-02 12:23:22,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:24,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:25,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:23:25,144 INFO L93 Difference]: Finished difference Result 324 states and 404 transitions. [2023-12-02 12:23:25,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 12:23:25,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 79 [2023-12-02 12:23:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:23:25,146 INFO L225 Difference]: With dead ends: 324 [2023-12-02 12:23:25,146 INFO L226 Difference]: Without dead ends: 319 [2023-12-02 12:23:25,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-02 12:23:25,147 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 222 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-02 12:23:25,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 429 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-12-02 12:23:25,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-12-02 12:23:25,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 299. [2023-12-02 12:23:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 203 states have (on average 1.2167487684729064) internal successors, (247), 208 states have internal predecessors, (247), 63 states have call successors, (63), 32 states have call predecessors, (63), 32 states have return successors, (65), 58 states have call predecessors, (65), 59 states have call successors, (65) [2023-12-02 12:23:25,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 375 transitions. [2023-12-02 12:23:25,173 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 375 transitions. Word has length 79 [2023-12-02 12:23:25,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:23:25,173 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 375 transitions. [2023-12-02 12:23:25,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-02 12:23:25,174 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 375 transitions. [2023-12-02 12:23:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-02 12:23:25,175 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:23:25,175 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:23:25,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 12:23:25,175 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:23:25,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:23:25,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1184951356, now seen corresponding path program 1 times [2023-12-02 12:23:25,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:23:25,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128149821] [2023-12-02 12:23:25,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:23:25,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:23:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:23:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-02 12:23:25,871 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:23:25,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128149821] [2023-12-02 12:23:25,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128149821] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:23:25,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:23:25,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:23:25,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266834711] [2023-12-02 12:23:25,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:23:25,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:23:25,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:23:25,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:23:25,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:23:25,873 INFO L87 Difference]: Start difference. First operand 299 states and 375 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-02 12:23:27,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:28,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:23:28,965 INFO L93 Difference]: Finished difference Result 533 states and 682 transitions. [2023-12-02 12:23:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:23:28,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 78 [2023-12-02 12:23:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:23:28,968 INFO L225 Difference]: With dead ends: 533 [2023-12-02 12:23:28,968 INFO L226 Difference]: Without dead ends: 290 [2023-12-02 12:23:28,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:23:28,969 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 5 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:23:28,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 226 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-02 12:23:28,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-12-02 12:23:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2023-12-02 12:23:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 198 states have (on average 1.207070707070707) internal successors, (239), 201 states have internal predecessors, (239), 62 states have call successors, (62), 31 states have call predecessors, (62), 29 states have return successors, (60), 57 states have call predecessors, (60), 58 states have call successors, (60) [2023-12-02 12:23:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 361 transitions. [2023-12-02 12:23:28,986 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 361 transitions. Word has length 78 [2023-12-02 12:23:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:23:28,986 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 361 transitions. [2023-12-02 12:23:28,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-02 12:23:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 361 transitions. [2023-12-02 12:23:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-02 12:23:28,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:23:28,987 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:23:28,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 12:23:28,988 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:23:28,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:23:28,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1459863223, now seen corresponding path program 1 times [2023-12-02 12:23:28,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:23:28,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813281378] [2023-12-02 12:23:28,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:23:28,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:23:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:23:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-02 12:23:30,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:23:30,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813281378] [2023-12-02 12:23:30,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813281378] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:23:30,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:23:30,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:23:30,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9910212] [2023-12-02 12:23:30,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:23:30,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:23:30,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:23:30,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:23:30,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:23:30,133 INFO L87 Difference]: Start difference. First operand 290 states and 361 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-02 12:23:31,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:33,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:35,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:38,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:38,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:23:38,638 INFO L93 Difference]: Finished difference Result 357 states and 454 transitions. [2023-12-02 12:23:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 12:23:38,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 80 [2023-12-02 12:23:38,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:23:38,641 INFO L225 Difference]: With dead ends: 357 [2023-12-02 12:23:38,641 INFO L226 Difference]: Without dead ends: 354 [2023-12-02 12:23:38,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:23:38,641 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 107 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 17 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-12-02 12:23:38,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 363 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 174 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2023-12-02 12:23:38,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2023-12-02 12:23:38,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 306. [2023-12-02 12:23:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 209 states have (on average 1.1961722488038278) internal successors, (250), 212 states have internal predecessors, (250), 64 states have call successors, (64), 33 states have call predecessors, (64), 32 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2023-12-02 12:23:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 376 transitions. [2023-12-02 12:23:38,662 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 376 transitions. Word has length 80 [2023-12-02 12:23:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:23:38,662 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 376 transitions. [2023-12-02 12:23:38,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-02 12:23:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 376 transitions. [2023-12-02 12:23:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-02 12:23:38,664 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:23:38,664 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:23:38,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 12:23:38,664 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:23:38,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:23:38,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1988756892, now seen corresponding path program 1 times [2023-12-02 12:23:38,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:23:38,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904437197] [2023-12-02 12:23:38,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:23:38,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:23:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:23:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-02 12:23:39,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:23:39,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904437197] [2023-12-02 12:23:39,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904437197] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:23:39,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:23:39,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 12:23:39,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759856023] [2023-12-02 12:23:39,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:23:39,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 12:23:39,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:23:39,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 12:23:39,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:23:39,621 INFO L87 Difference]: Start difference. First operand 306 states and 376 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-02 12:23:41,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:42,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:44,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:46,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:46,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:23:46,829 INFO L93 Difference]: Finished difference Result 918 states and 1150 transitions. [2023-12-02 12:23:46,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 12:23:46,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 81 [2023-12-02 12:23:46,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:23:46,834 INFO L225 Difference]: With dead ends: 918 [2023-12-02 12:23:46,834 INFO L226 Difference]: Without dead ends: 660 [2023-12-02 12:23:46,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-02 12:23:46,835 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 219 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 95 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:23:46,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 282 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 432 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2023-12-02 12:23:46,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2023-12-02 12:23:46,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 606. [2023-12-02 12:23:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 410 states have (on average 1.2390243902439024) internal successors, (508), 420 states have internal predecessors, (508), 130 states have call successors, (130), 67 states have call predecessors, (130), 65 states have return successors, (130), 118 states have call predecessors, (130), 125 states have call successors, (130) [2023-12-02 12:23:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 768 transitions. [2023-12-02 12:23:46,870 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 768 transitions. Word has length 81 [2023-12-02 12:23:46,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:23:46,870 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 768 transitions. [2023-12-02 12:23:46,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-02 12:23:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 768 transitions. [2023-12-02 12:23:46,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-02 12:23:46,871 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:23:46,872 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:23:46,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 12:23:46,872 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:23:46,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:23:46,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1894044977, now seen corresponding path program 1 times [2023-12-02 12:23:46,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:23:46,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211277766] [2023-12-02 12:23:46,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:23:46,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:23:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:23:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 12:23:47,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:23:47,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211277766] [2023-12-02 12:23:47,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211277766] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:23:47,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:23:47,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:23:47,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864362607] [2023-12-02 12:23:47,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:23:47,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:23:47,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:23:47,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:23:47,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:23:47,606 INFO L87 Difference]: Start difference. First operand 606 states and 768 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-02 12:23:49,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:51,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:23:51,848 INFO L93 Difference]: Finished difference Result 701 states and 897 transitions. [2023-12-02 12:23:51,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:23:51,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 88 [2023-12-02 12:23:51,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:23:51,853 INFO L225 Difference]: With dead ends: 701 [2023-12-02 12:23:51,853 INFO L226 Difference]: Without dead ends: 686 [2023-12-02 12:23:51,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:23:51,854 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 168 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:23:51,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 286 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-12-02 12:23:51,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2023-12-02 12:23:51,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 610. [2023-12-02 12:23:51,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 414 states have (on average 1.2318840579710144) internal successors, (510), 424 states have internal predecessors, (510), 130 states have call successors, (130), 67 states have call predecessors, (130), 65 states have return successors, (130), 118 states have call predecessors, (130), 125 states have call successors, (130) [2023-12-02 12:23:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 770 transitions. [2023-12-02 12:23:51,895 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 770 transitions. Word has length 88 [2023-12-02 12:23:51,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:23:51,895 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 770 transitions. [2023-12-02 12:23:51,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-02 12:23:51,896 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 770 transitions. [2023-12-02 12:23:51,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-02 12:23:51,897 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:23:51,897 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:23:51,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 12:23:51,898 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:23:51,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:23:51,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1815538958, now seen corresponding path program 1 times [2023-12-02 12:23:51,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:23:51,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206253400] [2023-12-02 12:23:51,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:23:51,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:23:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:23:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-02 12:23:52,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:23:52,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206253400] [2023-12-02 12:23:52,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206253400] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:23:52,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:23:52,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:23:52,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14210635] [2023-12-02 12:23:52,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:23:52,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:23:52,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:23:52,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:23:52,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:23:52,769 INFO L87 Difference]: Start difference. First operand 610 states and 770 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-02 12:23:55,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:57,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:23:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:23:57,161 INFO L93 Difference]: Finished difference Result 1055 states and 1345 transitions. [2023-12-02 12:23:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:23:57,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2023-12-02 12:23:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:23:57,164 INFO L225 Difference]: With dead ends: 1055 [2023-12-02 12:23:57,164 INFO L226 Difference]: Without dead ends: 494 [2023-12-02 12:23:57,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:23:57,166 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 5 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:23:57,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 224 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2023-12-02 12:23:57,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2023-12-02 12:23:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 490. [2023-12-02 12:23:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 328 states have (on average 1.2164634146341464) internal successors, (399), 337 states have internal predecessors, (399), 108 states have call successors, (108), 57 states have call predecessors, (108), 53 states have return successors, (103), 95 states have call predecessors, (103), 103 states have call successors, (103) [2023-12-02 12:23:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 610 transitions. [2023-12-02 12:23:57,195 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 610 transitions. Word has length 88 [2023-12-02 12:23:57,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:23:57,196 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 610 transitions. [2023-12-02 12:23:57,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-02 12:23:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 610 transitions. [2023-12-02 12:23:57,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-02 12:23:57,197 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:23:57,197 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:23:57,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 12:23:57,198 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:23:57,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:23:57,198 INFO L85 PathProgramCache]: Analyzing trace with hash 459720386, now seen corresponding path program 1 times [2023-12-02 12:23:57,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:23:57,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662380958] [2023-12-02 12:23:57,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:23:57,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:23:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:23:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 12:23:58,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:23:58,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662380958] [2023-12-02 12:23:58,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662380958] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:23:58,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203548924] [2023-12-02 12:23:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:23:58,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:23:58,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:23:58,030 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:23:58,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 12:23:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:23:59,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 1600 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 12:23:59,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:23:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 12:23:59,241 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:23:59,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203548924] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:23:59,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 12:23:59,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-12-02 12:23:59,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429498867] [2023-12-02 12:23:59,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:23:59,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:23:59,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:23:59,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:23:59,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:23:59,244 INFO L87 Difference]: Start difference. First operand 490 states and 610 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-12-02 12:24:01,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:24:02,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:24:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:24:02,730 INFO L93 Difference]: Finished difference Result 670 states and 827 transitions. [2023-12-02 12:24:02,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:24:02,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 91 [2023-12-02 12:24:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:24:02,732 INFO L225 Difference]: With dead ends: 670 [2023-12-02 12:24:02,733 INFO L226 Difference]: Without dead ends: 272 [2023-12-02 12:24:02,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:24:02,734 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 43 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:24:02,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 204 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 76 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2023-12-02 12:24:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-12-02 12:24:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2023-12-02 12:24:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 183 states have (on average 1.1639344262295082) internal successors, (213), 187 states have internal predecessors, (213), 57 states have call successors, (57), 34 states have call predecessors, (57), 31 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-02 12:24:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 322 transitions. [2023-12-02 12:24:02,752 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 322 transitions. Word has length 91 [2023-12-02 12:24:02,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:24:02,753 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 322 transitions. [2023-12-02 12:24:02,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-12-02 12:24:02,753 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 322 transitions. [2023-12-02 12:24:02,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-02 12:24:02,754 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:24:02,754 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:24:02,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 12:24:02,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 12:24:02,955 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:24:02,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:24:02,955 INFO L85 PathProgramCache]: Analyzing trace with hash -301691987, now seen corresponding path program 1 times [2023-12-02 12:24:02,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:24:02,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053406360] [2023-12-02 12:24:02,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:24:02,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:24:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:24:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-02 12:24:04,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:24:04,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053406360] [2023-12-02 12:24:04,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053406360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:24:04,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:24:04,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 12:24:04,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47645921] [2023-12-02 12:24:04,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:24:04,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:24:04,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:24:04,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:24:04,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:24:04,331 INFO L87 Difference]: Start difference. First operand 272 states and 322 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-02 12:24:05,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:24:07,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:24:10,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:24:11,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:24:13,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:24:13,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:24:13,681 INFO L93 Difference]: Finished difference Result 288 states and 339 transitions. [2023-12-02 12:24:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:24:13,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 90 [2023-12-02 12:24:13,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:24:13,683 INFO L225 Difference]: With dead ends: 288 [2023-12-02 12:24:13,683 INFO L226 Difference]: Without dead ends: 285 [2023-12-02 12:24:13,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:24:13,683 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 81 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-12-02 12:24:13,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 524 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 3 Unknown, 0 Unchecked, 9.3s Time] [2023-12-02 12:24:13,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-12-02 12:24:13,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2023-12-02 12:24:13,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 193 states have (on average 1.1554404145077721) internal successors, (223), 197 states have internal predecessors, (223), 59 states have call successors, (59), 35 states have call predecessors, (59), 32 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-02 12:24:13,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 336 transitions. [2023-12-02 12:24:13,700 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 336 transitions. Word has length 90 [2023-12-02 12:24:13,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:24:13,701 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 336 transitions. [2023-12-02 12:24:13,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-02 12:24:13,701 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 336 transitions. [2023-12-02 12:24:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-02 12:24:13,702 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:24:13,702 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:24:13,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 12:24:13,702 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:24:13,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:24:13,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1321327660, now seen corresponding path program 1 times [2023-12-02 12:24:13,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:24:13,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388416611] [2023-12-02 12:24:13,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:24:13,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:24:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:24:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-02 12:24:15,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:24:15,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388416611] [2023-12-02 12:24:15,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388416611] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:24:15,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:24:15,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 12:24:15,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668669257] [2023-12-02 12:24:15,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:24:15,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 12:24:15,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:24:15,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 12:24:15,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:24:15,193 INFO L87 Difference]: Start difference. First operand 285 states and 336 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-02 12:24:18,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:24:20,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:24:20,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:24:20,964 INFO L93 Difference]: Finished difference Result 315 states and 363 transitions. [2023-12-02 12:24:20,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 12:24:20,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 106 [2023-12-02 12:24:20,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:24:20,966 INFO L225 Difference]: With dead ends: 315 [2023-12-02 12:24:20,966 INFO L226 Difference]: Without dead ends: 290 [2023-12-02 12:24:20,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-02 12:24:20,967 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 222 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 93 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-12-02 12:24:20,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 151 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 239 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2023-12-02 12:24:20,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-12-02 12:24:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 286. [2023-12-02 12:24:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 193 states have (on average 1.1295336787564767) internal successors, (218), 197 states have internal predecessors, (218), 58 states have call successors, (58), 37 states have call predecessors, (58), 34 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-02 12:24:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 329 transitions. [2023-12-02 12:24:20,996 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 329 transitions. Word has length 106 [2023-12-02 12:24:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:24:20,997 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 329 transitions. [2023-12-02 12:24:20,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-02 12:24:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 329 transitions. [2023-12-02 12:24:20,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-02 12:24:20,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:24:20,999 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:24:20,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 12:24:20,999 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:24:21,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:24:21,000 INFO L85 PathProgramCache]: Analyzing trace with hash -654169240, now seen corresponding path program 1 times [2023-12-02 12:24:21,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:24:21,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839494045] [2023-12-02 12:24:21,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:24:21,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:24:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:24:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-02 12:24:22,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:24:22,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839494045] [2023-12-02 12:24:22,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839494045] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:24:22,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:24:22,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:24:22,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396500453] [2023-12-02 12:24:22,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:24:22,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:24:22,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:24:22,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:24:22,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:24:22,214 INFO L87 Difference]: Start difference. First operand 286 states and 329 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-02 12:24:24,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:24:26,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:24:28,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:24:29,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:24:29,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:24:29,285 INFO L93 Difference]: Finished difference Result 293 states and 333 transitions. [2023-12-02 12:24:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:24:29,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 129 [2023-12-02 12:24:29,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:24:29,288 INFO L225 Difference]: With dead ends: 293 [2023-12-02 12:24:29,288 INFO L226 Difference]: Without dead ends: 250 [2023-12-02 12:24:29,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:24:29,289 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 32 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:24:29,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 400 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2023-12-02 12:24:29,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-12-02 12:24:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2023-12-02 12:24:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 166 states have (on average 1.1204819277108433) internal successors, (186), 170 states have internal predecessors, (186), 50 states have call successors, (50), 33 states have call predecessors, (50), 31 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2023-12-02 12:24:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 281 transitions. [2023-12-02 12:24:29,315 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 281 transitions. Word has length 129 [2023-12-02 12:24:29,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:24:29,315 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 281 transitions. [2023-12-02 12:24:29,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-02 12:24:29,315 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 281 transitions. [2023-12-02 12:24:29,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-02 12:24:29,318 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:24:29,318 INFO L195 NwaCegarLoop]: trace histogram [8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:24:29,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 12:24:29,318 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:24:29,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:24:29,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2001169890, now seen corresponding path program 1 times [2023-12-02 12:24:29,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:24:29,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094015664] [2023-12-02 12:24:29,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:24:29,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:24:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:24:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-12-02 12:24:31,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:24:31,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094015664] [2023-12-02 12:24:31,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094015664] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:24:31,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772453918] [2023-12-02 12:24:31,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:24:31,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:24:31,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:24:31,363 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:24:31,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 12:24:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:24:32,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 2100 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-02 12:24:32,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:24:32,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 12:24:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 31 proven. 19 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-12-02 12:24:33,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:24:34,390 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 30 proven. 7 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-12-02 12:24:34,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772453918] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:24:34,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [64254466] [2023-12-02 12:24:34,415 INFO L159 IcfgInterpreter]: Started Sifa with 108 locations of interest [2023-12-02 12:24:34,415 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:24:34,419 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:24:34,424 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:24:34,424 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:26:07,751 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_blast_assert with input of size 50 for LOIs [2023-12-02 12:26:07,757 INFO L197 IcfgInterpreter]: Interpreting procedure usb_free_coherent with input of size 74 for LOIs [2023-12-02 12:26:07,842 INFO L197 IcfgInterpreter]: Interpreting procedure kzalloc with input of size 63 for LOIs [2023-12-02 12:26:08,297 INFO L197 IcfgInterpreter]: Interpreting procedure kbtab_exit with input of size 47 for LOIs [2023-12-02 12:26:08,301 INFO L197 IcfgInterpreter]: Interpreting procedure input_set_abs_params with input of size 67 for LOIs [2023-12-02 12:26:08,316 INFO L197 IcfgInterpreter]: Interpreting procedure usb_free_urb with input of size 102 for LOIs [2023-12-02 12:26:08,527 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_undefined_pointer with input of size 87 for LOIs [2023-12-02 12:26:08,685 INFO L197 IcfgInterpreter]: Interpreting procedure kfree with input of size 45 for LOIs [2023-12-02 12:26:08,694 INFO L197 IcfgInterpreter]: Interpreting procedure usb_set_intfdata with input of size 45 for LOIs [2023-12-02 12:26:08,786 INFO L197 IcfgInterpreter]: Interpreting procedure dev_set_drvdata with input of size 224 for LOIs [2023-12-02 12:26:09,055 INFO L197 IcfgInterpreter]: Interpreting procedure dev_get_drvdata with input of size 49 for LOIs [2023-12-02 12:26:09,168 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 90 for LOIs [2023-12-02 12:26:09,285 INFO L197 IcfgInterpreter]: Interpreting procedure kbtab_init with input of size 690 for LOIs [2023-12-02 12:26:12,847 INFO L197 IcfgInterpreter]: Interpreting procedure printk with input of size 694 for LOIs [2023-12-02 12:26:13,182 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:26:20,811 WARN L293 SmtUtils]: Spent 7.29s on a formula simplification that was a NOOP. DAG size: 690 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:26:28,748 WARN L293 SmtUtils]: Spent 7.63s on a formula simplification. DAG size of input: 703 DAG size of output: 700 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:26:39,307 WARN L293 SmtUtils]: Spent 10.26s on a formula simplification that was a NOOP. DAG size: 700 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:26:48,715 WARN L293 SmtUtils]: Spent 9.10s on a formula simplification that was a NOOP. DAG size: 694 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:26:58,517 WARN L293 SmtUtils]: Spent 9.48s on a formula simplification that was a NOOP. DAG size: 704 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:27:10,475 WARN L293 SmtUtils]: Spent 7.37s on a formula simplification that was a NOOP. DAG size: 696 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:27:20,000 WARN L293 SmtUtils]: Spent 9.11s on a formula simplification that was a NOOP. DAG size: 698 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:27:27,802 WARN L293 SmtUtils]: Spent 7.44s on a formula simplification that was a NOOP. DAG size: 692 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:28:03,640 WARN L293 SmtUtils]: Spent 16.69s on a formula simplification. DAG size of input: 268 DAG size of output: 260 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:28:33,007 WARN L293 SmtUtils]: Spent 18.10s on a formula simplification. DAG size of input: 266 DAG size of output: 264 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:31:34,075 WARN L293 SmtUtils]: Spent 2.32m on a formula simplification that was a NOOP. DAG size: 358 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:31:38,715 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tmp___7~11#1| 0) (= c_~__param_kb_pressure_click~0.__annonCompField31.arg.base 10) (= |c_ULTIMATE.start_input_allocate_device_#res#1.offset| 0) (= c_~LDV_IN_INTERRUPT~0 1) (= |c_~#kbtab_driver~0.offset| 0) (= |c_ULTIMATE.start_usb_alloc_urb_#res#1.offset| 0) (= |c_~#kbtab_ids~0.offset| 0) (= |c_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset| 0) (= c_~__param_kb_pressure_click~0.name.base 11) (= c_~res_kbtab_probe_3~0 0) (= |c_ULTIMATE.start_usb_alloc_coherent_#res#1.offset| 0) (<= 0 (+ |c_ULTIMATE.start_usb_make_path_#res#1| 2147483648)) (= |c_~#kb_pressure_click~0.offset| 0) (<= 1 |c_#StackHeapBarrier|) (<= 1 c_~ldv_urb_state~0) (<= |c_ULTIMATE.start_main_~tmp___9~2#1| 2147483647) (= |c_~#kbtab_driver~0.base| 13) (= c_~__param_kb_pressure_click~0.perm 0) (= |c_ULTIMATE.start_kbtab_probe_~tmp___8~2#1.offset| 0) (= |c_~#kbtab_ids~0.base| 12) (= 0 |c_ULTIMATE.start_main_~tmp___8~3#1|) (= c_~__param_kb_pressure_click~0.__annonCompField31.arg.offset 0) (exists ((|v_#memory_$Pointer$.offset_369| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_206| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_118| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_207| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_120| (Array Int (Array Int Int)))) (let ((.cse3 (select |v_#memory_$Pointer$.offset_117| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|)) (.cse4 (select |v_#memory_$Pointer$.offset_119| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|)) (.cse1 (select |v_#memory_$Pointer$.offset_206| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|)) (.cse2 (select |v_#memory_$Pointer$.offset_207| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|)) (.cse6 (select |v_#memory_$Pointer$.offset_120| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|)) (.cse0 (select |v_#memory_$Pointer$.offset_118| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|))) (and (= |v_#memory_$Pointer$.offset_206| (store |v_#memory_$Pointer$.offset_118| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store (store (store (store .cse0 798 (+ 68 |c_ULTIMATE.start_kbtab_probe_~intf#1.offset|)) 536 |#funAddr~kbtab_open.offset|) 544 |#funAddr~kbtab_close.offset|) 40 (select .cse1 40)))) (= (store |v_#memory_$Pointer$.offset_207| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store .cse2 88 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|) 88))) |c_#memory_$Pointer$.offset|) (= (store |v_#memory_$Pointer$.offset_117| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store .cse3 26 (select .cse4 26))) |v_#memory_$Pointer$.offset_119|) (= (let ((.cse5 (store |v_#memory_$Pointer$.offset_369| |c_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_369| |c_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) 32 0) 24 |c_ULTIMATE.start_kbtab_probe_~dev~1#1.offset|) 16 0)))) (store .cse5 |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store (store (store (select .cse5 |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|) 0 0) 8 40) 24 (select .cse3 24)))) |v_#memory_$Pointer$.offset_117|) (= (store |v_#memory_$Pointer$.offset_119| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store .cse4 28 (select .cse6 28))) |v_#memory_$Pointer$.offset_120|) (= (store |v_#memory_$Pointer$.offset_206| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store .cse1 80 (select .cse2 80))) |v_#memory_$Pointer$.offset_207|) (= (store |v_#memory_$Pointer$.offset_120| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store .cse6 30 (select .cse0 30))) |v_#memory_$Pointer$.offset_118|)))) (= |c_~#kb_pressure_click~0.base| 10) (= |c_ULTIMATE.start_kbtab_probe_~tmp___9~1#1.offset| 0) (exists ((|v_#memory_int_356| (Array Int (Array Int Int))) (|v_ULTIMATE.start_kbtab_probe_#t~nondet75#1_49| Int) (|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int))) (|v_ULTIMATE.start_kbtab_probe_#t~nondet73#1_29| Int) (|v_ULTIMATE.start_kbtab_probe_#t~nondet71#1_55| Int) (|v_ULTIMATE.start_kbtab_probe_#t~nondet73#1_51| Int) (|v_ULTIMATE.start_kbtab_probe_#t~nondet71#1_32| Int) (|v_#memory_int_4| (Array Int (Array Int Int))) (|v_#memory_int_353| (Array Int (Array Int Int))) (|v_#memory_int_355| (Array Int (Array Int Int))) (|v_#memory_int_200| (Array Int (Array Int Int))) (|v_#memory_int_354| (Array Int (Array Int Int))) (|v_#memory_int_201| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_#memory_int_201| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|)) (.cse9 (select |v_#memory_int_354| |c_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|)) (.cse14 (select (select |c_#memory_int| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|) 88)) (.cse12 (select |v_#memory_int_105| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|)) (.cse7 (select |v_#memory_int_356| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|)) (.cse10 (select |v_#memory_int_4| |c_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|)) (.cse11 (select |v_#memory_int_106| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|)) (.cse13 (select |v_#memory_int_200| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|))) (and (= (store |v_#memory_int_356| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store .cse7 536 (select .cse8 536))) |v_#memory_int_201|) (= (store |v_#memory_int_354| |c_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base| (store .cse9 24 (select .cse10 24))) |v_#memory_int_4|) (= (store |v_#memory_int_106| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store .cse11 8 (select .cse12 8))) |v_#memory_int_105|) (= (store |v_#memory_int_201| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store .cse8 544 (select .cse13 544))) |v_#memory_int_200|) (= (store |v_#memory_int_353| |c_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base| (store (select |v_#memory_int_353| |c_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) 32 (select .cse9 32))) |v_#memory_int_354|) (= |c_#memory_int| (store |v_#memory_int_200| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store (store (store .cse13 40 |v_ULTIMATE.start_kbtab_probe_#t~nondet71#1_32|) 80 |v_ULTIMATE.start_kbtab_probe_#t~nondet73#1_29|) 88 .cse14))) (let ((.cse18 (mod (select .cse13 88) 18446744073709551616))) (let ((.cse15 (= .cse18 0)) (.cse16 (= .cse18 1025))) (or (and (= .cse14 1025) (or .cse15 .cse16)) (let ((.cse17 (mod |v_ULTIMATE.start_kbtab_probe_#t~nondet75#1_49| 18446744073709551616))) (and (<= 1025 .cse17) (not .cse15) (not .cse16) (<= .cse18 .cse17) (= .cse14 |v_ULTIMATE.start_kbtab_probe_#t~nondet75#1_49|) (<= .cse17 (+ .cse18 1025))))))) (= (store |v_#memory_int_105| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store (let ((.cse19 (let ((.cse20 (let ((.cse21 (store .cse12 24 3))) (store .cse21 26 (select (select (store |v_#memory_int_105| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| .cse21) |c_ULTIMATE.start_kbtab_probe_~dev~1#1.base|) (+ |c_ULTIMATE.start_kbtab_probe_~dev~1#1.offset| 1237)))))) (store .cse20 28 (select (select (store |v_#memory_int_105| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| .cse20) |c_ULTIMATE.start_kbtab_probe_~dev~1#1.base|) (+ |c_ULTIMATE.start_kbtab_probe_~dev~1#1.offset| 1239)))))) (store .cse19 30 (select (select (store |v_#memory_int_105| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| .cse19) |c_ULTIMATE.start_kbtab_probe_~dev~1#1.base|) (+ |c_ULTIMATE.start_kbtab_probe_~dev~1#1.offset| 1241)))) 798 (select .cse7 798))) |v_#memory_int_356|) (let ((.cse24 (mod (select .cse13 40) 18446744073709551616))) (let ((.cse22 (= .cse24 10)) (.cse23 (= .cse24 0))) (or (let ((.cse25 (mod |v_ULTIMATE.start_kbtab_probe_#t~nondet71#1_55| 18446744073709551616))) (and (not .cse22) (not .cse23) (<= .cse24 .cse25) (<= .cse25 (+ .cse24 10)) (<= 10 .cse25) (= |v_ULTIMATE.start_kbtab_probe_#t~nondet71#1_55| |v_ULTIMATE.start_kbtab_probe_#t~nondet71#1_32|))) (and (or .cse22 .cse23) (= |v_ULTIMATE.start_kbtab_probe_#t~nondet71#1_32| 10))))) (= (store |v_#memory_int_4| |c_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base| (store .cse10 16 (select (select |v_#memory_int_355| |c_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) 16))) |v_#memory_int_355|) (= |v_#memory_int_106| (store |v_#memory_int_355| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store (select |v_#memory_int_355| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|) 0 (select .cse11 0)))) (let ((.cse29 (mod (select .cse13 80) 18446744073709551616))) (let ((.cse27 (= 196608 .cse29)) (.cse26 (= .cse29 0))) (or (and (= 196608 |v_ULTIMATE.start_kbtab_probe_#t~nondet73#1_29|) (or .cse26 .cse27)) (let ((.cse28 (mod |v_ULTIMATE.start_kbtab_probe_#t~nondet73#1_51| 18446744073709551616))) (and (<= 196608 .cse28) (= |v_ULTIMATE.start_kbtab_probe_#t~nondet73#1_51| |v_ULTIMATE.start_kbtab_probe_#t~nondet73#1_29|) (not .cse27) (<= .cse28 (+ 196608 .cse29)) (not .cse26) (<= .cse29 .cse28))))))))) (<= 0 (+ |c_ULTIMATE.start_main_~tmp___9~2#1| 2147483648)) (= c_~__param_kb_pressure_click~0.name.offset 0) (not (= 0 |c_ULTIMATE.start_usb_alloc_urb_#res#1.base|)) (= |c_~#__param_str_kb_pressure_click~0.offset| 0) (= |c_~#__param_str_kb_pressure_click~0.base| 11) (= c_~__param_kb_pressure_click~0.flags 0) (= |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.offset| 0) (<= |c_ULTIMATE.start_usb_make_path_#res#1| 31) (= (+ 12 |c_ULTIMATE.start_kbtab_probe_~error~0#1|) 0) (= |c_ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (exists ((|v_#memory_$Pointer$.base_370| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_207| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_119| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_118| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_206| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_117| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_120| (Array Int (Array Int Int)))) (let ((.cse31 (select |v_#memory_$Pointer$.base_207| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|)) (.cse35 (select |v_#memory_$Pointer$.base_119| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|)) (.cse33 (select |v_#memory_$Pointer$.base_120| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|)) (.cse30 (select |v_#memory_$Pointer$.base_206| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|)) (.cse36 (select |v_#memory_$Pointer$.base_118| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|)) (.cse32 (select |v_#memory_$Pointer$.base_117| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_206| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store .cse30 80 (select .cse31 80))) |v_#memory_$Pointer$.base_207|) (= (store |v_#memory_$Pointer$.base_117| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store .cse32 30 (select .cse33 30))) |v_#memory_$Pointer$.base_120|) (= (let ((.cse34 (store |v_#memory_$Pointer$.base_370| |c_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base| (store (store (store (select |v_#memory_$Pointer$.base_370| |c_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) 32 |c_ULTIMATE.start_usb_alloc_urb_#res#1.base|) 24 |c_ULTIMATE.start_kbtab_probe_~dev~1#1.base|) 16 |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|)))) (store .cse34 |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store (store (store (select .cse34 |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|) 0 7) 8 |c_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) 24 (select .cse35 24)))) |v_#memory_$Pointer$.base_119|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_207| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store .cse31 88 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base|) 88)))) (= (store |v_#memory_$Pointer$.base_119| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store .cse35 26 (select .cse36 26))) |v_#memory_$Pointer$.base_118|) (= (store |v_#memory_$Pointer$.base_120| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store (store (store (store .cse33 798 |c_ULTIMATE.start_kbtab_probe_~intf#1.base|) 536 |#funAddr~kbtab_open.base|) 544 |#funAddr~kbtab_close.base|) 40 (select .cse30 40))) |v_#memory_$Pointer$.base_206|) (= (store |v_#memory_$Pointer$.base_118| |c_ULTIMATE.start_kbtab_probe_~input_dev~0#1.base| (store .cse36 28 (select .cse32 28))) |v_#memory_$Pointer$.base_117|))))) is different from false [2023-12-02 12:33:05,040 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '21438#(and (= ~__param_kb_pressure_click~0.flags 0) (<= 1 |#StackHeapBarrier|) (= ~LDV_IN_INTERRUPT~0 1) (= |~#kbtab_ids~0.base| 12) (= ~__param_kb_pressure_click~0.name.base 11) (= ~__param_kb_pressure_click~0.__annonCompField31.arg.offset 0) (= ~ldv_urb_state~0 0) (= |~#kbtab_driver~0.base| 13) (not (= ~ldv_coherent_state~0 0)) (= |~#kb_pressure_click~0.base| 10) (= |~#__param_str_kb_pressure_click~0.base| 11) (<= ~res_kbtab_probe_3~0 0) (= |~#__param_str_kb_pressure_click~0.offset| 0) (= |~#kb_pressure_click~0.offset| 0) (= |~#kbtab_ids~0.offset| 0) (= 10 ~__param_kb_pressure_click~0.__annonCompField31.arg.base) (not (= 0 ~res_kbtab_probe_3~0)) (= |~#kbtab_driver~0.offset| 0) (= ~__param_kb_pressure_click~0.perm 0) (= ~__param_kb_pressure_click~0.name.offset 0) (<= 0 (+ 12 ~res_kbtab_probe_3~0)))' at error location [2023-12-02 12:33:05,040 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:33:05,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:33:05,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 14] total 27 [2023-12-02 12:33:05,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291522048] [2023-12-02 12:33:05,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:33:05,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 12:33:05,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:33:05,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 12:33:05,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=12206, Unknown=23, NotChecked=224, Total=13110 [2023-12-02 12:33:05,047 INFO L87 Difference]: Start difference. First operand 248 states and 281 transitions. Second operand has 27 states, 23 states have (on average 7.043478260869565) internal successors, (162), 23 states have internal predecessors, (162), 6 states have call successors, (51), 6 states have call predecessors, (51), 10 states have return successors, (54), 9 states have call predecessors, (54), 5 states have call successors, (54) [2023-12-02 12:33:09,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:11,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:13,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:15,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:16,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:18,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:20,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:22,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:24,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:26,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:28,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:30,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:32,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:34,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:36,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:38,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:33:38,802 INFO L93 Difference]: Finished difference Result 252 states and 283 transitions. [2023-12-02 12:33:38,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 12:33:38,803 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 7.043478260869565) internal successors, (162), 23 states have internal predecessors, (162), 6 states have call successors, (51), 6 states have call predecessors, (51), 10 states have return successors, (54), 9 states have call predecessors, (54), 5 states have call successors, (54) Word has length 175 [2023-12-02 12:33:38,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:33:38,804 INFO L225 Difference]: With dead ends: 252 [2023-12-02 12:33:38,804 INFO L226 Difference]: Without dead ends: 236 [2023-12-02 12:33:38,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 420 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6480 ImplicationChecksByTransitivity, 412.8s TimeCoverageRelationStatistics Valid=808, Invalid=14923, Unknown=23, NotChecked=248, Total=16002 [2023-12-02 12:33:38,812 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 185 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 84 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:33:38,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 692 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1402 Invalid, 12 Unknown, 0 Unchecked, 33.0s Time] [2023-12-02 12:33:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-12-02 12:33:38,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2023-12-02 12:33:38,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 157 states have (on average 1.1210191082802548) internal successors, (176), 160 states have internal predecessors, (176), 47 states have call successors, (47), 31 states have call predecessors, (47), 29 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-02 12:33:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 266 transitions. [2023-12-02 12:33:38,839 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 266 transitions. Word has length 175 [2023-12-02 12:33:38,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:33:38,840 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 266 transitions. [2023-12-02 12:33:38,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 7.043478260869565) internal successors, (162), 23 states have internal predecessors, (162), 6 states have call successors, (51), 6 states have call predecessors, (51), 10 states have return successors, (54), 9 states have call predecessors, (54), 5 states have call successors, (54) [2023-12-02 12:33:38,840 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 266 transitions. [2023-12-02 12:33:38,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-02 12:33:38,842 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:33:38,842 INFO L195 NwaCegarLoop]: trace histogram [9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:33:38,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 12:33:39,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 12:33:39,043 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:33:39,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:33:39,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1206508947, now seen corresponding path program 1 times [2023-12-02 12:33:39,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:33:39,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174589762] [2023-12-02 12:33:39,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:33:39,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:33:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:33:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2023-12-02 12:33:40,840 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:33:40,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174589762] [2023-12-02 12:33:40,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174589762] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:33:40,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:33:40,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 12:33:40,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268638606] [2023-12-02 12:33:40,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:33:40,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 12:33:40,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:33:40,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 12:33:40,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-02 12:33:40,843 INFO L87 Difference]: Start difference. First operand 234 states and 266 transitions. Second operand has 9 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 5 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-02 12:33:43,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:45,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:47,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:48,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:50,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:50,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:33:50,849 INFO L93 Difference]: Finished difference Result 239 states and 272 transitions. [2023-12-02 12:33:50,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 12:33:50,850 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 5 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 179 [2023-12-02 12:33:50,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:33:50,851 INFO L225 Difference]: With dead ends: 239 [2023-12-02 12:33:50,851 INFO L226 Difference]: Without dead ends: 236 [2023-12-02 12:33:50,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-12-02 12:33:50,852 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 145 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 26 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2023-12-02 12:33:50,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 356 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 460 Invalid, 3 Unknown, 0 Unchecked, 9.9s Time] [2023-12-02 12:33:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-12-02 12:33:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2023-12-02 12:33:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 157 states have (on average 1.1146496815286624) internal successors, (175), 160 states have internal predecessors, (175), 47 states have call successors, (47), 31 states have call predecessors, (47), 29 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-02 12:33:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 265 transitions. [2023-12-02 12:33:50,877 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 265 transitions. Word has length 179 [2023-12-02 12:33:50,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:33:50,877 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 265 transitions. [2023-12-02 12:33:50,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 5 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-02 12:33:50,878 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 265 transitions. [2023-12-02 12:33:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-12-02 12:33:50,879 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:33:50,879 INFO L195 NwaCegarLoop]: trace histogram [9, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:33:50,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-02 12:33:50,880 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:33:50,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:33:50,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1830371708, now seen corresponding path program 1 times [2023-12-02 12:33:50,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:33:50,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000613093] [2023-12-02 12:33:50,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:33:50,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:33:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:33:52,530 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2023-12-02 12:33:52,530 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:33:52,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000613093] [2023-12-02 12:33:52,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000613093] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:33:52,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:33:52,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 12:33:52,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643458408] [2023-12-02 12:33:52,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:33:52,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:33:52,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:33:52,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:33:52,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:33:52,532 INFO L87 Difference]: Start difference. First operand 234 states and 265 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 4 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2023-12-02 12:33:54,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 12:33:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:33:54,776 INFO L93 Difference]: Finished difference Result 238 states and 267 transitions. [2023-12-02 12:33:54,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:33:54,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 4 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 194 [2023-12-02 12:33:54,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:33:54,778 INFO L225 Difference]: With dead ends: 238 [2023-12-02 12:33:54,778 INFO L226 Difference]: Without dead ends: 235 [2023-12-02 12:33:54,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-12-02 12:33:54,779 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 183 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:33:54,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 174 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-02 12:33:54,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-12-02 12:33:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2023-12-02 12:33:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 157 states have (on average 1.10828025477707) internal successors, (174), 159 states have internal predecessors, (174), 46 states have call successors, (46), 31 states have call predecessors, (46), 29 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-02 12:33:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 263 transitions. [2023-12-02 12:33:54,797 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 263 transitions. Word has length 194 [2023-12-02 12:33:54,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:33:54,798 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 263 transitions. [2023-12-02 12:33:54,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 4 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2023-12-02 12:33:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 263 transitions. [2023-12-02 12:33:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2023-12-02 12:33:54,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:33:54,799 INFO L195 NwaCegarLoop]: trace histogram [9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:33:54,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-02 12:33:54,799 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:33:54,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:33:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1988272658, now seen corresponding path program 1 times [2023-12-02 12:33:54,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:33:54,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585780592] [2023-12-02 12:33:54,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:33:54,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:33:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:33:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 21 proven. 64 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-02 12:33:59,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:33:59,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585780592] [2023-12-02 12:33:59,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585780592] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:33:59,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643493470] [2023-12-02 12:33:59,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:33:59,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:33:59,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:33:59,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:33:59,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95403604-366e-4e22-b2d7-fcbab52d2a14/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 12:34:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:34:00,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 2206 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-02 12:34:00,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:34:00,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 12:34:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2023-12-02 12:34:01,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:34:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-12-02 12:34:02,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643493470] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:34:02,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1187828257] [2023-12-02 12:34:02,482 INFO L159 IcfgInterpreter]: Started Sifa with 110 locations of interest [2023-12-02 12:34:02,482 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:34:02,482 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:34:02,482 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:34:02,483 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:35:40,426 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_blast_assert with input of size 48 for LOIs [2023-12-02 12:35:40,431 INFO L197 IcfgInterpreter]: Interpreting procedure usb_free_coherent with input of size 110 for LOIs [2023-12-02 12:35:40,615 INFO L197 IcfgInterpreter]: Interpreting procedure kzalloc with input of size 63 for LOIs [2023-12-02 12:35:41,061 INFO L197 IcfgInterpreter]: Interpreting procedure kbtab_exit with input of size 45 for LOIs [2023-12-02 12:35:41,066 INFO L197 IcfgInterpreter]: Interpreting procedure input_set_abs_params with input of size 62 for LOIs [2023-12-02 12:35:41,077 INFO L197 IcfgInterpreter]: Interpreting procedure usb_free_urb with input of size 102 for LOIs [2023-12-02 12:35:41,296 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_undefined_pointer with input of size 87 for LOIs [2023-12-02 12:35:41,429 INFO L197 IcfgInterpreter]: Interpreting procedure kfree with input of size 47 for LOIs [2023-12-02 12:35:41,436 INFO L197 IcfgInterpreter]: Interpreting procedure usb_set_intfdata with input of size 45 for LOIs [2023-12-02 12:35:41,524 INFO L197 IcfgInterpreter]: Interpreting procedure dev_set_drvdata with input of size 224 for LOIs [2023-12-02 12:35:41,663 INFO L197 IcfgInterpreter]: Interpreting procedure dev_get_drvdata with input of size 49 for LOIs [2023-12-02 12:35:41,797 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 90 for LOIs [2023-12-02 12:35:41,911 INFO L197 IcfgInterpreter]: Interpreting procedure kbtab_init with input of size 690 for LOIs [2023-12-02 12:35:45,510 INFO L197 IcfgInterpreter]: Interpreting procedure printk with input of size 694 for LOIs [2023-12-02 12:35:45,848 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:36:03,225 WARN L293 SmtUtils]: Spent 16.48s on a formula simplification that was a NOOP. DAG size: 690 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:36:20,971 WARN L293 SmtUtils]: Spent 16.89s on a formula simplification. DAG size of input: 703 DAG size of output: 700 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:36:29,520 WARN L293 SmtUtils]: Spent 7.71s on a formula simplification that was a NOOP. DAG size: 700 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)