./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.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-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8cac8187c908783c6da6279dd5046ee81ec4fe5bbaff4f4fff097111c44b0a84 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 18:37:01,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:37:01,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 18:37:01,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:37:01,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:37:01,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:37:01,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:37:01,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:37:01,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:37:01,232 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:37:01,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:37:01,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:37:01,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:37:01,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:37:01,233 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:37:01,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:37:01,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:37:01,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:37:01,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:37:01,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:37:01,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:37:01,234 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:37:01,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:37:01,234 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:37:01,234 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:37:01,234 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:37:01,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:37:01,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:37:01,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:37:01,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:37:01,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:37:01,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:37:01,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:37:01,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:37:01,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:37:01,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:37:01,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:37:01,235 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:37:01,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:37:01,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:37:01,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:37:01,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:37:01,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:37:01,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:37:01,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:37:01,236 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8cac8187c908783c6da6279dd5046ee81ec4fe5bbaff4f4fff097111c44b0a84 [2025-01-09 18:37:01,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:37:01,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:37:01,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:37:01,513 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:37:01,513 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:37:01,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/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-01-09 18:37:02,619 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcf57e9ab/d2a060918250458eadb067c6fc256775/FLAG7298817f8 [2025-01-09 18:37:02,982 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:37:02,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/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-01-09 18:37:03,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcf57e9ab/d2a060918250458eadb067c6fc256775/FLAG7298817f8 [2025-01-09 18:37:03,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcf57e9ab/d2a060918250458eadb067c6fc256775 [2025-01-09 18:37:03,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:37:03,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:37:03,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:37:03,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:37:03,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:37:03,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:37:03" (1/1) ... [2025-01-09 18:37:03,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a2629a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:03, skipping insertion in model container [2025-01-09 18:37:03,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:37:03" (1/1) ... [2025-01-09 18:37:03,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:37:03,466 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2025-01-09 18:37:03,467 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-01-09 18:37:03,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.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-01-09 18:37:03,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:37:03,635 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:37:03,685 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2025-01-09 18:37:03,685 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-01-09 18:37:03,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [1855] [2025-01-09 18:37:03,688 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1858] [2025-01-09 18:37:03,688 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1861] [2025-01-09 18:37:03,688 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1864] [2025-01-09 18:37:03,693 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-01-09 18:37:03,699 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.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-01-09 18:37:03,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:37:03,788 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:37:03,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:03 WrapperNode [2025-01-09 18:37:03,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:37:03,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:37:03,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:37:03,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:37:03,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:03" (1/1) ... [2025-01-09 18:37:03,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:03" (1/1) ... [2025-01-09 18:37:03,857 INFO L138 Inliner]: procedures = 114, calls = 293, calls flagged for inlining = 50, calls inlined = 38, statements flattened = 930 [2025-01-09 18:37:03,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:37:03,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:37:03,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:37:03,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:37:03,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:03" (1/1) ... [2025-01-09 18:37:03,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:03" (1/1) ... [2025-01-09 18:37:03,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:03" (1/1) ... [2025-01-09 18:37:03,920 INFO L175 MemorySlicer]: Split 79 memory accesses to 14 slices as follows [2, 5, 1, 4, 1, 2, 1, 24, 4, 1, 12, 10, 12, 0]. 30 percent of accesses are in the largest equivalence class. The 55 initializations are split as follows [2, 0, 0, 4, 1, 1, 1, 18, 4, 1, 12, 10, 1, 0]. The 9 writes are split as follows [0, 3, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 4, 0]. [2025-01-09 18:37:03,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:03" (1/1) ... [2025-01-09 18:37:03,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:03" (1/1) ... [2025-01-09 18:37:03,952 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:03" (1/1) ... [2025-01-09 18:37:03,954 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:03" (1/1) ... [2025-01-09 18:37:03,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:03" (1/1) ... [2025-01-09 18:37:03,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:03" (1/1) ... [2025-01-09 18:37:03,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:03" (1/1) ... [2025-01-09 18:37:03,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:37:03,987 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:37:03,987 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:37:03,987 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:37:03,988 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:03" (1/1) ... [2025-01-09 18:37:03,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:37:04,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:37:04,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 18:37:04,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 18:37:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2025-01-09 18:37:04,052 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2025-01-09 18:37:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2025-01-09 18:37:04,052 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2025-01-09 18:37:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 18:37:04,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 18:37:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:37:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:37:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:37:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:37:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:37:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:37:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:37:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:37:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 18:37:04,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 18:37:04,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 18:37:04,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 18:37:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 18:37:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 18:37:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2025-01-09 18:37:04,057 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2025-01-09 18:37:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2025-01-09 18:37:04,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2025-01-09 18:37:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:37:04,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:37:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2025-01-09 18:37:04,057 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2025-01-09 18:37:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2025-01-09 18:37:04,058 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2025-01-09 18:37:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-01-09 18:37:04,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-01-09 18:37:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 18:37:04,059 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 18:37:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2025-01-09 18:37:04,059 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2025-01-09 18:37:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:37:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:37:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:37:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:37:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:37:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:37:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:37:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:37:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 18:37:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 18:37:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 18:37:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 18:37:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 18:37:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 18:37:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:37:04,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:37:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2025-01-09 18:37:04,060 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2025-01-09 18:37:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2025-01-09 18:37:04,060 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2025-01-09 18:37:04,061 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2025-01-09 18:37:04,061 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2025-01-09 18:37:04,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 18:37:04,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 18:37:04,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2025-01-09 18:37:04,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2025-01-09 18:37:04,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2025-01-09 18:37:04,062 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2025-01-09 18:37:04,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2025-01-09 18:37:04,062 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:37:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2025-01-09 18:37:04,063 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 18:37:04,063 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-01-09 18:37:04,063 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2025-01-09 18:37:04,063 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2025-01-09 18:37:04,063 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:37:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:37:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:37:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:37:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:37:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:37:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:37:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 18:37:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 18:37:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 18:37:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 18:37:04,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 18:37:04,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 18:37:04,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-01-09 18:37:04,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-01-09 18:37:04,067 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2025-01-09 18:37:04,067 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2025-01-09 18:37:04,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:37:04,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:37:04,290 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:37:04,291 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:37:04,306 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 18:37:04,954 INFO L? ?]: Removed 301 outVars from TransFormulas that were not future-live. [2025-01-09 18:37:04,955 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:37:04,969 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:37:04,970 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 18:37:04,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:37:04 BoogieIcfgContainer [2025-01-09 18:37:04,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:37:04,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:37:04,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:37:04,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:37:04,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:37:03" (1/3) ... [2025-01-09 18:37:04,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc6bfa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:37:04, skipping insertion in model container [2025-01-09 18:37:04,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:03" (2/3) ... [2025-01-09 18:37:04,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc6bfa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:37:04, skipping insertion in model container [2025-01-09 18:37:04,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:37:04" (3/3) ... [2025-01-09 18:37:04,979 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-01-09 18:37:04,989 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:37:04,993 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-01-09 18:37:05,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:37:05,049 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;@48c8ea94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:37:05,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:37:05,056 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-01-09 18:37:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 18:37:05,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:37:05,117 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-01-09 18:37:05,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:37:05,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:37:05,121 INFO L85 PathProgramCache]: Analyzing trace with hash 295352937, now seen corresponding path program 1 times [2025-01-09 18:37:05,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:37:05,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480169141] [2025-01-09 18:37:05,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:05,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:37:05,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 18:37:05,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 18:37:05,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:05,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 18:37:05,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:37:05,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480169141] [2025-01-09 18:37:05,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480169141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:37:05,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:37:05,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:37:05,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580227357] [2025-01-09 18:37:05,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:37:05,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:37:05,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:37:05,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:37:05,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:37:05,501 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-01-09 18:37:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:37:05,628 INFO L93 Difference]: Finished difference Result 999 states and 1405 transitions. [2025-01-09 18:37:05,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:37:05,630 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-01-09 18:37:05,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:37:05,641 INFO L225 Difference]: With dead ends: 999 [2025-01-09 18:37:05,641 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 18:37:05,645 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-01-09 18:37:05,649 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 476 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:37:05,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 902 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:37:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 18:37:05,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 554. [2025-01-09 18:37:05,724 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-01-09 18:37:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 758 transitions. [2025-01-09 18:37:05,734 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 758 transitions. Word has length 46 [2025-01-09 18:37:05,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:37:05,735 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 758 transitions. [2025-01-09 18:37:05,735 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-01-09 18:37:05,735 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 758 transitions. [2025-01-09 18:37:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 18:37:05,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:37:05,741 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-01-09 18:37:05,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 18:37:05,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:37:05,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:37:05,742 INFO L85 PathProgramCache]: Analyzing trace with hash -341583751, now seen corresponding path program 1 times [2025-01-09 18:37:05,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:37:05,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948342667] [2025-01-09 18:37:05,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:05,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:37:05,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 18:37:05,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 18:37:05,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:05,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 18:37:05,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:37:05,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948342667] [2025-01-09 18:37:05,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948342667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:37:05,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:37:05,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:37:05,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326109174] [2025-01-09 18:37:05,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:37:05,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:37:05,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:37:05,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:37:05,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:37:05,891 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-01-09 18:37:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:37:05,925 INFO L93 Difference]: Finished difference Result 559 states and 763 transitions. [2025-01-09 18:37:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:37:05,927 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-01-09 18:37:05,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:37:05,934 INFO L225 Difference]: With dead ends: 559 [2025-01-09 18:37:05,935 INFO L226 Difference]: Without dead ends: 555 [2025-01-09 18:37:05,935 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-01-09 18:37:05,935 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 0 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:37:05,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 983 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:37:05,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-01-09 18:37:05,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2025-01-09 18:37:05,970 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-01-09 18:37:05,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 758 transitions. [2025-01-09 18:37:05,973 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 758 transitions. Word has length 55 [2025-01-09 18:37:05,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:37:05,976 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 758 transitions. [2025-01-09 18:37:05,977 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-01-09 18:37:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 758 transitions. [2025-01-09 18:37:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 18:37:05,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:37:05,984 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-01-09 18:37:05,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:37:05,984 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:37:05,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:37:05,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1826672211, now seen corresponding path program 1 times [2025-01-09 18:37:05,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:37:05,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190147230] [2025-01-09 18:37:05,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:05,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:37:06,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 18:37:06,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 18:37:06,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:06,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 18:37:06,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:37:06,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190147230] [2025-01-09 18:37:06,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190147230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:37:06,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:37:06,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:37:06,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012698514] [2025-01-09 18:37:06,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:37:06,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:37:06,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:37:06,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:37:06,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:37:06,224 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-01-09 18:37:06,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:37:06,323 INFO L93 Difference]: Finished difference Result 1550 states and 2170 transitions. [2025-01-09 18:37:06,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:37:06,324 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-01-09 18:37:06,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:37:06,331 INFO L225 Difference]: With dead ends: 1550 [2025-01-09 18:37:06,333 INFO L226 Difference]: Without dead ends: 991 [2025-01-09 18:37:06,335 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-01-09 18:37:06,335 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 442 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:37:06,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1433 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:37:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-01-09 18:37:06,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 957. [2025-01-09 18:37:06,391 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-01-09 18:37:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1342 transitions. [2025-01-09 18:37:06,397 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1342 transitions. Word has length 57 [2025-01-09 18:37:06,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:37:06,397 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1342 transitions. [2025-01-09 18:37:06,397 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-01-09 18:37:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1342 transitions. [2025-01-09 18:37:06,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 18:37:06,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:37:06,400 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-01-09 18:37:06,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:37:06,400 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:37:06,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:37:06,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1730373810, now seen corresponding path program 1 times [2025-01-09 18:37:06,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:37:06,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911836744] [2025-01-09 18:37:06,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:06,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:37:06,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 18:37:06,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 18:37:06,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:06,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 18:37:06,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:37:06,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911836744] [2025-01-09 18:37:06,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911836744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:37:06,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:37:06,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:37:06,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71072100] [2025-01-09 18:37:06,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:37:06,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:37:06,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:37:06,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:37:06,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:37:06,479 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-01-09 18:37:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:37:06,581 INFO L93 Difference]: Finished difference Result 2719 states and 3806 transitions. [2025-01-09 18:37:06,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:37:06,582 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-01-09 18:37:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:37:06,594 INFO L225 Difference]: With dead ends: 2719 [2025-01-09 18:37:06,594 INFO L226 Difference]: Without dead ends: 1782 [2025-01-09 18:37:06,600 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-01-09 18:37:06,600 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 441 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:37:06,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 989 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:37:06,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2025-01-09 18:37:06,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1750. [2025-01-09 18:37:06,683 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-01-09 18:37:06,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2447 transitions. [2025-01-09 18:37:06,692 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2447 transitions. Word has length 72 [2025-01-09 18:37:06,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:37:06,692 INFO L471 AbstractCegarLoop]: Abstraction has 1750 states and 2447 transitions. [2025-01-09 18:37:06,693 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-01-09 18:37:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2447 transitions. [2025-01-09 18:37:06,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 18:37:06,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:37:06,700 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-01-09 18:37:06,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:37:06,700 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:37:06,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:37:06,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1449144369, now seen corresponding path program 1 times [2025-01-09 18:37:06,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:37:06,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360195493] [2025-01-09 18:37:06,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:06,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:37:06,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 18:37:06,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 18:37:06,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:06,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 18:37:06,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:37:06,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360195493] [2025-01-09 18:37:06,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360195493] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:37:06,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:37:06,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:37:06,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784818543] [2025-01-09 18:37:06,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:37:06,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:37:06,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:37:06,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:37:06,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:37:06,830 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-01-09 18:37:06,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:37:06,904 INFO L93 Difference]: Finished difference Result 3484 states and 4879 transitions. [2025-01-09 18:37:06,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:37:06,905 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-01-09 18:37:06,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:37:06,913 INFO L225 Difference]: With dead ends: 3484 [2025-01-09 18:37:06,915 INFO L226 Difference]: Without dead ends: 1754 [2025-01-09 18:37:06,918 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-01-09 18:37:06,920 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 0 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:37:06,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 983 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:37:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2025-01-09 18:37:07,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1754. [2025-01-09 18:37:07,022 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-01-09 18:37:07,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2451 transitions. [2025-01-09 18:37:07,031 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2451 transitions. Word has length 76 [2025-01-09 18:37:07,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:37:07,033 INFO L471 AbstractCegarLoop]: Abstraction has 1754 states and 2451 transitions. [2025-01-09 18:37:07,033 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-01-09 18:37:07,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2451 transitions. [2025-01-09 18:37:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 18:37:07,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:37:07,038 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-01-09 18:37:07,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:37:07,039 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:37:07,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:37:07,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1096055987, now seen corresponding path program 1 times [2025-01-09 18:37:07,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:37:07,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758366819] [2025-01-09 18:37:07,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:07,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:37:07,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 18:37:07,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 18:37:07,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:07,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:07,134 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 18:37:07,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:37:07,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758366819] [2025-01-09 18:37:07,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758366819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:37:07,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:37:07,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:37:07,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241699617] [2025-01-09 18:37:07,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:37:07,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:37:07,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:37:07,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:37:07,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:37:07,136 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-01-09 18:37:07,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:37:07,206 INFO L93 Difference]: Finished difference Result 3500 states and 4895 transitions. [2025-01-09 18:37:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:37:07,206 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-01-09 18:37:07,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:37:07,213 INFO L225 Difference]: With dead ends: 3500 [2025-01-09 18:37:07,213 INFO L226 Difference]: Without dead ends: 1706 [2025-01-09 18:37:07,217 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-01-09 18:37:07,217 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 1 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:37:07,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1471 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:37:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2025-01-09 18:37:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1702. [2025-01-09 18:37:07,264 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-01-09 18:37:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2367 transitions. [2025-01-09 18:37:07,272 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2367 transitions. Word has length 76 [2025-01-09 18:37:07,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:37:07,272 INFO L471 AbstractCegarLoop]: Abstraction has 1702 states and 2367 transitions. [2025-01-09 18:37:07,273 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-01-09 18:37:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2367 transitions. [2025-01-09 18:37:07,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 18:37:07,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:37:07,274 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-01-09 18:37:07,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:37:07,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:37:07,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:37:07,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1610760598, now seen corresponding path program 1 times [2025-01-09 18:37:07,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:37:07,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253092398] [2025-01-09 18:37:07,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:07,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:37:07,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 18:37:07,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 18:37:07,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:07,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 18:37:07,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:37:07,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253092398] [2025-01-09 18:37:07,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253092398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:37:07,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:37:07,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:37:07,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061252059] [2025-01-09 18:37:07,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:37:07,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:37:07,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:37:07,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:37:07,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:37:07,339 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-01-09 18:37:07,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:37:07,460 INFO L93 Difference]: Finished difference Result 4771 states and 6619 transitions. [2025-01-09 18:37:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:37:07,460 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-01-09 18:37:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:37:07,473 INFO L225 Difference]: With dead ends: 4771 [2025-01-09 18:37:07,473 INFO L226 Difference]: Without dead ends: 3089 [2025-01-09 18:37:07,476 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-01-09 18:37:07,477 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 415 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:37:07,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 989 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:37:07,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2025-01-09 18:37:07,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 3057. [2025-01-09 18:37:07,594 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-01-09 18:37:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3057 states to 3057 states and 4231 transitions. [2025-01-09 18:37:07,606 INFO L78 Accepts]: Start accepts. Automaton has 3057 states and 4231 transitions. Word has length 78 [2025-01-09 18:37:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:37:07,607 INFO L471 AbstractCegarLoop]: Abstraction has 3057 states and 4231 transitions. [2025-01-09 18:37:07,607 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-01-09 18:37:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3057 states and 4231 transitions. [2025-01-09 18:37:07,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 18:37:07,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:37:07,611 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-01-09 18:37:07,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:37:07,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:37:07,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:37:07,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1633432500, now seen corresponding path program 1 times [2025-01-09 18:37:07,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:37:07,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617438139] [2025-01-09 18:37:07,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:07,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:37:07,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 18:37:07,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 18:37:07,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:07,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:07,701 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 18:37:07,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:37:07,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617438139] [2025-01-09 18:37:07,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617438139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:37:07,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:37:07,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:37:07,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78844739] [2025-01-09 18:37:07,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:37:07,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:37:07,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:37:07,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:37:07,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:37:07,703 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-01-09 18:37:07,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:37:07,800 INFO L93 Difference]: Finished difference Result 6094 states and 8439 transitions. [2025-01-09 18:37:07,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:37:07,801 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-01-09 18:37:07,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:37:07,816 INFO L225 Difference]: With dead ends: 6094 [2025-01-09 18:37:07,816 INFO L226 Difference]: Without dead ends: 3057 [2025-01-09 18:37:07,822 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-01-09 18:37:07,823 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 452 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:37:07,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 473 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:37:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2025-01-09 18:37:07,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 3057. [2025-01-09 18:37:07,958 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-01-09 18:37:07,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3057 states to 3057 states and 4223 transitions. [2025-01-09 18:37:07,971 INFO L78 Accepts]: Start accepts. Automaton has 3057 states and 4223 transitions. Word has length 123 [2025-01-09 18:37:07,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:37:07,971 INFO L471 AbstractCegarLoop]: Abstraction has 3057 states and 4223 transitions. [2025-01-09 18:37:07,971 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-01-09 18:37:07,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3057 states and 4223 transitions. [2025-01-09 18:37:07,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 18:37:07,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:37:07,975 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-01-09 18:37:07,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:37:07,975 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:37:07,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:37:07,976 INFO L85 PathProgramCache]: Analyzing trace with hash 708976677, now seen corresponding path program 1 times [2025-01-09 18:37:07,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:37:07,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641204754] [2025-01-09 18:37:07,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:07,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:37:08,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 18:37:08,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 18:37:08,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:08,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:08,091 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 18:37:08,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:37:08,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641204754] [2025-01-09 18:37:08,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641204754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:37:08,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:37:08,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:37:08,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882555541] [2025-01-09 18:37:08,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:37:08,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:37:08,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:37:08,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:37:08,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:37:08,094 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-01-09 18:37:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:37:08,254 INFO L93 Difference]: Finished difference Result 7666 states and 10623 transitions. [2025-01-09 18:37:08,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:37:08,254 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-01-09 18:37:08,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:37:08,273 INFO L225 Difference]: With dead ends: 7666 [2025-01-09 18:37:08,273 INFO L226 Difference]: Without dead ends: 4629 [2025-01-09 18:37:08,281 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-01-09 18:37:08,282 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 422 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:37:08,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1235 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:37:08,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4629 states. [2025-01-09 18:37:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4629 to 4593. [2025-01-09 18:37:08,500 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-01-09 18:37:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4593 states to 4593 states and 6323 transitions. [2025-01-09 18:37:08,523 INFO L78 Accepts]: Start accepts. Automaton has 4593 states and 6323 transitions. Word has length 126 [2025-01-09 18:37:08,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:37:08,524 INFO L471 AbstractCegarLoop]: Abstraction has 4593 states and 6323 transitions. [2025-01-09 18:37:08,524 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-01-09 18:37:08,524 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 6323 transitions. [2025-01-09 18:37:08,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 18:37:08,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:37:08,532 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-01-09 18:37:08,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 18:37:08,532 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:37:08,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:37:08,532 INFO L85 PathProgramCache]: Analyzing trace with hash 400204033, now seen corresponding path program 1 times [2025-01-09 18:37:08,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:37:08,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11637347] [2025-01-09 18:37:08,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:08,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:37:08,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 18:37:08,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 18:37:08,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:08,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 18:37:08,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:37:08,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11637347] [2025-01-09 18:37:08,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11637347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:37:08,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:37:08,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:37:08,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380191455] [2025-01-09 18:37:08,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:37:08,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:37:08,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:37:08,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:37:08,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:37:08,677 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-01-09 18:37:08,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:37:08,930 INFO L93 Difference]: Finished difference Result 11501 states and 15886 transitions. [2025-01-09 18:37:08,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:37:08,930 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-01-09 18:37:08,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:37:08,960 INFO L225 Difference]: With dead ends: 11501 [2025-01-09 18:37:08,960 INFO L226 Difference]: Without dead ends: 6928 [2025-01-09 18:37:08,971 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-01-09 18:37:08,972 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 416 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:37:08,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1229 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:37:08,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6928 states. [2025-01-09 18:37:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6928 to 6890. [2025-01-09 18:37:09,210 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-01-09 18:37:09,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6890 states to 6890 states and 9454 transitions. [2025-01-09 18:37:09,242 INFO L78 Accepts]: Start accepts. Automaton has 6890 states and 9454 transitions. Word has length 132 [2025-01-09 18:37:09,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:37:09,242 INFO L471 AbstractCegarLoop]: Abstraction has 6890 states and 9454 transitions. [2025-01-09 18:37:09,243 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-01-09 18:37:09,243 INFO L276 IsEmpty]: Start isEmpty. Operand 6890 states and 9454 transitions. [2025-01-09 18:37:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 18:37:09,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:37:09,248 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-01-09 18:37:09,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 18:37:09,248 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:37:09,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:37:09,249 INFO L85 PathProgramCache]: Analyzing trace with hash -639023441, now seen corresponding path program 1 times [2025-01-09 18:37:09,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:37:09,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810834532] [2025-01-09 18:37:09,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:09,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:37:09,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 18:37:09,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 18:37:09,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:09,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 18:37:09,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:37:09,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810834532] [2025-01-09 18:37:09,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810834532] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:37:09,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677913171] [2025-01-09 18:37:09,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:09,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:37:09,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:37:09,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:37:09,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 18:37:09,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 18:37:09,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 18:37:09,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:09,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:09,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 18:37:09,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:37:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 18:37:09,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:37:09,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677913171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:37:09,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:37:09,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-01-09 18:37:09,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984406780] [2025-01-09 18:37:09,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:37:09,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:37:09,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:37:09,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:37:09,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:37:09,800 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-01-09 18:37:10,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:37:10,044 INFO L93 Difference]: Finished difference Result 13868 states and 19047 transitions. [2025-01-09 18:37:10,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:37:10,045 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-01-09 18:37:10,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:37:10,077 INFO L225 Difference]: With dead ends: 13868 [2025-01-09 18:37:10,077 INFO L226 Difference]: Without dead ends: 6836 [2025-01-09 18:37:10,091 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-01-09 18:37:10,091 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 1 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:37:10,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1859 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:37:10,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6836 states. [2025-01-09 18:37:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6836 to 6836. [2025-01-09 18:37:10,276 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-01-09 18:37:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 9355 transitions. [2025-01-09 18:37:10,298 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 9355 transitions. Word has length 136 [2025-01-09 18:37:10,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:37:10,299 INFO L471 AbstractCegarLoop]: Abstraction has 6836 states and 9355 transitions. [2025-01-09 18:37:10,299 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-01-09 18:37:10,299 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 9355 transitions. [2025-01-09 18:37:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 18:37:10,305 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:37:10,305 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-01-09 18:37:10,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 18:37:10,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 18:37:10,506 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:37:10,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:37:10,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1044178400, now seen corresponding path program 1 times [2025-01-09 18:37:10,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:37:10,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463188691] [2025-01-09 18:37:10,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:10,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:37:10,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 18:37:10,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 18:37:10,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:10,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:10,666 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 18:37:10,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:37:10,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463188691] [2025-01-09 18:37:10,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463188691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:37:10,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:37:10,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:37:10,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796580009] [2025-01-09 18:37:10,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:37:10,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:37:10,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:37:10,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:37:10,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:37:10,668 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-01-09 18:37:10,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:37:10,823 INFO L93 Difference]: Finished difference Result 13616 states and 18633 transitions. [2025-01-09 18:37:10,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:37:10,823 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-01-09 18:37:10,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:37:10,866 INFO L225 Difference]: With dead ends: 13616 [2025-01-09 18:37:10,866 INFO L226 Difference]: Without dead ends: 6800 [2025-01-09 18:37:10,889 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-01-09 18:37:10,890 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 438 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:37:10,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 469 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:37:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6800 states. [2025-01-09 18:37:11,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6800 to 6800. [2025-01-09 18:37:11,153 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-01-09 18:37:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6800 states to 6800 states and 9283 transitions. [2025-01-09 18:37:11,176 INFO L78 Accepts]: Start accepts. Automaton has 6800 states and 9283 transitions. Word has length 138 [2025-01-09 18:37:11,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:37:11,176 INFO L471 AbstractCegarLoop]: Abstraction has 6800 states and 9283 transitions. [2025-01-09 18:37:11,177 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-01-09 18:37:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 6800 states and 9283 transitions. [2025-01-09 18:37:11,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 18:37:11,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:37:11,186 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-01-09 18:37:11,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 18:37:11,186 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:37:11,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:37:11,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1891535711, now seen corresponding path program 1 times [2025-01-09 18:37:11,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:37:11,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116691356] [2025-01-09 18:37:11,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:11,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:37:11,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 18:37:11,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 18:37:11,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:11,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 18:37:11,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:37:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116691356] [2025-01-09 18:37:11,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116691356] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:37:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892904065] [2025-01-09 18:37:11,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:11,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:37:11,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:37:11,369 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:37:11,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 18:37:11,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 18:37:11,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 18:37:11,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:11,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:11,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 18:37:11,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:37:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 18:37:11,868 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:37:11,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892904065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:37:11,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:37:11,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 18:37:11,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845113633] [2025-01-09 18:37:11,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:37:11,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:37:11,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:37:11,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:37:11,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:37:11,870 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-01-09 18:37:12,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:37:12,601 INFO L93 Difference]: Finished difference Result 20334 states and 27771 transitions. [2025-01-09 18:37:12,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:37:12,601 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-01-09 18:37:12,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:37:12,665 INFO L225 Difference]: With dead ends: 20334 [2025-01-09 18:37:12,665 INFO L226 Difference]: Without dead ends: 20302 [2025-01-09 18:37:12,672 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-01-09 18:37:12,673 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 811 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:37:12,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1639 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 18:37:12,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20302 states. [2025-01-09 18:37:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20302 to 20152. [2025-01-09 18:37:13,238 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-01-09 18:37:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20152 states to 20152 states and 27578 transitions. [2025-01-09 18:37:13,289 INFO L78 Accepts]: Start accepts. Automaton has 20152 states and 27578 transitions. Word has length 139 [2025-01-09 18:37:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:37:13,290 INFO L471 AbstractCegarLoop]: Abstraction has 20152 states and 27578 transitions. [2025-01-09 18:37:13,290 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-01-09 18:37:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 20152 states and 27578 transitions. [2025-01-09 18:37:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 18:37:13,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:37:13,306 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-01-09 18:37:13,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 18:37:13,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:37:13,507 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:37:13,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:37:13,507 INFO L85 PathProgramCache]: Analyzing trace with hash -23652309, now seen corresponding path program 1 times [2025-01-09 18:37:13,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:37:13,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879322008] [2025-01-09 18:37:13,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:13,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:37:13,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 18:37:13,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 18:37:13,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:13,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 18:37:13,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:37:13,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879322008] [2025-01-09 18:37:13,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879322008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:37:13,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:37:13,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:37:13,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126330250] [2025-01-09 18:37:13,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:37:13,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:37:13,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:37:13,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:37:13,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:37:13,657 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-01-09 18:37:13,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:37:13,829 INFO L93 Difference]: Finished difference Result 26650 states and 36633 transitions. [2025-01-09 18:37:13,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:37:13,830 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-01-09 18:37:13,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:37:13,852 INFO L225 Difference]: With dead ends: 26650 [2025-01-09 18:37:13,853 INFO L226 Difference]: Without dead ends: 6331 [2025-01-09 18:37:13,883 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-01-09 18:37:13,884 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 243 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:37:13,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 894 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:37:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6331 states. [2025-01-09 18:37:14,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6331 to 6331. [2025-01-09 18:37:14,121 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-01-09 18:37:14,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6331 states to 6331 states and 8708 transitions. [2025-01-09 18:37:14,136 INFO L78 Accepts]: Start accepts. Automaton has 6331 states and 8708 transitions. Word has length 148 [2025-01-09 18:37:14,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:37:14,137 INFO L471 AbstractCegarLoop]: Abstraction has 6331 states and 8708 transitions. [2025-01-09 18:37:14,137 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-01-09 18:37:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand 6331 states and 8708 transitions. [2025-01-09 18:37:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 18:37:14,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:37:14,148 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-01-09 18:37:14,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 18:37:14,148 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:37:14,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:37:14,149 INFO L85 PathProgramCache]: Analyzing trace with hash 730299841, now seen corresponding path program 1 times [2025-01-09 18:37:14,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:37:14,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582281582] [2025-01-09 18:37:14,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:14,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:37:14,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 18:37:14,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 18:37:14,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:14,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 18:37:14,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:37:14,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582281582] [2025-01-09 18:37:14,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582281582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:37:14,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:37:14,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:37:14,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948655992] [2025-01-09 18:37:14,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:37:14,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:37:14,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:37:14,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:37:14,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:37:14,344 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-01-09 18:37:14,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:37:14,508 INFO L93 Difference]: Finished difference Result 12684 states and 17459 transitions. [2025-01-09 18:37:14,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:37:14,509 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-01-09 18:37:14,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:37:14,529 INFO L225 Difference]: With dead ends: 12684 [2025-01-09 18:37:14,529 INFO L226 Difference]: Without dead ends: 6373 [2025-01-09 18:37:14,539 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-01-09 18:37:14,541 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 8 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:37:14,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 892 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:37:14,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6373 states. [2025-01-09 18:37:14,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6373 to 6334. [2025-01-09 18:37:14,804 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-01-09 18:37:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6334 states to 6334 states and 8711 transitions. [2025-01-09 18:37:14,823 INFO L78 Accepts]: Start accepts. Automaton has 6334 states and 8711 transitions. Word has length 148 [2025-01-09 18:37:14,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:37:14,823 INFO L471 AbstractCegarLoop]: Abstraction has 6334 states and 8711 transitions. [2025-01-09 18:37:14,823 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-01-09 18:37:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 6334 states and 8711 transitions. [2025-01-09 18:37:14,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 18:37:14,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:37:14,836 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-01-09 18:37:14,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 18:37:14,836 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:37:14,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:37:14,837 INFO L85 PathProgramCache]: Analyzing trace with hash -825275102, now seen corresponding path program 1 times [2025-01-09 18:37:14,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:37:14,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999831405] [2025-01-09 18:37:14,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:14,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:37:14,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 18:37:14,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 18:37:14,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:14,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 18:37:15,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:37:15,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999831405] [2025-01-09 18:37:15,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999831405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:37:15,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:37:15,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:37:15,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11187960] [2025-01-09 18:37:15,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:37:15,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:37:15,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:37:15,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:37:15,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:37:15,226 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-01-09 18:37:15,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:37:15,326 INFO L93 Difference]: Finished difference Result 6914 states and 9453 transitions. [2025-01-09 18:37:15,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:37:15,326 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-01-09 18:37:15,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:37:15,333 INFO L225 Difference]: With dead ends: 6914 [2025-01-09 18:37:15,333 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 18:37:15,340 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-01-09 18:37:15,342 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-01-09 18:37:15,342 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-01-09 18:37:15,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 18:37:15,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 18:37:15,343 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-01-09 18:37:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 18:37:15,347 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 150 [2025-01-09 18:37:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:37:15,348 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 18:37:15,348 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-01-09 18:37:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 18:37:15,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 18:37:15,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 18:37:15,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 18:37:15,352 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:37:15,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 18:37:20,109 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 18:37:20,120 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~lwsa~0!base [2025-01-09 18:37:20,121 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~lwsa~0!offset [2025-01-09 18:37:20,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 06:37:20 BoogieIcfgContainer [2025-01-09 18:37:20,121 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 18:37:20,122 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 18:37:20,122 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 18:37:20,122 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 18:37:20,123 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:37:04" (3/4) ... [2025-01-09 18:37:20,125 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 18:37:20,128 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure _torture_stop_kthread [2025-01-09 18:37:20,128 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2025-01-09 18:37:20,128 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_delay [2025-01-09 18:37:20,128 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printk [2025-01-09 18:37:20,128 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_spin_write_unlock_irq [2025-01-09 18:37:20,128 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __const_udelay [2025-01-09 18:37:20,129 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-01-09 18:37:20,129 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_lock [2025-01-09 18:37:20,129 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2025-01-09 18:37:20,129 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_random [2025-01-09 18:37:20,129 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2025-01-09 18:37:20,129 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_stats_print [2025-01-09 18:37:20,129 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_unlock [2025-01-09 18:37:20,129 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_print_module_parms [2025-01-09 18:37:20,129 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_delay [2025-01-09 18:37:20,129 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_cleanup [2025-01-09 18:37:20,129 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_init_end [2025-01-09 18:37:20,129 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 18:37:20,129 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_unlock [2025-01-09 18:37:20,129 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_lock [2025-01-09 18:37:20,130 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock_irq [2025-01-09 18:37:20,130 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-01-09 18:37:20,130 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure _torture_create_kthread [2025-01-09 18:37:20,130 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock [2025-01-09 18:37:20,130 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~TO~VOID [2025-01-09 18:37:20,130 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2025-01-09 18:37:20,130 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_unlock [2025-01-09 18:37:20,130 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_alloc_flags [2025-01-09 18:37:20,146 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 109 nodes and edges [2025-01-09 18:37:20,147 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 44 nodes and edges [2025-01-09 18:37:20,152 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 18:37:20,153 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 18:37:20,154 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 18:37:20,158 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 18:37:20,159 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 18:37:20,275 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 18:37:20,275 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 18:37:20,275 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 18:37:20,276 INFO L158 Benchmark]: Toolchain (without parser) took 17077.69ms. Allocated memory was 167.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 119.6MB in the beginning and 805.3MB in the end (delta: -685.7MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-01-09 18:37:20,276 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 18:37:20,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.68ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 73.4MB in the end (delta: 46.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 18:37:20,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.45ms. Allocated memory is still 167.8MB. Free memory was 73.4MB in the beginning and 67.7MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 18:37:20,276 INFO L158 Benchmark]: Boogie Preprocessor took 128.17ms. Allocated memory is still 167.8MB. Free memory was 67.7MB in the beginning and 58.3MB in the end (delta: 9.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 18:37:20,276 INFO L158 Benchmark]: RCFGBuilder took 984.11ms. Allocated memory is still 167.8MB. Free memory was 58.3MB in the beginning and 54.0MB in the end (delta: 4.3MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2025-01-09 18:37:20,277 INFO L158 Benchmark]: TraceAbstraction took 15149.16ms. Allocated memory was 167.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 54.0MB in the beginning and 821.9MB in the end (delta: -768.0MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-01-09 18:37:20,277 INFO L158 Benchmark]: Witness Printer took 153.41ms. Allocated memory is still 2.0GB. Free memory was 821.9MB in the beginning and 805.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 18:37:20,280 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.20ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 589.68ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 73.4MB in the end (delta: 46.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.45ms. Allocated memory is still 167.8MB. Free memory was 73.4MB in the beginning and 67.7MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 128.17ms. Allocated memory is still 167.8MB. Free memory was 67.7MB in the beginning and 58.3MB in the end (delta: 9.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 984.11ms. Allocated memory is still 167.8MB. Free memory was 58.3MB in the beginning and 54.0MB in the end (delta: 4.3MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15149.16ms. Allocated memory was 167.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 54.0MB in the beginning and 821.9MB in the end (delta: -768.0MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 153.41ms. Allocated memory is still 2.0GB. Free memory was 821.9MB in the beginning and 805.3MB in the end (delta: 16.7MB). 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] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~lwsa~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~lwsa~0!offset * 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, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4833 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4828 mSDsluCounter, 17213 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8498 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 392 IncrementalHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 8715 mSDtfsCounter, 392 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: 2.8s 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]: Loop Invariant Derived loop invariant: (ldv_spin == 0) - InvariantResult [Line: 2142]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 2096]: Location Invariant Derived location invariant: (((((((ldv_state_variable_0 == 1) && (onoff_interval == 0)) && (ldv_state_variable_2 == 0)) && (ldv_spin == 0)) && (ldv_state_variable_1 == 0)) && (((long) nwriters_stress + 1) <= 0)) || ((((((onoff_interval == 0) && (ldv_state_variable_2 == 0)) && (ldv_spin == 0)) && (ldv_state_variable_1 == 0)) && (((long) nwriters_stress + 1) <= 0)) && (ldv_state_variable_0 == 3))) - InvariantResult [Line: 2425]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 2301]: Loop Invariant Derived loop invariant: (ldv_spin == 0) - InvariantResult [Line: 2383]: Location Invariant Derived location invariant: (ldv_spin == 0) - InvariantResult [Line: 2581]: Location Invariant Derived location invariant: ((((ldv_state_variable_0 == 1) && (ldv_spin == 0)) && (((long) firsterr + 12) <= 0)) && (((long) nwriters_stress + 1) <= 0)) RESULT: Ultimate proved your program to be correct! [2025-01-09 18:37:20,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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