./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 8cac8187c908783c6da6279dd5046ee81ec4fe5bbaff4f4fff097111c44b0a84 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 19:18:52,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:18:52,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 19:18:52,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:18:52,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:18:52,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:18:52,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:18:52,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:18:52,714 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:18:52,714 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:18:52,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:18:52,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:18:52,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:18:52,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:18:52,715 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:18:52,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:18:52,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:18:52,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:18:52,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:18:52,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:18:52,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:18:52,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:18:52,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:18:52,716 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:18:52,717 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:18:52,717 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:18:52,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:18:52,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:18:52,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:18:52,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:18:52,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:18:52,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:18:52,718 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:18:52,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:18:52,718 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:18:52,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:18:52,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:18:52,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:18:52,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:18:52,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:18:52,718 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/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 -> 8cac8187c908783c6da6279dd5046ee81ec4fe5bbaff4f4fff097111c44b0a84 [2025-03-08 19:18:52,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:18:52,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:18:52,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:18:52,981 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:18:52,982 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:18:52,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2025-03-08 19:18:54,136 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b30e98f3/5a01ea2aae7942379d983c1127113a5e/FLAG35a4317f2 [2025-03-08 19:18:54,441 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:18:54,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2025-03-08 19:18:54,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b30e98f3/5a01ea2aae7942379d983c1127113a5e/FLAG35a4317f2 [2025-03-08 19:18:54,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b30e98f3/5a01ea2aae7942379d983c1127113a5e [2025-03-08 19:18:54,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:18:54,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:18:54,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:18:54,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:18:54,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:18:54,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:18:54" (1/1) ... [2025-03-08 19:18:54,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32014c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:54, skipping insertion in model container [2025-03-08 19:18:54,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:18:54" (1/1) ... [2025-03-08 19:18:54,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:18:54,772 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2025-03-08 19:18:54,773 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2025-03-08 19:18:54,838 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2025-03-08 19:18:54,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:18:55,010 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:18:55,055 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2025-03-08 19:18:55,055 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2025-03-08 19:18:55,057 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [1855] [2025-03-08 19:18:55,063 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1858] [2025-03-08 19:18:55,063 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1861] [2025-03-08 19:18:55,063 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1864] [2025-03-08 19:18:55,065 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; incl %0": "+m" (v->counter)); [1902] [2025-03-08 19:18:55,068 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2025-03-08 19:18:55,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:18:55,126 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:18:55,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55 WrapperNode [2025-03-08 19:18:55,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:18:55,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:18:55,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:18:55,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:18:55,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 19:18:55,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 19:18:55,188 INFO L138 Inliner]: procedures = 114, calls = 293, calls flagged for inlining = 50, calls inlined = 38, statements flattened = 930 [2025-03-08 19:18:55,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:18:55,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:18:55,189 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:18:55,189 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:18:55,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 19:18:55,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 19:18:55,201 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 19:18:55,233 INFO L175 MemorySlicer]: Split 79 memory accesses to 14 slices as follows [2, 2, 12, 0, 5, 12, 1, 10, 4, 1, 1, 24, 4, 1]. 30 percent of accesses are in the largest equivalence class. The 55 initializations are split as follows [2, 1, 1, 0, 0, 12, 0, 10, 4, 1, 1, 18, 4, 1]. The 9 writes are split as follows [0, 0, 4, 0, 3, 0, 1, 0, 0, 0, 0, 1, 0, 0]. [2025-03-08 19:18:55,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 19:18:55,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 19:18:55,260 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 19:18:55,264 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 19:18:55,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 19:18:55,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 19:18:55,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:18:55,287 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:18:55,287 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:18:55,287 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:18:55,288 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (1/1) ... [2025-03-08 19:18:55,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:18:55,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:18:55,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 19:18:55,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 19:18:55,329 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2025-03-08 19:18:55,330 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2025-03-08 19:18:55,330 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2025-03-08 19:18:55,330 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2025-03-08 19:18:55,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 19:18:55,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 19:18:55,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 19:18:55,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 19:18:55,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 19:18:55,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 19:18:55,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 19:18:55,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 19:18:55,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 19:18:55,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 19:18:55,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 19:18:55,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 19:18:55,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 19:18:55,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 19:18:55,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 19:18:55,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 19:18:55,332 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2025-03-08 19:18:55,332 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2025-03-08 19:18:55,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2025-03-08 19:18:55,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2025-03-08 19:18:55,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 19:18:55,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 19:18:55,334 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2025-03-08 19:18:55,334 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2025-03-08 19:18:55,334 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2025-03-08 19:18:55,334 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2025-03-08 19:18:55,334 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-03-08 19:18:55,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-03-08 19:18:55,334 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-08 19:18:55,334 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-08 19:18:55,334 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2025-03-08 19:18:55,334 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2025-03-08 19:18:55,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:18:55,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:18:55,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:18:55,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:18:55,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:18:55,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:18:55,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 19:18:55,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 19:18:55,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 19:18:55,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 19:18:55,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 19:18:55,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 19:18:55,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 19:18:55,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 19:18:55,335 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:18:55,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:18:55,335 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2025-03-08 19:18:55,335 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2025-03-08 19:18:55,335 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2025-03-08 19:18:55,335 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2025-03-08 19:18:55,335 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2025-03-08 19:18:55,335 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2025-03-08 19:18:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 19:18:55,336 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 19:18:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:18:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2025-03-08 19:18:55,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2025-03-08 19:18:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:18:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2025-03-08 19:18:55,336 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2025-03-08 19:18:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:18:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:18:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:18:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:18:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:18:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:18:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 19:18:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 19:18:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 19:18:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 19:18:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 19:18:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2025-03-08 19:18:55,337 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2025-03-08 19:18:55,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2025-03-08 19:18:55,337 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2025-03-08 19:18:55,337 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2025-03-08 19:18:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 19:18:55,338 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 19:18:55,338 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-08 19:18:55,338 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-08 19:18:55,338 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2025-03-08 19:18:55,338 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2025-03-08 19:18:55,338 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2025-03-08 19:18:55,338 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2025-03-08 19:18:55,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:18:55,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:18:55,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:18:55,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:18:55,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:18:55,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:18:55,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 19:18:55,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 19:18:55,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 19:18:55,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 19:18:55,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 19:18:55,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 19:18:55,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 19:18:55,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 19:18:55,341 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-08 19:18:55,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-08 19:18:55,341 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2025-03-08 19:18:55,341 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2025-03-08 19:18:55,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:18:55,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:18:55,565 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:18:55,567 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:18:55,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 19:18:55,635 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970: havoc #t~nondet158; [2025-03-08 19:18:55,675 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3057: havoc #t~nondet175; [2025-03-08 19:18:55,703 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3031: havoc torture_cleanup_#t~nondet170#1; [2025-03-08 19:18:55,703 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896: havoc atomic_read_#t~mem13#1; [2025-03-08 19:18:55,703 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049: havoc torture_onoff_failures_#t~nondet173#1; [2025-03-08 19:18:55,806 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3013: havoc #t~nondet167; [2025-03-08 19:18:55,817 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1937: havoc __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset; [2025-03-08 19:18:56,094 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2994: havoc ldv_probe_3_#t~nondet162#1; [2025-03-08 19:18:56,095 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3061: havoc torture_shuffle_init_#t~nondet176#1; [2025-03-08 19:18:56,095 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2418: call ULTIMATE.dealloc(lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset);havoc lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset; [2025-03-08 19:18:56,096 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2998: havoc ldv_release_1_#t~nondet163#1; [2025-03-08 19:18:56,096 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc __bitmap_weight_#t~nondet157#1; [2025-03-08 19:18:56,096 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3068: havoc torture_shutdown_init_#t~nondet177#1; [2025-03-08 19:18:56,096 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3002: havoc ldv_release_2_#t~nondet164#1; [2025-03-08 19:18:56,096 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3035: havoc torture_init_begin_#t~nondet171#1; [2025-03-08 19:18:56,096 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2986: havoc ldv_probe_1_#t~nondet160#1; [2025-03-08 19:18:56,096 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3053: havoc torture_onoff_init_#t~nondet174#1; [2025-03-08 19:18:56,096 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3072: havoc torture_stutter_init_#t~nondet178#1; [2025-03-08 19:18:56,096 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3006: havoc ldv_release_3_#t~nondet165#1; [2025-03-08 19:18:56,096 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2990: havoc ldv_probe_2_#t~nondet161#1; [2025-03-08 19:18:56,205 INFO L? ?]: Removed 301 outVars from TransFormulas that were not future-live. [2025-03-08 19:18:56,205 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:18:56,227 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:18:56,227 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 19:18:56,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:18:56 BoogieIcfgContainer [2025-03-08 19:18:56,228 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:18:56,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:18:56,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:18:56,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:18:56,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:18:54" (1/3) ... [2025-03-08 19:18:56,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6594fbe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:18:56, skipping insertion in model container [2025-03-08 19:18:56,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:18:55" (2/3) ... [2025-03-08 19:18:56,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6594fbe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:18:56, skipping insertion in model container [2025-03-08 19:18:56,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:18:56" (3/3) ... [2025-03-08 19:18:56,237 INFO L128 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2025-03-08 19:18:56,248 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:18:56,250 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i that has 29 procedures, 373 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 19:18:56,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:18:56,330 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;@43b655a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:18:56,330 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 19:18:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 372 states, 273 states have (on average 1.3992673992673992) internal successors, (382), 289 states have internal predecessors, (382), 70 states have call successors, (70), 28 states have call predecessors, (70), 27 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-08 19:18:56,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 19:18:56,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:18:56,345 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:18:56,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:18:56,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:18:56,351 INFO L85 PathProgramCache]: Analyzing trace with hash -563041101, now seen corresponding path program 1 times [2025-03-08 19:18:56,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:18:56,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738239124] [2025-03-08 19:18:56,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:18:56,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:18:56,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 19:18:56,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 19:18:56,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:18:56,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:18:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 19:18:56,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:18:56,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738239124] [2025-03-08 19:18:56,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738239124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:18:56,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:18:56,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:18:56,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875341322] [2025-03-08 19:18:56,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:18:56,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:18:56,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:18:56,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:18:56,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:18:56,779 INFO L87 Difference]: Start difference. First operand has 372 states, 273 states have (on average 1.3992673992673992) internal successors, (382), 289 states have internal predecessors, (382), 70 states have call successors, (70), 28 states have call predecessors, (70), 27 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 19:18:56,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:18:56,898 INFO L93 Difference]: Finished difference Result 999 states and 1405 transitions. [2025-03-08 19:18:56,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:18:56,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2025-03-08 19:18:56,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:18:56,908 INFO L225 Difference]: With dead ends: 999 [2025-03-08 19:18:56,908 INFO L226 Difference]: Without dead ends: 557 [2025-03-08 19:18:56,916 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-03-08 19:18:56,918 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 476 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:18:56,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 900 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:18:56,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-08 19:18:56,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 554. [2025-03-08 19:18:56,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 417 states have (on average 1.3741007194244603) internal successors, (573), 428 states have internal predecessors, (573), 95 states have call successors, (95), 46 states have call predecessors, (95), 41 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-08 19:18:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 758 transitions. [2025-03-08 19:18:56,983 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 758 transitions. Word has length 46 [2025-03-08 19:18:56,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:18:56,984 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 758 transitions. [2025-03-08 19:18:56,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 19:18:56,984 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 758 transitions. [2025-03-08 19:18:56,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 19:18:56,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:18:56,988 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:18:56,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 19:18:56,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:18:56,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:18:56,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1305180118, now seen corresponding path program 1 times [2025-03-08 19:18:56,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:18:56,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291190260] [2025-03-08 19:18:56,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:18:56,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:18:57,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 19:18:57,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 19:18:57,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:18:57,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:18:57,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 19:18:57,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:18:57,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291190260] [2025-03-08 19:18:57,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291190260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:18:57,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:18:57,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:18:57,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631987228] [2025-03-08 19:18:57,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:18:57,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:18:57,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:18:57,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:18:57,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:18:57,133 INFO L87 Difference]: Start difference. First operand 554 states and 758 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 19:18:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:18:57,169 INFO L93 Difference]: Finished difference Result 559 states and 763 transitions. [2025-03-08 19:18:57,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:18:57,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2025-03-08 19:18:57,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:18:57,173 INFO L225 Difference]: With dead ends: 559 [2025-03-08 19:18:57,173 INFO L226 Difference]: Without dead ends: 555 [2025-03-08 19:18:57,174 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-03-08 19:18:57,174 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 0 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:18:57,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 981 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:18:57,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-08 19:18:57,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2025-03-08 19:18:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 418 states have (on average 1.3708133971291867) internal successors, (573), 429 states have internal predecessors, (573), 95 states have call successors, (95), 46 states have call predecessors, (95), 41 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-08 19:18:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 758 transitions. [2025-03-08 19:18:57,212 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 758 transitions. Word has length 55 [2025-03-08 19:18:57,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:18:57,213 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 758 transitions. [2025-03-08 19:18:57,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 19:18:57,213 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 758 transitions. [2025-03-08 19:18:57,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 19:18:57,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:18:57,218 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:18:57,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:18:57,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:18:57,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:18:57,219 INFO L85 PathProgramCache]: Analyzing trace with hash -134509526, now seen corresponding path program 1 times [2025-03-08 19:18:57,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:18:57,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453391631] [2025-03-08 19:18:57,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:18:57,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:18:57,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 19:18:57,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 19:18:57,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:18:57,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:18:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 19:18:57,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:18:57,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453391631] [2025-03-08 19:18:57,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453391631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:18:57,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:18:57,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:18:57,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925023960] [2025-03-08 19:18:57,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:18:57,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:18:57,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:18:57,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:18:57,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:18:57,484 INFO L87 Difference]: Start difference. First operand 555 states and 758 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 19:18:57,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:18:57,594 INFO L93 Difference]: Finished difference Result 1550 states and 2170 transitions. [2025-03-08 19:18:57,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:18:57,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2025-03-08 19:18:57,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:18:57,602 INFO L225 Difference]: With dead ends: 1550 [2025-03-08 19:18:57,603 INFO L226 Difference]: Without dead ends: 991 [2025-03-08 19:18:57,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:18:57,606 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 441 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:18:57,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1435 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:18:57,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-03-08 19:18:57,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 957. [2025-03-08 19:18:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 734 states have (on average 1.4087193460490464) internal successors, (1034), 754 states have internal predecessors, (1034), 156 states have call successors, (156), 71 states have call predecessors, (156), 66 states have return successors, (152), 143 states have call predecessors, (152), 151 states have call successors, (152) [2025-03-08 19:18:57,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1342 transitions. [2025-03-08 19:18:57,663 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1342 transitions. Word has length 57 [2025-03-08 19:18:57,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:18:57,664 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1342 transitions. [2025-03-08 19:18:57,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 19:18:57,666 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1342 transitions. [2025-03-08 19:18:57,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 19:18:57,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:18:57,673 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:18:57,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:18:57,673 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:18:57,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:18:57,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1578928362, now seen corresponding path program 1 times [2025-03-08 19:18:57,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:18:57,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775196284] [2025-03-08 19:18:57,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:18:57,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:18:57,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 19:18:57,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 19:18:57,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:18:57,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:18:57,784 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 19:18:57,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:18:57,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775196284] [2025-03-08 19:18:57,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775196284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:18:57,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:18:57,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:18:57,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930311559] [2025-03-08 19:18:57,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:18:57,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:18:57,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:18:57,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:18:57,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:18:57,787 INFO L87 Difference]: Start difference. First operand 957 states and 1342 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 19:18:57,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:18:57,893 INFO L93 Difference]: Finished difference Result 2719 states and 3806 transitions. [2025-03-08 19:18:57,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:18:57,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 72 [2025-03-08 19:18:57,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:18:57,904 INFO L225 Difference]: With dead ends: 2719 [2025-03-08 19:18:57,907 INFO L226 Difference]: Without dead ends: 1782 [2025-03-08 19:18:57,911 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-03-08 19:18:57,911 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 441 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:18:57,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 986 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:18:57,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2025-03-08 19:18:58,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1750. [2025-03-08 19:18:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1341 states have (on average 1.4049217002237135) internal successors, (1884), 1381 states have internal predecessors, (1884), 283 states have call successors, (283), 130 states have call predecessors, (283), 125 states have return successors, (280), 262 states have call predecessors, (280), 278 states have call successors, (280) [2025-03-08 19:18:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2447 transitions. [2025-03-08 19:18:58,023 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2447 transitions. Word has length 72 [2025-03-08 19:18:58,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:18:58,024 INFO L471 AbstractCegarLoop]: Abstraction has 1750 states and 2447 transitions. [2025-03-08 19:18:58,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 19:18:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2447 transitions. [2025-03-08 19:18:58,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 19:18:58,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:18:58,032 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-08 19:18:58,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:18:58,033 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:18:58,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:18:58,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1375523646, now seen corresponding path program 1 times [2025-03-08 19:18:58,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:18:58,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404419356] [2025-03-08 19:18:58,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:18:58,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:18:58,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 19:18:58,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 19:18:58,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:18:58,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:18:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 19:18:58,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:18:58,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404419356] [2025-03-08 19:18:58,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404419356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:18:58,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:18:58,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:18:58,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071592059] [2025-03-08 19:18:58,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:18:58,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:18:58,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:18:58,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:18:58,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:18:58,131 INFO L87 Difference]: Start difference. First operand 1750 states and 2447 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 19:18:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:18:58,199 INFO L93 Difference]: Finished difference Result 3484 states and 4879 transitions. [2025-03-08 19:18:58,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:18:58,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 76 [2025-03-08 19:18:58,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:18:58,210 INFO L225 Difference]: With dead ends: 3484 [2025-03-08 19:18:58,211 INFO L226 Difference]: Without dead ends: 1754 [2025-03-08 19:18:58,215 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-03-08 19:18:58,216 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 0 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:18:58,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 981 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:18:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2025-03-08 19:18:58,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1754. [2025-03-08 19:18:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 1345 states have (on average 1.4037174721189591) internal successors, (1888), 1385 states have internal predecessors, (1888), 283 states have call successors, (283), 130 states have call predecessors, (283), 125 states have return successors, (280), 262 states have call predecessors, (280), 278 states have call successors, (280) [2025-03-08 19:18:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2451 transitions. [2025-03-08 19:18:58,309 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2451 transitions. Word has length 76 [2025-03-08 19:18:58,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:18:58,309 INFO L471 AbstractCegarLoop]: Abstraction has 1754 states and 2451 transitions. [2025-03-08 19:18:58,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 19:18:58,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2451 transitions. [2025-03-08 19:18:58,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 19:18:58,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:18:58,313 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-08 19:18:58,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 19:18:58,314 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:18:58,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:18:58,315 INFO L85 PathProgramCache]: Analyzing trace with hash 595415811, now seen corresponding path program 1 times [2025-03-08 19:18:58,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:18:58,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744424916] [2025-03-08 19:18:58,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:18:58,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:18:58,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 19:18:58,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 19:18:58,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:18:58,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:18:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 19:18:58,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:18:58,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744424916] [2025-03-08 19:18:58,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744424916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:18:58,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:18:58,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:18:58,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604075981] [2025-03-08 19:18:58,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:18:58,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:18:58,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:18:58,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:18:58,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:18:58,426 INFO L87 Difference]: Start difference. First operand 1754 states and 2451 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 19:18:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:18:58,517 INFO L93 Difference]: Finished difference Result 3500 states and 4895 transitions. [2025-03-08 19:18:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:18:58,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 76 [2025-03-08 19:18:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:18:58,534 INFO L225 Difference]: With dead ends: 3500 [2025-03-08 19:18:58,534 INFO L226 Difference]: Without dead ends: 1706 [2025-03-08 19:18:58,538 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-03-08 19:18:58,539 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 1 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:18:58,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1468 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:18:58,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2025-03-08 19:18:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1702. [2025-03-08 19:18:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1313 states have (on average 1.4044173648134044) internal successors, (1844), 1353 states have internal predecessors, (1844), 263 states have call successors, (263), 130 states have call predecessors, (263), 125 states have return successors, (260), 242 states have call predecessors, (260), 258 states have call successors, (260) [2025-03-08 19:18:58,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2367 transitions. [2025-03-08 19:18:58,600 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2367 transitions. Word has length 76 [2025-03-08 19:18:58,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:18:58,601 INFO L471 AbstractCegarLoop]: Abstraction has 1702 states and 2367 transitions. [2025-03-08 19:18:58,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 19:18:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2367 transitions. [2025-03-08 19:18:58,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 19:18:58,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:18:58,603 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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-03-08 19:18:58,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 19:18:58,603 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:18:58,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:18:58,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1227747378, now seen corresponding path program 1 times [2025-03-08 19:18:58,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:18:58,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093962114] [2025-03-08 19:18:58,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:18:58,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:18:58,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 19:18:58,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 19:18:58,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:18:58,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:18:58,662 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 19:18:58,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:18:58,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093962114] [2025-03-08 19:18:58,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093962114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:18:58,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:18:58,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:18:58,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28077058] [2025-03-08 19:18:58,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:18:58,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:18:58,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:18:58,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:18:58,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:18:58,664 INFO L87 Difference]: Start difference. First operand 1702 states and 2367 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 19:18:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:18:58,798 INFO L93 Difference]: Finished difference Result 4771 states and 6619 transitions. [2025-03-08 19:18:58,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:18:58,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 78 [2025-03-08 19:18:58,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:18:58,814 INFO L225 Difference]: With dead ends: 4771 [2025-03-08 19:18:58,814 INFO L226 Difference]: Without dead ends: 3089 [2025-03-08 19:18:58,820 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-03-08 19:18:58,820 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 415 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:18:58,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 986 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:18:58,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2025-03-08 19:18:58,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 3057. [2025-03-08 19:18:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3057 states, 2355 states have (on average 1.3995753715498938) internal successors, (3296), 2431 states have internal predecessors, (3296), 468 states have call successors, (468), 238 states have call predecessors, (468), 233 states have return successors, (467), 431 states have call predecessors, (467), 463 states have call successors, (467) [2025-03-08 19:18:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3057 states to 3057 states and 4231 transitions. [2025-03-08 19:18:58,961 INFO L78 Accepts]: Start accepts. Automaton has 3057 states and 4231 transitions. Word has length 78 [2025-03-08 19:18:58,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:18:58,961 INFO L471 AbstractCegarLoop]: Abstraction has 3057 states and 4231 transitions. [2025-03-08 19:18:58,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 19:18:58,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3057 states and 4231 transitions. [2025-03-08 19:18:58,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 19:18:58,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:18:58,965 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 19:18:58,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 19:18:58,965 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:18:58,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:18:58,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1789477608, now seen corresponding path program 1 times [2025-03-08 19:18:58,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:18:58,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253747695] [2025-03-08 19:18:58,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:18:58,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:18:58,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 19:18:58,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 19:18:58,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:18:58,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:18:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 19:18:59,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:18:59,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253747695] [2025-03-08 19:18:59,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253747695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:18:59,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:18:59,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:18:59,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128522272] [2025-03-08 19:18:59,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:18:59,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:18:59,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:18:59,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:18:59,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:18:59,073 INFO L87 Difference]: Start difference. First operand 3057 states and 4231 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 19:18:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:18:59,171 INFO L93 Difference]: Finished difference Result 6094 states and 8439 transitions. [2025-03-08 19:18:59,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:18:59,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 123 [2025-03-08 19:18:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:18:59,187 INFO L225 Difference]: With dead ends: 6094 [2025-03-08 19:18:59,187 INFO L226 Difference]: Without dead ends: 3057 [2025-03-08 19:18:59,194 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-03-08 19:18:59,194 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 452 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:18:59,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 472 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:18:59,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2025-03-08 19:18:59,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 3057. [2025-03-08 19:18:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3057 states, 2355 states have (on average 1.3961783439490445) internal successors, (3288), 2431 states have internal predecessors, (3288), 468 states have call successors, (468), 238 states have call predecessors, (468), 233 states have return successors, (467), 431 states have call predecessors, (467), 463 states have call successors, (467) [2025-03-08 19:18:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3057 states to 3057 states and 4223 transitions. [2025-03-08 19:18:59,334 INFO L78 Accepts]: Start accepts. Automaton has 3057 states and 4223 transitions. Word has length 123 [2025-03-08 19:18:59,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:18:59,335 INFO L471 AbstractCegarLoop]: Abstraction has 3057 states and 4223 transitions. [2025-03-08 19:18:59,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 19:18:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3057 states and 4223 transitions. [2025-03-08 19:18:59,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 19:18:59,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:18:59,339 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 19:18:59,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 19:18:59,339 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:18:59,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:18:59,340 INFO L85 PathProgramCache]: Analyzing trace with hash 425058219, now seen corresponding path program 1 times [2025-03-08 19:18:59,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:18:59,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565348782] [2025-03-08 19:18:59,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:18:59,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:18:59,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 19:18:59,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 19:18:59,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:18:59,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:18:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 19:18:59,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:18:59,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565348782] [2025-03-08 19:18:59,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565348782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:18:59,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:18:59,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:18:59,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455881188] [2025-03-08 19:18:59,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:18:59,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:18:59,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:18:59,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:18:59,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:18:59,459 INFO L87 Difference]: Start difference. First operand 3057 states and 4223 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 19:18:59,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:18:59,632 INFO L93 Difference]: Finished difference Result 7666 states and 10623 transitions. [2025-03-08 19:18:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:18:59,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2025-03-08 19:18:59,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:18:59,653 INFO L225 Difference]: With dead ends: 7666 [2025-03-08 19:18:59,653 INFO L226 Difference]: Without dead ends: 4629 [2025-03-08 19:18:59,661 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-03-08 19:18:59,661 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 422 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:18:59,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1233 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:18:59,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4629 states. [2025-03-08 19:18:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4629 to 4593. [2025-03-08 19:18:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4593 states, 3557 states have (on average 1.3910598819229687) internal successors, (4948), 3673 states have internal predecessors, (4948), 687 states have call successors, (687), 353 states have call predecessors, (687), 348 states have return successors, (688), 634 states have call predecessors, (688), 682 states have call successors, (688) [2025-03-08 19:18:59,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4593 states to 4593 states and 6323 transitions. [2025-03-08 19:18:59,859 INFO L78 Accepts]: Start accepts. Automaton has 4593 states and 6323 transitions. Word has length 126 [2025-03-08 19:18:59,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:18:59,859 INFO L471 AbstractCegarLoop]: Abstraction has 4593 states and 6323 transitions. [2025-03-08 19:18:59,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 19:18:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 6323 transitions. [2025-03-08 19:18:59,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 19:18:59,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:18:59,866 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:18:59,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 19:18:59,866 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:18:59,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:18:59,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1898796017, now seen corresponding path program 1 times [2025-03-08 19:18:59,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:18:59,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651794105] [2025-03-08 19:18:59,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:18:59,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:18:59,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 19:18:59,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 19:18:59,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:18:59,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:19:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 19:19:00,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:19:00,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651794105] [2025-03-08 19:19:00,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651794105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:19:00,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:19:00,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:19:00,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563404829] [2025-03-08 19:19:00,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:19:00,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:19:00,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:19:00,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:19:00,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:19:00,009 INFO L87 Difference]: Start difference. First operand 4593 states and 6323 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 19:19:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:19:00,313 INFO L93 Difference]: Finished difference Result 11501 states and 15886 transitions. [2025-03-08 19:19:00,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:19:00,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2025-03-08 19:19:00,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:19:00,346 INFO L225 Difference]: With dead ends: 11501 [2025-03-08 19:19:00,347 INFO L226 Difference]: Without dead ends: 6928 [2025-03-08 19:19:00,357 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-03-08 19:19:00,358 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 416 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:19:00,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1227 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:19:00,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6928 states. [2025-03-08 19:19:00,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6928 to 6890. [2025-03-08 19:19:00,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6890 states, 5362 states have (on average 1.3864229765013054) internal successors, (7434), 5538 states have internal predecessors, (7434), 1008 states have call successors, (1008), 524 states have call predecessors, (1008), 519 states have return successors, (1012), 931 states have call predecessors, (1012), 1003 states have call successors, (1012) [2025-03-08 19:19:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6890 states to 6890 states and 9454 transitions. [2025-03-08 19:19:00,640 INFO L78 Accepts]: Start accepts. Automaton has 6890 states and 9454 transitions. Word has length 132 [2025-03-08 19:19:00,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:19:00,640 INFO L471 AbstractCegarLoop]: Abstraction has 6890 states and 9454 transitions. [2025-03-08 19:19:00,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 19:19:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 6890 states and 9454 transitions. [2025-03-08 19:19:00,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 19:19:00,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:19:00,647 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 19:19:00,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 19:19:00,648 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:19:00,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:19:00,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2026433195, now seen corresponding path program 1 times [2025-03-08 19:19:00,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:19:00,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138834405] [2025-03-08 19:19:00,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:19:00,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:19:00,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 19:19:00,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 19:19:00,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:19:00,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:19:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 19:19:00,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:19:00,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138834405] [2025-03-08 19:19:00,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138834405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:19:00,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574493355] [2025-03-08 19:19:00,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:19:00,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:19:00,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:19:00,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:19:00,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 19:19:01,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 19:19:01,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 19:19:01,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:19:01,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:19:01,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 19:19:01,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:19:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 19:19:01,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:19:01,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574493355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:19:01,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:19:01,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-03-08 19:19:01,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044441740] [2025-03-08 19:19:01,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:19:01,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:19:01,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:19:01,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:19:01,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:19:01,257 INFO L87 Difference]: Start difference. First operand 6890 states and 9454 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 19:19:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:19:01,478 INFO L93 Difference]: Finished difference Result 13868 states and 19047 transitions. [2025-03-08 19:19:01,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:19:01,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 136 [2025-03-08 19:19:01,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:19:01,523 INFO L225 Difference]: With dead ends: 13868 [2025-03-08 19:19:01,523 INFO L226 Difference]: Without dead ends: 6836 [2025-03-08 19:19:01,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 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-03-08 19:19:01,541 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 1 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:19:01,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1855 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:19:01,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6836 states. [2025-03-08 19:19:01,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6836 to 6836. [2025-03-08 19:19:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6836 states, 5308 states have (on average 1.383571966842502) internal successors, (7344), 5493 states have internal predecessors, (7344), 1008 states have call successors, (1008), 524 states have call predecessors, (1008), 519 states have return successors, (1003), 922 states have call predecessors, (1003), 994 states have call successors, (1003) [2025-03-08 19:19:01,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 9355 transitions. [2025-03-08 19:19:01,806 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 9355 transitions. Word has length 136 [2025-03-08 19:19:01,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:19:01,807 INFO L471 AbstractCegarLoop]: Abstraction has 6836 states and 9355 transitions. [2025-03-08 19:19:01,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 19:19:01,807 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 9355 transitions. [2025-03-08 19:19:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 19:19:01,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:19:01,815 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 19:19:01,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 19:19:02,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 19:19:02,018 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:19:02,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:19:02,019 INFO L85 PathProgramCache]: Analyzing trace with hash 629114955, now seen corresponding path program 1 times [2025-03-08 19:19:02,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:19:02,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569510408] [2025-03-08 19:19:02,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:19:02,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:19:02,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 19:19:02,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 19:19:02,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:19:02,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:19:02,187 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 19:19:02,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:19:02,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569510408] [2025-03-08 19:19:02,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569510408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:19:02,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:19:02,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:19:02,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879780912] [2025-03-08 19:19:02,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:19:02,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:19:02,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:19:02,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:19:02,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:19:02,190 INFO L87 Difference]: Start difference. First operand 6836 states and 9355 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 19:19:02,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:19:02,469 INFO L93 Difference]: Finished difference Result 13616 states and 18633 transitions. [2025-03-08 19:19:02,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:19:02,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 138 [2025-03-08 19:19:02,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:19:02,511 INFO L225 Difference]: With dead ends: 13616 [2025-03-08 19:19:02,512 INFO L226 Difference]: Without dead ends: 6800 [2025-03-08 19:19:02,532 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-03-08 19:19:02,533 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 438 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:19:02,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 468 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:19:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6800 states. [2025-03-08 19:19:02,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6800 to 6800. [2025-03-08 19:19:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6800 states, 5272 states have (on average 1.3793626707132018) internal successors, (7272), 5457 states have internal predecessors, (7272), 1008 states have call successors, (1008), 524 states have call predecessors, (1008), 519 states have return successors, (1003), 922 states have call predecessors, (1003), 994 states have call successors, (1003) [2025-03-08 19:19:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6800 states to 6800 states and 9283 transitions. [2025-03-08 19:19:02,884 INFO L78 Accepts]: Start accepts. Automaton has 6800 states and 9283 transitions. Word has length 138 [2025-03-08 19:19:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:19:02,885 INFO L471 AbstractCegarLoop]: Abstraction has 6800 states and 9283 transitions. [2025-03-08 19:19:02,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 19:19:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 6800 states and 9283 transitions. [2025-03-08 19:19:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 19:19:02,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:19:02,892 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 19:19:02,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 19:19:02,892 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:19:02,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:19:02,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1442451023, now seen corresponding path program 1 times [2025-03-08 19:19:02,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:19:02,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240903937] [2025-03-08 19:19:02,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:19:02,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:19:02,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 19:19:02,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 19:19:02,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:19:02,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:19:03,055 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 19:19:03,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:19:03,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240903937] [2025-03-08 19:19:03,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240903937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:19:03,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350749626] [2025-03-08 19:19:03,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:19:03,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:19:03,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:19:03,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:19:03,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 19:19:03,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 19:19:03,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 19:19:03,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:19:03,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:19:03,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:19:03,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:19:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 19:19:03,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:19:03,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350749626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:19:03,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:19:03,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-08 19:19:03,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425928056] [2025-03-08 19:19:03,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:19:03,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:19:03,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:19:03,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:19:03,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:19:03,524 INFO L87 Difference]: Start difference. First operand 6800 states and 9283 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-08 19:19:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:19:04,148 INFO L93 Difference]: Finished difference Result 20334 states and 27771 transitions. [2025-03-08 19:19:04,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:19:04,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 139 [2025-03-08 19:19:04,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:19:04,231 INFO L225 Difference]: With dead ends: 20334 [2025-03-08 19:19:04,231 INFO L226 Difference]: Without dead ends: 20302 [2025-03-08 19:19:04,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 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-03-08 19:19:04,247 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 811 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:19:04,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1658 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:19:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20302 states. [2025-03-08 19:19:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20302 to 20152. [2025-03-08 19:19:04,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20152 states, 15602 states have (on average 1.3833482886809383) internal successors, (21583), 16157 states have internal predecessors, (21583), 3000 states have call successors, (3000), 1554 states have call predecessors, (3000), 1549 states have return successors, (2995), 2752 states have call predecessors, (2995), 2968 states have call successors, (2995) [2025-03-08 19:19:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20152 states to 20152 states and 27578 transitions. [2025-03-08 19:19:05,046 INFO L78 Accepts]: Start accepts. Automaton has 20152 states and 27578 transitions. Word has length 139 [2025-03-08 19:19:05,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:19:05,047 INFO L471 AbstractCegarLoop]: Abstraction has 20152 states and 27578 transitions. [2025-03-08 19:19:05,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-08 19:19:05,047 INFO L276 IsEmpty]: Start isEmpty. Operand 20152 states and 27578 transitions. [2025-03-08 19:19:05,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 19:19:05,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:19:05,070 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:19:05,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 19:19:05,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 19:19:05,271 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:19:05,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:19:05,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1913220436, now seen corresponding path program 1 times [2025-03-08 19:19:05,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:19:05,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877809366] [2025-03-08 19:19:05,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:19:05,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:19:05,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 19:19:05,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 19:19:05,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:19:05,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:19:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 19:19:05,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:19:05,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877809366] [2025-03-08 19:19:05,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877809366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:19:05,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:19:05,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:19:05,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579160882] [2025-03-08 19:19:05,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:19:05,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:19:05,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:19:05,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:19:05,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:19:05,438 INFO L87 Difference]: Start difference. First operand 20152 states and 27578 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 19:19:05,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:19:05,766 INFO L93 Difference]: Finished difference Result 26650 states and 36633 transitions. [2025-03-08 19:19:05,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:19:05,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 148 [2025-03-08 19:19:05,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:19:05,798 INFO L225 Difference]: With dead ends: 26650 [2025-03-08 19:19:05,798 INFO L226 Difference]: Without dead ends: 6331 [2025-03-08 19:19:05,839 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-03-08 19:19:05,839 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 243 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:19:05,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 893 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:19:05,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6331 states. [2025-03-08 19:19:06,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6331 to 6331. [2025-03-08 19:19:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6331 states, 5063 states have (on average 1.4033181907959709) internal successors, (7105), 5186 states have internal predecessors, (7105), 804 states have call successors, (804), 468 states have call predecessors, (804), 463 states have return successors, (799), 784 states have call predecessors, (799), 799 states have call successors, (799) [2025-03-08 19:19:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6331 states to 6331 states and 8708 transitions. [2025-03-08 19:19:06,117 INFO L78 Accepts]: Start accepts. Automaton has 6331 states and 8708 transitions. Word has length 148 [2025-03-08 19:19:06,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:19:06,117 INFO L471 AbstractCegarLoop]: Abstraction has 6331 states and 8708 transitions. [2025-03-08 19:19:06,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 19:19:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 6331 states and 8708 transitions. [2025-03-08 19:19:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 19:19:06,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:19:06,131 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 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-03-08 19:19:06,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 19:19:06,131 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:19:06,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:19:06,132 INFO L85 PathProgramCache]: Analyzing trace with hash -677435229, now seen corresponding path program 1 times [2025-03-08 19:19:06,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:19:06,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285270014] [2025-03-08 19:19:06,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:19:06,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:19:06,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 19:19:06,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 19:19:06,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:19:06,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:19:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 19:19:06,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:19:06,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285270014] [2025-03-08 19:19:06,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285270014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:19:06,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:19:06,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:19:06,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847161986] [2025-03-08 19:19:06,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:19:06,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:19:06,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:19:06,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:19:06,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:19:06,337 INFO L87 Difference]: Start difference. First operand 6331 states and 8708 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 19:19:06,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:19:06,553 INFO L93 Difference]: Finished difference Result 12684 states and 17459 transitions. [2025-03-08 19:19:06,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:19:06,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 148 [2025-03-08 19:19:06,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:19:06,574 INFO L225 Difference]: With dead ends: 12684 [2025-03-08 19:19:06,574 INFO L226 Difference]: Without dead ends: 6373 [2025-03-08 19:19:06,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:19:06,583 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 8 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:19:06,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 890 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:19:06,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6373 states. [2025-03-08 19:19:06,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6373 to 6334. [2025-03-08 19:19:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6334 states, 5066 states have (on average 1.4030793525463876) internal successors, (7108), 5189 states have internal predecessors, (7108), 804 states have call successors, (804), 468 states have call predecessors, (804), 463 states have return successors, (799), 784 states have call predecessors, (799), 799 states have call successors, (799) [2025-03-08 19:19:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6334 states to 6334 states and 8711 transitions. [2025-03-08 19:19:06,772 INFO L78 Accepts]: Start accepts. Automaton has 6334 states and 8711 transitions. Word has length 148 [2025-03-08 19:19:06,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:19:06,772 INFO L471 AbstractCegarLoop]: Abstraction has 6334 states and 8711 transitions. [2025-03-08 19:19:06,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 19:19:06,772 INFO L276 IsEmpty]: Start isEmpty. Operand 6334 states and 8711 transitions. [2025-03-08 19:19:06,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 19:19:06,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:19:06,784 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 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, 1, 1] [2025-03-08 19:19:06,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 19:19:06,785 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:19:06,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:19:06,785 INFO L85 PathProgramCache]: Analyzing trace with hash 577710591, now seen corresponding path program 1 times [2025-03-08 19:19:06,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:19:06,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456251282] [2025-03-08 19:19:06,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:19:06,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:19:06,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 19:19:06,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 19:19:06,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:19:06,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:19:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 19:19:07,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:19:07,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456251282] [2025-03-08 19:19:07,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456251282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:19:07,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:19:07,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:19:07,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497090440] [2025-03-08 19:19:07,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:19:07,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:19:07,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:19:07,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:19:07,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:19:07,111 INFO L87 Difference]: Start difference. First operand 6334 states and 8711 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 19:19:07,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:19:07,204 INFO L93 Difference]: Finished difference Result 6914 states and 9453 transitions. [2025-03-08 19:19:07,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:19:07,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 150 [2025-03-08 19:19:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:19:07,216 INFO L225 Difference]: With dead ends: 6914 [2025-03-08 19:19:07,216 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 19:19:07,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:19:07,224 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 262 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:19:07,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 773 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:19:07,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 19:19:07,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 19:19:07,225 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-03-08 19:19:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 19:19:07,233 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 150 [2025-03-08 19:19:07,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:19:07,233 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 19:19:07,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 19:19:07,233 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 19:19:07,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 19:19:07,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 19:19:07,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 19:19:07,237 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:19:07,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 19:19:11,409 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 19:19:11,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 07:19:11 BoogieIcfgContainer [2025-03-08 19:19:11,425 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 19:19:11,425 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 19:19:11,425 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 19:19:11,425 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 19:19:11,426 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:18:56" (3/4) ... [2025-03-08 19:19:11,428 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 19:19:11,433 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure _torture_stop_kthread [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kfree [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_delay [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printk [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_lock_spin_write_unlock_irq [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __const_udelay [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_lock [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kmalloc [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_random [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure lock_torture_stats_print [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_unlock [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure lock_torture_print_module_parms [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_delay [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure lock_torture_cleanup [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_init_end [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_spin_unlock [2025-03-08 19:19:11,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_spin_lock [2025-03-08 19:19:11,435 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock_irq [2025-03-08 19:19:11,435 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-03-08 19:19:11,435 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure _torture_create_kthread [2025-03-08 19:19:11,435 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock [2025-03-08 19:19:11,435 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~~TO~VOID [2025-03-08 19:19:11,435 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2025-03-08 19:19:11,435 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_unlock [2025-03-08 19:19:11,435 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_check_alloc_flags [2025-03-08 19:19:11,448 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 107 nodes and edges [2025-03-08 19:19:11,449 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2025-03-08 19:19:11,450 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-08 19:19:11,451 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 19:19:11,452 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-08 19:19:11,453 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 19:19:11,454 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 19:19:11,582 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 19:19:11,582 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 19:19:11,582 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 19:19:11,584 INFO L158 Benchmark]: Toolchain (without parser) took 17109.42ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 110.0MB in the beginning and 735.1MB in the end (delta: -625.1MB). Peak memory consumption was 568.3MB. Max. memory is 16.1GB. [2025-03-08 19:19:11,584 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 19:19:11,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 652.65ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 63.7MB in the end (delta: 46.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-08 19:19:11,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.32ms. Allocated memory is still 142.6MB. Free memory was 63.7MB in the beginning and 57.7MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 19:19:11,585 INFO L158 Benchmark]: Boogie Preprocessor took 97.67ms. Allocated memory is still 142.6MB. Free memory was 57.7MB in the beginning and 49.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 19:19:11,585 INFO L158 Benchmark]: IcfgBuilder took 940.71ms. Allocated memory is still 142.6MB. Free memory was 49.4MB in the beginning and 85.1MB in the end (delta: -35.7MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2025-03-08 19:19:11,585 INFO L158 Benchmark]: TraceAbstraction took 15192.95ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 85.1MB in the beginning and 751.8MB in the end (delta: -666.7MB). Peak memory consumption was 836.8MB. Max. memory is 16.1GB. [2025-03-08 19:19:11,586 INFO L158 Benchmark]: Witness Printer took 156.87ms. Allocated memory is still 1.3GB. Free memory was 751.8MB in the beginning and 735.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 19:19:11,588 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.21ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 652.65ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 63.7MB in the end (delta: 46.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.32ms. Allocated memory is still 142.6MB. Free memory was 63.7MB in the beginning and 57.7MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 97.67ms. Allocated memory is still 142.6MB. Free memory was 57.7MB in the beginning and 49.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 940.71ms. Allocated memory is still 142.6MB. Free memory was 49.4MB in the beginning and 85.1MB in the end (delta: -35.7MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15192.95ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 85.1MB in the beginning and 751.8MB in the end (delta: -666.7MB). Peak memory consumption was 836.8MB. Max. memory is 16.1GB. * Witness Printer took 156.87ms. Allocated memory is still 1.3GB. Free memory was 751.8MB in the beginning and 735.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 1855]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [1855] - GenericResultAtLocation [Line: 1858]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1858] - GenericResultAtLocation [Line: 1861]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1861] - GenericResultAtLocation [Line: 1864]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1864] - GenericResultAtLocation [Line: 1902]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; incl %0": "+m" (v->counter)); [1902] * 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: 2013]: 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 29 procedures, 373 locations, 592 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4832 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4827 mSDsluCounter, 17206 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8516 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 427 IncrementalHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 8690 mSDtfsCounter, 427 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20152occurred in iteration=13, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 368 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1975 NumberOfCodeBlocks, 1975 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1957 ConstructedInterpolants, 0 QuantifiedInterpolants, 2757 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2187 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 504/530 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: 2303]: Location Invariant Derived location invariant: (ldv_spin == 0) - InvariantResult [Line: 2301]: Location Invariant Derived location invariant: (ldv_spin == 0) RESULT: Ultimate proved your program to be correct! [2025-03-08 19:19:11,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE