./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 05:29:41,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 05:29:41,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 05:29:41,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 05:29:41,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 05:29:41,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 05:29:41,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 05:29:41,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 05:29:41,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 05:29:41,340 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 05:29:41,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 05:29:41,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 05:29:41,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 05:29:41,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 05:29:41,340 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 05:29:41,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 05:29:41,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 05:29:41,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 05:29:41,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 05:29:41,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 05:29:41,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 05:29:41,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 05:29:41,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 05:29:41,341 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 05:29:41,341 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 05:29:41,341 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 05:29:41,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 05:29:41,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 05:29:41,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 05:29:41,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:29:41,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 05:29:41,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 05:29:41,341 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 05:29:41,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 05:29:41,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 05:29:41,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 05:29:41,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 05:29:41,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 05:29:41,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 05:29:41,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 05:29:41,342 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 [2025-02-06 05:29:41,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 05:29:41,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 05:29:41,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 05:29:41,600 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 05:29:41,600 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 05:29:41,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2025-02-06 05:29:42,851 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78fa97f0c/655008edc72240fa8ed2df7761b78c22/FLAG58f93506a [2025-02-06 05:29:43,262 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 05:29:43,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2025-02-06 05:29:43,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78fa97f0c/655008edc72240fa8ed2df7761b78c22/FLAG58f93506a [2025-02-06 05:29:43,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78fa97f0c/655008edc72240fa8ed2df7761b78c22 [2025-02-06 05:29:43,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 05:29:43,432 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 05:29:43,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 05:29:43,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 05:29:43,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 05:29:43,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:29:43" (1/1) ... [2025-02-06 05:29:43,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c28ef09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:43, skipping insertion in model container [2025-02-06 05:29:43,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:29:43" (1/1) ... [2025-02-06 05:29:43,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 05:29:44,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2025-02-06 05:29:44,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:29:44,100 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 05:29:44,251 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2025-02-06 05:29:44,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:29:44,295 INFO L204 MainTranslator]: Completed translation [2025-02-06 05:29:44,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:44 WrapperNode [2025-02-06 05:29:44,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 05:29:44,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 05:29:44,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 05:29:44,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 05:29:44,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:44" (1/1) ... [2025-02-06 05:29:44,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:44" (1/1) ... [2025-02-06 05:29:44,372 INFO L138 Inliner]: procedures = 78, calls = 266, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 1011 [2025-02-06 05:29:44,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 05:29:44,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 05:29:44,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 05:29:44,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 05:29:44,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:44" (1/1) ... [2025-02-06 05:29:44,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:44" (1/1) ... [2025-02-06 05:29:44,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:44" (1/1) ... [2025-02-06 05:29:44,478 INFO L175 MemorySlicer]: Split 160 memory accesses to 6 slices as follows [2, 6, 82, 42, 8, 20]. 51 percent of accesses are in the largest equivalence class. The 23 initializations are split as follows [2, 6, 6, 0, 8, 1]. The 103 writes are split as follows [0, 0, 42, 42, 0, 19]. [2025-02-06 05:29:44,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:44" (1/1) ... [2025-02-06 05:29:44,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:44" (1/1) ... [2025-02-06 05:29:44,509 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:44" (1/1) ... [2025-02-06 05:29:44,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:44" (1/1) ... [2025-02-06 05:29:44,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:44" (1/1) ... [2025-02-06 05:29:44,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:44" (1/1) ... [2025-02-06 05:29:44,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 05:29:44,529 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 05:29:44,530 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 05:29:44,530 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 05:29:44,530 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:44" (1/1) ... [2025-02-06 05:29:44,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:29:44,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:29:44,564 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 05:29:44,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 05:29:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2025-02-06 05:29:44,583 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2025-02-06 05:29:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 05:29:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-02-06 05:29:44,584 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-02-06 05:29:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 05:29:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 05:29:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 05:29:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 05:29:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 05:29:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 05:29:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 05:29:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 05:29:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 05:29:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 05:29:44,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 05:29:44,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 05:29:44,585 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2025-02-06 05:29:44,585 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2025-02-06 05:29:44,585 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2025-02-06 05:29:44,585 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2025-02-06 05:29:44,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 05:29:44,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 05:29:44,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 05:29:44,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 05:29:44,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 05:29:44,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 05:29:44,585 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-02-06 05:29:44,586 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-02-06 05:29:44,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 05:29:44,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 05:29:44,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 05:29:44,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 05:29:44,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 05:29:44,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 05:29:44,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 05:29:44,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 05:29:44,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 05:29:44,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 05:29:44,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 05:29:44,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 05:29:44,587 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-02-06 05:29:44,587 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-02-06 05:29:44,587 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 05:29:44,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 05:29:44,587 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2025-02-06 05:29:44,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2025-02-06 05:29:44,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 05:29:44,587 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-02-06 05:29:44,587 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-02-06 05:29:44,587 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 05:29:44,587 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 05:29:44,587 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-06 05:29:44,587 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-06 05:29:44,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 05:29:44,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 05:29:44,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 05:29:44,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 05:29:44,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 05:29:44,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 05:29:44,588 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-02-06 05:29:44,588 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-02-06 05:29:44,588 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2025-02-06 05:29:44,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2025-02-06 05:29:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-02-06 05:29:44,589 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-02-06 05:29:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2025-02-06 05:29:44,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2025-02-06 05:29:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 05:29:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 05:29:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 05:29:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 05:29:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 05:29:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 05:29:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 05:29:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 05:29:44,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 05:29:44,790 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 05:29:44,793 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 05:29:44,840 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4257: havoc usb_register_driver_#t~nondet120#1; [2025-02-06 05:29:44,844 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4210: havoc #t~ret114.base, #t~ret114.offset; [2025-02-06 05:29:44,884 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint usb_free_coherentFINAL: assume true; [2025-02-06 05:29:44,900 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint usb_free_urbFINAL: assume true; [2025-02-06 05:29:44,917 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4204: havoc #t~malloc112.base, #t~malloc112.offset; [2025-02-06 05:29:44,926 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4214: havoc #t~nondet115; [2025-02-06 05:29:44,934 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4243: havoc #t~nondet118; [2025-02-06 05:29:44,965 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4207: havoc __kmalloc_#t~ret113#1.base, __kmalloc_#t~ret113#1.offset; [2025-02-06 05:29:44,968 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2025-02-06 05:29:44,977 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4239: havoc #t~ret117.base, #t~ret117.offset; [2025-02-06 05:29:49,668 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4247: havoc strlcat_#t~nondet119#1; [2025-02-06 05:29:49,668 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3513: havoc input_allocate_device_#t~ret28#1.base, input_allocate_device_#t~ret28#1.offset; [2025-02-06 05:29:49,668 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4001: assume false; [2025-02-06 05:29:49,668 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4001: assume !false; [2025-02-06 05:29:49,668 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4224: havoc input_register_device_#t~nondet116#1; [2025-02-06 05:29:49,668 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3509: havoc __create_pipe_#t~mem26#1;havoc __create_pipe_#t~bitwise27#1; [2025-02-06 05:29:49,712 INFO L? ?]: Removed 279 outVars from TransFormulas that were not future-live. [2025-02-06 05:29:49,713 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 05:29:49,728 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 05:29:49,728 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 05:29:49,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:29:49 BoogieIcfgContainer [2025-02-06 05:29:49,729 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 05:29:49,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 05:29:49,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 05:29:49,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 05:29:49,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:29:43" (1/3) ... [2025-02-06 05:29:49,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694de758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:29:49, skipping insertion in model container [2025-02-06 05:29:49,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:29:44" (2/3) ... [2025-02-06 05:29:49,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694de758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:29:49, skipping insertion in model container [2025-02-06 05:29:49,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:29:49" (3/3) ... [2025-02-06 05:29:49,735 INFO L128 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2025-02-06 05:29:49,744 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 05:29:49,745 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i that has 16 procedures, 208 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-06 05:29:49,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 05:29:49,785 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, 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;@7a154b90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 05:29:49,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 05:29:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 159 states have (on average 1.3333333333333333) internal successors, (212), 167 states have internal predecessors, (212), 30 states have call successors, (30), 15 states have call predecessors, (30), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 05:29:49,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 05:29:49,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:29:49,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:29:49,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:29:49,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:29:49,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2127051673, now seen corresponding path program 1 times [2025-02-06 05:29:49,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:29:49,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444499106] [2025-02-06 05:29:49,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:29:49,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:29:51,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 05:29:51,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 05:29:51,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:29:51,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:29:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:29:51,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:29:51,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444499106] [2025-02-06 05:29:51,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444499106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:29:51,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:29:51,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 05:29:51,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991593901] [2025-02-06 05:29:51,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:29:51,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 05:29:51,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:29:51,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 05:29:51,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 05:29:51,604 INFO L87 Difference]: Start difference. First operand has 205 states, 159 states have (on average 1.3333333333333333) internal successors, (212), 167 states have internal predecessors, (212), 30 states have call successors, (30), 15 states have call predecessors, (30), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2025-02-06 05:29:51,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:29:51,804 INFO L93 Difference]: Finished difference Result 542 states and 722 transitions. [2025-02-06 05:29:51,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 05:29:51,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2025-02-06 05:29:51,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:29:51,818 INFO L225 Difference]: With dead ends: 542 [2025-02-06 05:29:51,820 INFO L226 Difference]: Without dead ends: 345 [2025-02-06 05:29:51,825 INFO L434 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 [2025-02-06 05:29:51,828 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 227 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:29:51,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 485 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:29:51,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-02-06 05:29:51,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 324. [2025-02-06 05:29:51,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 260 states have (on average 1.25) internal successors, (325), 266 states have internal predecessors, (325), 43 states have call successors, (43), 23 states have call predecessors, (43), 20 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 05:29:51,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 404 transitions. [2025-02-06 05:29:51,898 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 404 transitions. Word has length 17 [2025-02-06 05:29:51,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:29:51,899 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 404 transitions. [2025-02-06 05:29:51,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2025-02-06 05:29:51,899 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 404 transitions. [2025-02-06 05:29:51,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 05:29:51,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:29:51,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:29:51,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 05:29:51,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:29:51,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:29:51,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1513830533, now seen corresponding path program 1 times [2025-02-06 05:29:51,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:29:51,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713608471] [2025-02-06 05:29:51,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:29:51,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:29:52,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 05:29:52,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 05:29:52,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:29:52,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:29:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:29:53,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:29:53,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713608471] [2025-02-06 05:29:53,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713608471] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:29:53,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:29:53,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 05:29:53,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705971116] [2025-02-06 05:29:53,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:29:53,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 05:29:53,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:29:53,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 05:29:53,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 05:29:53,023 INFO L87 Difference]: Start difference. First operand 324 states and 404 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2025-02-06 05:29:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:29:53,129 INFO L93 Difference]: Finished difference Result 632 states and 789 transitions. [2025-02-06 05:29:53,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 05:29:53,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2025-02-06 05:29:53,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:29:53,138 INFO L225 Difference]: With dead ends: 632 [2025-02-06 05:29:53,138 INFO L226 Difference]: Without dead ends: 621 [2025-02-06 05:29:53,138 INFO L434 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 [2025-02-06 05:29:53,139 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 213 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:29:53,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 491 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:29:53,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-02-06 05:29:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 599. [2025-02-06 05:29:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 485 states have (on average 1.2556701030927835) internal successors, (609), 492 states have internal predecessors, (609), 76 states have call successors, (76), 40 states have call predecessors, (76), 37 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-06 05:29:53,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 754 transitions. [2025-02-06 05:29:53,196 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 754 transitions. Word has length 18 [2025-02-06 05:29:53,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:29:53,196 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 754 transitions. [2025-02-06 05:29:53,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2025-02-06 05:29:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 754 transitions. [2025-02-06 05:29:53,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 05:29:53,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:29:53,199 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:29:53,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 05:29:53,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:29:53,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:29:53,200 INFO L85 PathProgramCache]: Analyzing trace with hash 8914999, now seen corresponding path program 1 times [2025-02-06 05:29:53,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:29:53,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293471789] [2025-02-06 05:29:53,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:29:53,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:29:54,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 05:29:54,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 05:29:54,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:29:54,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:29:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:29:54,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:29:54,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293471789] [2025-02-06 05:29:54,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293471789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:29:54,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:29:54,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 05:29:54,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368471115] [2025-02-06 05:29:54,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:29:54,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 05:29:54,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:29:54,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 05:29:54,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 05:29:54,472 INFO L87 Difference]: Start difference. First operand 599 states and 754 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2025-02-06 05:29:54,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:29:54,577 INFO L93 Difference]: Finished difference Result 1202 states and 1520 transitions. [2025-02-06 05:29:54,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 05:29:54,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 51 [2025-02-06 05:29:54,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:29:54,581 INFO L225 Difference]: With dead ends: 1202 [2025-02-06 05:29:54,581 INFO L226 Difference]: Without dead ends: 620 [2025-02-06 05:29:54,585 INFO L434 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 [2025-02-06 05:29:54,586 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 106 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:29:54,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 317 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:29:54,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-02-06 05:29:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 608. [2025-02-06 05:29:54,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 494 states have (on average 1.2550607287449393) internal successors, (620), 501 states have internal predecessors, (620), 76 states have call successors, (76), 40 states have call predecessors, (76), 37 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-06 05:29:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 765 transitions. [2025-02-06 05:29:54,621 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 765 transitions. Word has length 51 [2025-02-06 05:29:54,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:29:54,621 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 765 transitions. [2025-02-06 05:29:54,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2025-02-06 05:29:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 765 transitions. [2025-02-06 05:29:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-06 05:29:54,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:29:54,624 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-02-06 05:29:54,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 05:29:54,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:29:54,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:29:54,625 INFO L85 PathProgramCache]: Analyzing trace with hash -455301623, now seen corresponding path program 1 times [2025-02-06 05:29:54,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:29:54,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949936141] [2025-02-06 05:29:54,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:29:54,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:29:55,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-06 05:29:55,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-06 05:29:55,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:29:55,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:29:56,554 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 05:29:56,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:29:56,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949936141] [2025-02-06 05:29:56,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949936141] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:29:56,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798911583] [2025-02-06 05:29:56,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:29:56,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:29:56,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:29:56,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:29:56,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 05:29:57,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-06 05:29:58,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-06 05:29:58,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:29:58,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:29:58,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 1661 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 05:29:58,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:29:58,148 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 05:29:58,148 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:29:58,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798911583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:29:58,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:29:58,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-02-06 05:29:58,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947561744] [2025-02-06 05:29:58,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:29:58,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:29:58,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:29:58,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:29:58,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-06 05:29:58,150 INFO L87 Difference]: Start difference. First operand 608 states and 765 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 05:29:58,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:29:58,223 INFO L93 Difference]: Finished difference Result 988 states and 1239 transitions. [2025-02-06 05:29:58,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:29:58,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2025-02-06 05:29:58,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:29:58,226 INFO L225 Difference]: With dead ends: 988 [2025-02-06 05:29:58,226 INFO L226 Difference]: Without dead ends: 407 [2025-02-06 05:29:58,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-06 05:29:58,227 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 0 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:29:58,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 627 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:29:58,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-02-06 05:29:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2025-02-06 05:29:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 326 states have (on average 1.2331288343558282) internal successors, (402), 332 states have internal predecessors, (402), 53 states have call successors, (53), 30 states have call predecessors, (53), 27 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 05:29:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 501 transitions. [2025-02-06 05:29:58,240 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 501 transitions. Word has length 90 [2025-02-06 05:29:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:29:58,240 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 501 transitions. [2025-02-06 05:29:58,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 05:29:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 501 transitions. [2025-02-06 05:29:58,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 05:29:58,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:29:58,243 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-06 05:29:58,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 05:29:58,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:29:58,444 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:29:58,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:29:58,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1442086430, now seen corresponding path program 1 times [2025-02-06 05:29:58,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:29:58,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579453994] [2025-02-06 05:29:58,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:29:58,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:29:59,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 05:29:59,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 05:29:59,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:29:59,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:29:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 05:29:59,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:29:59,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579453994] [2025-02-06 05:29:59,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579453994] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:29:59,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755096684] [2025-02-06 05:29:59,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:29:59,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:29:59,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:29:59,727 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:29:59,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 05:30:00,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 05:30:00,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 05:30:00,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:00,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:00,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 1601 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 05:30:00,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:30:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 05:30:01,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:30:01,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755096684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:30:01,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:30:01,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-02-06 05:30:01,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042195913] [2025-02-06 05:30:01,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:30:01,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 05:30:01,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:30:01,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 05:30:01,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-02-06 05:30:01,060 INFO L87 Difference]: Start difference. First operand 407 states and 501 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 05:30:01,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:30:01,155 INFO L93 Difference]: Finished difference Result 801 states and 988 transitions. [2025-02-06 05:30:01,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 05:30:01,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 87 [2025-02-06 05:30:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:30:01,158 INFO L225 Difference]: With dead ends: 801 [2025-02-06 05:30:01,159 INFO L226 Difference]: Without dead ends: 407 [2025-02-06 05:30:01,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-02-06 05:30:01,161 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 0 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:30:01,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1048 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:30:01,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-02-06 05:30:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2025-02-06 05:30:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 326 states have (on average 1.2300613496932515) internal successors, (401), 332 states have internal predecessors, (401), 53 states have call successors, (53), 30 states have call predecessors, (53), 27 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 05:30:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 500 transitions. [2025-02-06 05:30:01,181 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 500 transitions. Word has length 87 [2025-02-06 05:30:01,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:30:01,181 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 500 transitions. [2025-02-06 05:30:01,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 05:30:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 500 transitions. [2025-02-06 05:30:01,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 05:30:01,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:01,183 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-06 05:30:01,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 05:30:01,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:30:01,387 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:01,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:01,388 INFO L85 PathProgramCache]: Analyzing trace with hash 736329814, now seen corresponding path program 1 times [2025-02-06 05:30:01,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:01,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653042449] [2025-02-06 05:30:01,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:01,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:30:02,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 05:30:02,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 05:30:02,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:02,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 05:30:02,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:30:02,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653042449] [2025-02-06 05:30:02,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653042449] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:30:02,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355872271] [2025-02-06 05:30:02,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:02,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:30:02,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:30:02,733 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:30:02,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 05:30:04,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 05:30:04,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 05:30:04,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:04,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:04,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 1619 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 05:30:04,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:30:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 05:30:04,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:30:04,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355872271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:30:04,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:30:04,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 12 [2025-02-06 05:30:04,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921968011] [2025-02-06 05:30:04,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:30:04,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 05:30:04,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:30:04,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 05:30:04,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-06 05:30:04,345 INFO L87 Difference]: Start difference. First operand 407 states and 500 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 05:30:04,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:30:04,623 INFO L93 Difference]: Finished difference Result 823 states and 1022 transitions. [2025-02-06 05:30:04,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 05:30:04,624 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2025-02-06 05:30:04,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:30:04,626 INFO L225 Difference]: With dead ends: 823 [2025-02-06 05:30:04,626 INFO L226 Difference]: Without dead ends: 443 [2025-02-06 05:30:04,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-06 05:30:04,627 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 2 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1828 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 05:30:04,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1828 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 05:30:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-02-06 05:30:04,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2025-02-06 05:30:04,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 353 states have (on average 1.2209631728045325) internal successors, (431), 359 states have internal predecessors, (431), 53 states have call successors, (53), 30 states have call predecessors, (53), 33 states have return successors, (61), 50 states have call predecessors, (61), 46 states have call successors, (61) [2025-02-06 05:30:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 545 transitions. [2025-02-06 05:30:04,640 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 545 transitions. Word has length 92 [2025-02-06 05:30:04,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:30:04,640 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 545 transitions. [2025-02-06 05:30:04,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 05:30:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 545 transitions. [2025-02-06 05:30:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 05:30:04,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:04,641 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-06 05:30:04,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 05:30:04,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:30:04,843 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:04,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1630364780, now seen corresponding path program 1 times [2025-02-06 05:30:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:04,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015760744] [2025-02-06 05:30:04,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:04,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:30:05,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 05:30:05,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 05:30:05,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:05,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 05:30:06,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:30:06,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015760744] [2025-02-06 05:30:06,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015760744] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:30:06,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478853227] [2025-02-06 05:30:06,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:06,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:30:06,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:30:06,156 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:30:06,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 05:30:07,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 05:30:07,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 05:30:07,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:07,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:07,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 1628 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 05:30:07,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:30:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 05:30:07,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:30:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 05:30:07,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478853227] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:30:07,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:30:07,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2025-02-06 05:30:07,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728031599] [2025-02-06 05:30:07,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:30:07,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 05:30:07,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:30:07,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 05:30:07,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 05:30:07,934 INFO L87 Difference]: Start difference. First operand 440 states and 545 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 05:30:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:30:08,195 INFO L93 Difference]: Finished difference Result 892 states and 1115 transitions. [2025-02-06 05:30:08,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 05:30:08,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 92 [2025-02-06 05:30:08,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:30:08,199 INFO L225 Difference]: With dead ends: 892 [2025-02-06 05:30:08,199 INFO L226 Difference]: Without dead ends: 479 [2025-02-06 05:30:08,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 05:30:08,200 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 4 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:30:08,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1633 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 05:30:08,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-02-06 05:30:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 455. [2025-02-06 05:30:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 365 states have (on average 1.2136986301369863) internal successors, (443), 368 states have internal predecessors, (443), 56 states have call successors, (56), 30 states have call predecessors, (56), 33 states have return successors, (67), 56 states have call predecessors, (67), 49 states have call successors, (67) [2025-02-06 05:30:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 566 transitions. [2025-02-06 05:30:08,212 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 566 transitions. Word has length 92 [2025-02-06 05:30:08,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:30:08,212 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 566 transitions. [2025-02-06 05:30:08,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 05:30:08,213 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 566 transitions. [2025-02-06 05:30:08,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 05:30:08,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:08,214 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-06 05:30:08,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 05:30:08,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 05:30:08,418 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:08,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:08,418 INFO L85 PathProgramCache]: Analyzing trace with hash 331209878, now seen corresponding path program 2 times [2025-02-06 05:30:08,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:08,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215217021] [2025-02-06 05:30:08,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 05:30:08,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:30:09,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 92 statements into 2 equivalence classes. [2025-02-06 05:30:09,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 61 of 92 statements. [2025-02-06 05:30:09,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 05:30:09,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:09,634 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 05:30:09,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:30:09,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215217021] [2025-02-06 05:30:09,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215217021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:30:09,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:30:09,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 05:30:09,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538869752] [2025-02-06 05:30:09,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:30:09,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 05:30:09,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:30:09,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 05:30:09,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 05:30:09,636 INFO L87 Difference]: Start difference. First operand 455 states and 566 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:30:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:30:09,729 INFO L93 Difference]: Finished difference Result 812 states and 1018 transitions. [2025-02-06 05:30:09,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 05:30:09,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2025-02-06 05:30:09,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:30:09,732 INFO L225 Difference]: With dead ends: 812 [2025-02-06 05:30:09,732 INFO L226 Difference]: Without dead ends: 470 [2025-02-06 05:30:09,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 05:30:09,734 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 0 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:30:09,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1247 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:30:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-02-06 05:30:09,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2025-02-06 05:30:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 377 states have (on average 1.206896551724138) internal successors, (455), 377 states have internal predecessors, (455), 56 states have call successors, (56), 30 states have call predecessors, (56), 36 states have return successors, (72), 62 states have call predecessors, (72), 49 states have call successors, (72) [2025-02-06 05:30:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 583 transitions. [2025-02-06 05:30:09,750 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 583 transitions. Word has length 92 [2025-02-06 05:30:09,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:30:09,750 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 583 transitions. [2025-02-06 05:30:09,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:30:09,750 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 583 transitions. [2025-02-06 05:30:09,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 05:30:09,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:09,751 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-06 05:30:09,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 05:30:09,751 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:09,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash 353842132, now seen corresponding path program 1 times [2025-02-06 05:30:09,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:09,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303141674] [2025-02-06 05:30:09,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:09,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:30:10,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 05:30:10,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 05:30:10,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:10,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 05:30:10,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:30:10,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303141674] [2025-02-06 05:30:10,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303141674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:30:10,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:30:10,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 05:30:10,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26153627] [2025-02-06 05:30:10,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:30:10,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 05:30:10,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:30:10,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 05:30:10,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 05:30:10,973 INFO L87 Difference]: Start difference. First operand 470 states and 583 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:30:11,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:30:11,137 INFO L93 Difference]: Finished difference Result 822 states and 1027 transitions. [2025-02-06 05:30:11,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 05:30:11,138 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2025-02-06 05:30:11,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:30:11,141 INFO L225 Difference]: With dead ends: 822 [2025-02-06 05:30:11,141 INFO L226 Difference]: Without dead ends: 470 [2025-02-06 05:30:11,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 05:30:11,144 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:30:11,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1640 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:30:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-02-06 05:30:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2025-02-06 05:30:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 377 states have (on average 1.2015915119363396) internal successors, (453), 377 states have internal predecessors, (453), 56 states have call successors, (56), 30 states have call predecessors, (56), 36 states have return successors, (72), 62 states have call predecessors, (72), 49 states have call successors, (72) [2025-02-06 05:30:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 581 transitions. [2025-02-06 05:30:11,159 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 581 transitions. Word has length 92 [2025-02-06 05:30:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:30:11,160 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 581 transitions. [2025-02-06 05:30:11,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:30:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 581 transitions. [2025-02-06 05:30:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 05:30:11,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:11,161 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2025-02-06 05:30:11,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 05:30:11,161 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:11,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:11,162 INFO L85 PathProgramCache]: Analyzing trace with hash -293077739, now seen corresponding path program 1 times [2025-02-06 05:30:11,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:11,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803751162] [2025-02-06 05:30:11,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:11,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:30:11,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 05:30:11,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 05:30:11,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:11,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 05:30:12,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:30:12,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803751162] [2025-02-06 05:30:12,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803751162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:30:12,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:30:12,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:30:12,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277931180] [2025-02-06 05:30:12,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:30:12,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:30:12,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:30:12,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:30:12,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:30:12,225 INFO L87 Difference]: Start difference. First operand 470 states and 581 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 4 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) [2025-02-06 05:30:16,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:30:16,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:30:16,456 INFO L93 Difference]: Finished difference Result 483 states and 592 transitions. [2025-02-06 05:30:16,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:30:16,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 4 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 95 [2025-02-06 05:30:16,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:30:16,459 INFO L225 Difference]: With dead ends: 483 [2025-02-06 05:30:16,459 INFO L226 Difference]: Without dead ends: 473 [2025-02-06 05:30:16,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:30:16,459 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 274 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:30:16,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 531 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 05:30:16,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-02-06 05:30:16,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 462. [2025-02-06 05:30:16,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 371 states have (on average 1.1994609164420484) internal successors, (445), 370 states have internal predecessors, (445), 54 states have call successors, (54), 29 states have call predecessors, (54), 36 states have return successors, (72), 62 states have call predecessors, (72), 49 states have call successors, (72) [2025-02-06 05:30:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 571 transitions. [2025-02-06 05:30:16,473 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 571 transitions. Word has length 95 [2025-02-06 05:30:16,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:30:16,473 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 571 transitions. [2025-02-06 05:30:16,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 4 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) [2025-02-06 05:30:16,474 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 571 transitions. [2025-02-06 05:30:16,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 05:30:16,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:16,476 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-06 05:30:16,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 05:30:16,476 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:16,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:16,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1431429398, now seen corresponding path program 1 times [2025-02-06 05:30:16,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:16,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511516907] [2025-02-06 05:30:16,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:16,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:30:17,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 05:30:17,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 05:30:17,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:17,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 05:30:17,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:30:17,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511516907] [2025-02-06 05:30:17,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511516907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:30:17,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:30:17,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:30:17,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787436938] [2025-02-06 05:30:17,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:30:17,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:30:17,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:30:17,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:30:17,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:30:17,412 INFO L87 Difference]: Start difference. First operand 462 states and 571 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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) [2025-02-06 05:30:21,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:30:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:30:21,581 INFO L93 Difference]: Finished difference Result 895 states and 1106 transitions. [2025-02-06 05:30:21,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:30:21,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 106 [2025-02-06 05:30:21,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:30:21,583 INFO L225 Difference]: With dead ends: 895 [2025-02-06 05:30:21,583 INFO L226 Difference]: Without dead ends: 427 [2025-02-06 05:30:21,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:30:21,585 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 91 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:30:21,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 746 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 05:30:21,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-02-06 05:30:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 408. [2025-02-06 05:30:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 330 states have (on average 1.1939393939393939) internal successors, (394), 330 states have internal predecessors, (394), 48 states have call successors, (48), 25 states have call predecessors, (48), 29 states have return successors, (59), 52 states have call predecessors, (59), 43 states have call successors, (59) [2025-02-06 05:30:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 501 transitions. [2025-02-06 05:30:21,599 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 501 transitions. Word has length 106 [2025-02-06 05:30:21,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:30:21,599 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 501 transitions. [2025-02-06 05:30:21,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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) [2025-02-06 05:30:21,599 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 501 transitions. [2025-02-06 05:30:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 05:30:21,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:21,600 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2025-02-06 05:30:21,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 05:30:21,601 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:21,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:21,601 INFO L85 PathProgramCache]: Analyzing trace with hash -926327514, now seen corresponding path program 1 times [2025-02-06 05:30:21,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:21,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252042147] [2025-02-06 05:30:21,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:21,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:30:22,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 05:30:22,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 05:30:22,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:22,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-06 05:30:23,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:30:23,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252042147] [2025-02-06 05:30:23,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252042147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:30:23,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:30:23,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:30:23,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355363518] [2025-02-06 05:30:23,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:30:23,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:30:23,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:30:23,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:30:23,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:30:23,026 INFO L87 Difference]: Start difference. First operand 408 states and 501 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 05:30:23,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:30:23,089 INFO L93 Difference]: Finished difference Result 614 states and 753 transitions. [2025-02-06 05:30:23,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:30:23,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 140 [2025-02-06 05:30:23,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:30:23,091 INFO L225 Difference]: With dead ends: 614 [2025-02-06 05:30:23,091 INFO L226 Difference]: Without dead ends: 260 [2025-02-06 05:30:23,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:30:23,092 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:30:23,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 600 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:30:23,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-02-06 05:30:23,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2025-02-06 05:30:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 201 states have (on average 1.1691542288557213) internal successors, (235), 203 states have internal predecessors, (235), 32 states have call successors, (32), 18 states have call predecessors, (32), 19 states have return successors, (35), 31 states have call predecessors, (35), 27 states have call successors, (35) [2025-02-06 05:30:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 302 transitions. [2025-02-06 05:30:23,101 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 302 transitions. Word has length 140 [2025-02-06 05:30:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:30:23,102 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 302 transitions. [2025-02-06 05:30:23,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 05:30:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 302 transitions. [2025-02-06 05:30:23,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 05:30:23,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:23,105 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2025-02-06 05:30:23,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 05:30:23,105 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:23,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:23,106 INFO L85 PathProgramCache]: Analyzing trace with hash 334589736, now seen corresponding path program 1 times [2025-02-06 05:30:23,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:23,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902302920] [2025-02-06 05:30:23,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:23,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:30:24,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 05:30:24,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 05:30:24,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:24,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 05:30:24,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:30:24,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902302920] [2025-02-06 05:30:24,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902302920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:30:24,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:30:24,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 05:30:24,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432344844] [2025-02-06 05:30:24,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:30:24,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 05:30:24,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:30:24,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 05:30:24,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 05:30:24,544 INFO L87 Difference]: Start difference. First operand 253 states and 302 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 05:30:24,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:30:24,662 INFO L93 Difference]: Finished difference Result 443 states and 535 transitions. [2025-02-06 05:30:24,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 05:30:24,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 2 states have call successors, (13) Word has length 140 [2025-02-06 05:30:24,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:30:24,663 INFO L225 Difference]: With dead ends: 443 [2025-02-06 05:30:24,664 INFO L226 Difference]: Without dead ends: 253 [2025-02-06 05:30:24,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 05:30:24,665 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:30:24,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1224 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:30:24,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-06 05:30:24,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-02-06 05:30:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 201 states have (on average 1.164179104477612) internal successors, (234), 203 states have internal predecessors, (234), 32 states have call successors, (32), 18 states have call predecessors, (32), 19 states have return successors, (34), 31 states have call predecessors, (34), 27 states have call successors, (34) [2025-02-06 05:30:24,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 300 transitions. [2025-02-06 05:30:24,674 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 300 transitions. Word has length 140 [2025-02-06 05:30:24,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:30:24,674 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 300 transitions. [2025-02-06 05:30:24,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 05:30:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 300 transitions. [2025-02-06 05:30:24,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 05:30:24,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:24,677 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1] [2025-02-06 05:30:24,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 05:30:24,677 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:24,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:24,677 INFO L85 PathProgramCache]: Analyzing trace with hash 280196838, now seen corresponding path program 1 times [2025-02-06 05:30:24,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:24,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192936447] [2025-02-06 05:30:24,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:24,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:30:25,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 05:30:25,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 05:30:25,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:25,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-06 05:30:25,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:30:25,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192936447] [2025-02-06 05:30:25,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192936447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:30:25,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:30:25,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:30:25,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601216217] [2025-02-06 05:30:25,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:30:25,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:30:25,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:30:25,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:30:25,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:30:25,743 INFO L87 Difference]: Start difference. First operand 253 states and 300 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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) [2025-02-06 05:30:29,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:30:29,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:30:29,934 INFO L93 Difference]: Finished difference Result 257 states and 303 transitions. [2025-02-06 05:30:29,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:30:29,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 140 [2025-02-06 05:30:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:30:29,936 INFO L225 Difference]: With dead ends: 257 [2025-02-06 05:30:29,936 INFO L226 Difference]: Without dead ends: 233 [2025-02-06 05:30:29,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:30:29,936 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 187 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:30:29,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 436 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 05:30:29,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-06 05:30:29,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2025-02-06 05:30:29,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 187 states have (on average 1.160427807486631) internal successors, (217), 186 states have internal predecessors, (217), 25 states have call successors, (25), 16 states have call predecessors, (25), 18 states have return successors, (30), 28 states have call predecessors, (30), 24 states have call successors, (30) [2025-02-06 05:30:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 272 transitions. [2025-02-06 05:30:29,943 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 272 transitions. Word has length 140 [2025-02-06 05:30:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:30:29,943 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 272 transitions. [2025-02-06 05:30:29,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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) [2025-02-06 05:30:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 272 transitions. [2025-02-06 05:30:29,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 05:30:29,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:29,944 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:30:29,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 05:30:29,944 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:29,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:29,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1006747358, now seen corresponding path program 1 times [2025-02-06 05:30:29,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:29,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150489698] [2025-02-06 05:30:29,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:29,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:30:30,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 05:30:30,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 05:30:30,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:30,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-06 05:30:30,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:30:30,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150489698] [2025-02-06 05:30:30,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150489698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:30:30,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:30:30,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:30:30,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543032540] [2025-02-06 05:30:30,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:30:30,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:30:30,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:30:30,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:30:30,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:30:30,957 INFO L87 Difference]: Start difference. First operand 231 states and 272 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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) [2025-02-06 05:30:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:30:31,031 INFO L93 Difference]: Finished difference Result 251 states and 290 transitions. [2025-02-06 05:30:31,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:30:31,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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 153 [2025-02-06 05:30:31,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:30:31,033 INFO L225 Difference]: With dead ends: 251 [2025-02-06 05:30:31,033 INFO L226 Difference]: Without dead ends: 241 [2025-02-06 05:30:31,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:30:31,033 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 181 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:30:31,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 353 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:30:31,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-02-06 05:30:31,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 231. [2025-02-06 05:30:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 187 states have (on average 1.1550802139037433) internal successors, (216), 186 states have internal predecessors, (216), 25 states have call successors, (25), 16 states have call predecessors, (25), 18 states have return successors, (30), 28 states have call predecessors, (30), 24 states have call successors, (30) [2025-02-06 05:30:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 271 transitions. [2025-02-06 05:30:31,040 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 271 transitions. Word has length 153 [2025-02-06 05:30:31,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:30:31,041 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 271 transitions. [2025-02-06 05:30:31,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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) [2025-02-06 05:30:31,041 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 271 transitions. [2025-02-06 05:30:31,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 05:30:31,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:31,042 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:30:31,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 05:30:31,042 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:31,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:31,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1970609944, now seen corresponding path program 1 times [2025-02-06 05:30:31,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:31,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56118009] [2025-02-06 05:30:31,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:31,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:30:31,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 05:30:31,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 05:30:31,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:31,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-06 05:30:32,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:30:32,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56118009] [2025-02-06 05:30:32,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56118009] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:30:32,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260717926] [2025-02-06 05:30:32,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:32,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:30:32,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:30:32,058 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:30:32,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 05:30:33,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 05:30:33,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 05:30:33,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:33,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:33,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 2375 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 05:30:33,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:30:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-06 05:30:33,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:30:33,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260717926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:30:33,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:30:33,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-06 05:30:33,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993418537] [2025-02-06 05:30:33,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:30:33,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:30:33,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:30:33,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:30:33,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:30:33,986 INFO L87 Difference]: Start difference. First operand 231 states and 271 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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) [2025-02-06 05:30:34,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:30:34,105 INFO L93 Difference]: Finished difference Result 314 states and 377 transitions. [2025-02-06 05:30:34,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:30:34,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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 158 [2025-02-06 05:30:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:30:34,106 INFO L225 Difference]: With dead ends: 314 [2025-02-06 05:30:34,106 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 05:30:34,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:30:34,107 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 49 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:30:34,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 343 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:30:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 05:30:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 05:30:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 05:30:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 05:30:34,108 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2025-02-06 05:30:34,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:30:34,108 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 05:30:34,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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) [2025-02-06 05:30:34,108 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 05:30:34,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 05:30:34,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 05:30:34,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 05:30:34,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 05:30:34,316 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:30:34,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 05:30:36,178 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 05:30:36,191 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_kbtab_driver_usb_driver~0 [2025-02-06 05:30:36,191 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~error~0 [2025-02-06 05:30:36,194 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_kbtab_driver_usb_driver~0 [2025-02-06 05:30:36,194 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~error~0 [2025-02-06 05:30:36,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_kbtab_driver_usb_driver~0 [2025-02-06 05:30:36,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~error~0 [2025-02-06 05:30:36,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 05:30:36 BoogieIcfgContainer [2025-02-06 05:30:36,206 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 05:30:36,207 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 05:30:36,207 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 05:30:36,207 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 05:30:36,208 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:29:49" (3/4) ... [2025-02-06 05:30:36,209 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 05:30:36,215 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2025-02-06 05:30:36,215 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure dev_get_drvdata [2025-02-06 05:30:36,215 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kfree [2025-02-06 05:30:36,216 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2025-02-06 05:30:36,216 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2025-02-06 05:30:36,216 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printk [2025-02-06 05:30:36,216 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2025-02-06 05:30:36,216 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure input_set_abs_params [2025-02-06 05:30:36,216 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2025-02-06 05:30:36,216 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-02-06 05:30:36,216 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kzalloc [2025-02-06 05:30:36,216 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2025-02-06 05:30:36,216 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2025-02-06 05:30:36,216 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2025-02-06 05:30:36,216 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2025-02-06 05:30:36,233 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 69 nodes and edges [2025-02-06 05:30:36,235 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2025-02-06 05:30:36,236 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-06 05:30:36,237 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 05:30:36,238 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 05:30:36,239 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 05:30:36,265 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state) && (1 <= \old(ldv_urb_state))) && ((ldv_coherent_state == 0) || (1 <= ldv_coherent_state))) [2025-02-06 05:30:36,266 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 <= ldv_coherent_state) && (1 <= \old(ldv_coherent_state))) [2025-02-06 05:30:36,396 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 <= ldv_coherent_state) && (1 <= \old(ldv_coherent_state))) [2025-02-06 05:30:36,396 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_urb_state) && (1 <= \old(ldv_urb_state))) && ((ldv_coherent_state == 0) || (1 <= ldv_coherent_state))) [2025-02-06 05:30:36,458 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 05:30:36,458 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 05:30:36,458 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 05:30:36,459 INFO L158 Benchmark]: Toolchain (without parser) took 53026.83ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 118.4MB in the beginning and 85.6MB in the end (delta: 32.8MB). Peak memory consumption was 115.9MB. Max. memory is 16.1GB. [2025-02-06 05:30:36,459 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 05:30:36,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 863.38ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 46.0MB in the end (delta: 72.4MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-06 05:30:36,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.11ms. Allocated memory is still 167.8MB. Free memory was 46.0MB in the beginning and 39.9MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 05:30:36,459 INFO L158 Benchmark]: Boogie Preprocessor took 155.63ms. Allocated memory is still 167.8MB. Free memory was 39.9MB in the beginning and 103.6MB in the end (delta: -63.8MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2025-02-06 05:30:36,459 INFO L158 Benchmark]: IcfgBuilder took 5199.35ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 87.0MB in the end (delta: 16.6MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-06 05:30:36,459 INFO L158 Benchmark]: TraceAbstraction took 46475.30ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 87.0MB in the beginning and 114.7MB in the end (delta: -27.7MB). Peak memory consumption was 545.7MB. Max. memory is 16.1GB. [2025-02-06 05:30:36,459 INFO L158 Benchmark]: Witness Printer took 251.46ms. Allocated memory is still 251.7MB. Free memory was 114.7MB in the beginning and 85.6MB in the end (delta: 29.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 05:30:36,460 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 863.38ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 46.0MB in the end (delta: 72.4MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.11ms. Allocated memory is still 167.8MB. Free memory was 46.0MB in the beginning and 39.9MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 155.63ms. Allocated memory is still 167.8MB. Free memory was 39.9MB in the beginning and 103.6MB in the end (delta: -63.8MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * IcfgBuilder took 5199.35ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 87.0MB in the end (delta: 16.6MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * TraceAbstraction took 46475.30ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 87.0MB in the beginning and 114.7MB in the end (delta: -27.7MB). Peak memory consumption was 545.7MB. Max. memory is 16.1GB. * Witness Printer took 251.46ms. Allocated memory is still 251.7MB. Free memory was 114.7MB in the beginning and 85.6MB in the end (delta: 29.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_s_kbtab_driver_usb_driver~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~error~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_s_kbtab_driver_usb_driver~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~error~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_s_kbtab_driver_usb_driver~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~error~0 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4049]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 208 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.5s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 1352 SdHoareTripleChecker+Valid, 14.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1334 mSDsluCounter, 13549 SdHoareTripleChecker+Invalid, 13.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10007 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1136 IncrementalHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 3542 mSDtfsCounter, 1136 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 701 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=608occurred in iteration=3, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 131 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 2082 NumberOfCodeBlocks, 2051 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2152 ConstructedInterpolants, 0 QuantifiedInterpolants, 3389 SizeOfPredicates, 4 NumberOfNonLiveVariables, 8884 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 560/617 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 3454]: Location Invariant Derived location invariant: (((1 <= ldv_urb_state) && (1 <= ldv_coherent_state)) && (0 == res_kbtab_probe_3)) - InvariantResult [Line: 4072]: Location Invariant Derived location invariant: (((ldv_coherent_state == 0) && (0 == res_kbtab_probe_3)) && (ldv_urb_state == 0)) - InvariantResult [Line: 4154]: Location Invariant Derived location invariant: (((1 <= ldv_urb_state) && (1 <= \old(ldv_urb_state))) && ((ldv_coherent_state == 0) || (1 <= ldv_coherent_state))) - InvariantResult [Line: 3980]: Location Invariant Derived location invariant: (((((1 <= ldv_urb_state) && (1 <= ldv_coherent_state)) && (0 == res_kbtab_probe_3)) && (1 <= ldv_s_kbtab_driver_usb_driver)) || ((((ldv_coherent_state == 0) && (0 == res_kbtab_probe_3)) && (ldv_urb_state == 0)) && (ldv_s_kbtab_driver_usb_driver == 0))) - InvariantResult [Line: 4097]: Location Invariant Derived location invariant: ((1 <= ldv_coherent_state) && (1 <= \old(ldv_coherent_state))) - InvariantResult [Line: 4129]: Location Invariant Derived location invariant: (((1 <= ldv_coherent_state) && (0 == res_kbtab_probe_3)) && (ldv_urb_state == 0)) RESULT: Ultimate proved your program to be correct! [2025-02-06 05:30:36,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE