./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--net--ethernet--realtek--atp.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--net--ethernet--realtek--atp.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b615ef3e9ec848bbbdbcac9993fc5d609594ef1caaa279a862c4f038e6ec482e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 04:42:49,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:42:49,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:42:49,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:42:49,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:42:49,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:42:49,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:42:49,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:42:49,772 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:42:49,773 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:42:49,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:42:49,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:42:49,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:42:49,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:42:49,774 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:42:49,774 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:42:49,774 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:42:49,774 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:42:49,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:42:49,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:42:49,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:42:49,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:42:49,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:42:49,775 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:42:49,775 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:42:49,775 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:42:49,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:42:49,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:42:49,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:42:49,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:42:49,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:42:49,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:42:49,776 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:42:49,776 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:42:49,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:42:49,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:42:49,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:42:49,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:42:49,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:42:49,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:42:49,777 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b615ef3e9ec848bbbdbcac9993fc5d609594ef1caaa279a862c4f038e6ec482e [2025-03-04 04:42:49,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:42:49,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:42:49,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:42:49,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:42:49,986 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:42:49,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--net--ethernet--realtek--atp.ko-entry_point.cil.out.i [2025-03-04 04:42:51,137 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78d3a14e/1c72cfcab41c4a56b2224198f8bbb09a/FLAG3eab826da [2025-03-04 04:42:51,621 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:42:51,621 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--net--ethernet--realtek--atp.ko-entry_point.cil.out.i [2025-03-04 04:42:51,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78d3a14e/1c72cfcab41c4a56b2224198f8bbb09a/FLAG3eab826da [2025-03-04 04:42:51,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78d3a14e/1c72cfcab41c4a56b2224198f8bbb09a [2025-03-04 04:42:51,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:42:51,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:42:51,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:42:51,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:42:51,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:42:51,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:42:51" (1/1) ... [2025-03-04 04:42:51,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c17987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:42:51, skipping insertion in model container [2025-03-04 04:42:51,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:42:51" (1/1) ... [2025-03-04 04:42:51,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:42:52,526 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--net--ethernet--realtek--atp.ko-entry_point.cil.out.i[208194,208207] [2025-03-04 04:42:52,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:42:52,582 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:42:52,670 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; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5300] [2025-03-04 04:42:52,671 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; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [5307] [2025-03-04 04:42:52,679 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("outb %b0, %w1": : "a" (value), "Nd" (port)); [5446] [2025-03-04 04:42:52,680 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("inb %w1, %b0": "=a" (value): "Nd" (port)); [5454] [2025-03-04 04:42:52,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("inb %w1,%b0": "=a" (_v): "d" (port)); [5637] [2025-03-04 04:42:52,785 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--net--ethernet--realtek--atp.ko-entry_point.cil.out.i[208194,208207] [2025-03-04 04:42:52,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:42:52,851 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:42:52,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:42:52 WrapperNode [2025-03-04 04:42:52,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:42:52,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:42:52,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:42:52,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:42:52,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:42:52" (1/1) ... [2025-03-04 04:42:52,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:42:52" (1/1) ... [2025-03-04 04:42:52,971 INFO L138 Inliner]: procedures = 152, calls = 711, calls flagged for inlining = 70, calls inlined = 67, statements flattened = 1968 [2025-03-04 04:42:52,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:42:52,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:42:52,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:42:52,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:42:52,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:42:52" (1/1) ... [2025-03-04 04:42:52,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:42:52" (1/1) ... [2025-03-04 04:42:53,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:42:52" (1/1) ... [2025-03-04 04:42:53,142 INFO L175 MemorySlicer]: Split 327 memory accesses to 10 slices as follows [209, 2, 23, 4, 6, 61, 3, 4, 4, 11]. 64 percent of accesses are in the largest equivalence class. The 39 initializations are split as follows [0, 2, 23, 0, 0, 0, 2, 2, 2, 8]. The 192 writes are split as follows [125, 0, 0, 2, 4, 61, 0, 0, 0, 0]. [2025-03-04 04:42:53,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:42:52" (1/1) ... [2025-03-04 04:42:53,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:42:52" (1/1) ... [2025-03-04 04:42:53,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:42:52" (1/1) ... [2025-03-04 04:42:53,198 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:42:52" (1/1) ... [2025-03-04 04:42:53,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:42:52" (1/1) ... [2025-03-04 04:42:53,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:42:52" (1/1) ... [2025-03-04 04:42:53,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:42:53,246 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:42:53,246 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:42:53,246 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:42:53,247 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:42:52" (1/1) ... [2025-03-04 04:42:53,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:42:53,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:42:53,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 04:42:53,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 04:42:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure atp_probe1 [2025-03-04 04:42:53,287 INFO L138 BoogieDeclarations]: Found implementation of procedure atp_probe1 [2025-03-04 04:42:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2025-03-04 04:42:53,287 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2025-03-04 04:42:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure read_block [2025-03-04 04:42:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure read_block [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:42:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 04:42:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 04:42:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 04:42:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 04:42:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 04:42:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 04:42:53,289 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 04:42:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure set_rx_mode [2025-03-04 04:42:53,289 INFO L138 BoogieDeclarations]: Found implementation of procedure set_rx_mode [2025-03-04 04:42:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2025-03-04 04:42:53,289 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2025-03-04 04:42:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure write_byte_mode0 [2025-03-04 04:42:53,289 INFO L138 BoogieDeclarations]: Found implementation of procedure write_byte_mode0 [2025-03-04 04:42:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure write_byte_mode1 [2025-03-04 04:42:53,289 INFO L138 BoogieDeclarations]: Found implementation of procedure write_byte_mode1 [2025-03-04 04:42:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2025-03-04 04:42:53,289 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2025-03-04 04:42:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2025-03-04 04:42:53,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2025-03-04 04:42:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:42:53,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:42:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-03-04 04:42:53,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-03-04 04:42:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure tx_timeout [2025-03-04 04:42:53,289 INFO L138 BoogieDeclarations]: Found implementation of procedure tx_timeout [2025-03-04 04:42:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:42:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:42:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:42:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 04:42:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 04:42:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 04:42:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 04:42:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 04:42:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 04:42:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 04:42:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure net_rx [2025-03-04 04:42:53,292 INFO L138 BoogieDeclarations]: Found implementation of procedure net_rx [2025-03-04 04:42:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 04:42:53,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 04:42:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg_high [2025-03-04 04:42:53,293 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg_high [2025-03-04 04:42:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-04 04:42:53,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-04 04:42:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:42:53,293 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:42:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-03-04 04:42:53,293 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-03-04 04:42:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure read_nibble [2025-03-04 04:42:53,294 INFO L138 BoogieDeclarations]: Found implementation of procedure read_nibble [2025-03-04 04:42:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:42:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure hardware_init [2025-03-04 04:42:53,294 INFO L138 BoogieDeclarations]: Found implementation of procedure hardware_init [2025-03-04 04:42:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:42:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 04:42:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2025-03-04 04:42:53,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_2 [2025-03-04 04:42:53,295 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_2 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure eth_mac_addr [2025-03-04 04:42:53,295 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_mac_addr [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-03-04 04:42:53,295 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg_byte [2025-03-04 04:42:53,295 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg_byte [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2025-03-04 04:42:53,295 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2025-03-04 04:42:53,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure inbyte [2025-03-04 04:42:53,295 INFO L138 BoogieDeclarations]: Found implementation of procedure inbyte [2025-03-04 04:42:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 04:42:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure trigger_send [2025-03-04 04:42:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure trigger_send [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-04 04:42:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2025-03-04 04:42:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure eth_change_mtu [2025-03-04 04:42:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_change_mtu [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-03-04 04:42:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2025-03-04 04:42:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-03-04 04:42:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure eeprom_op [2025-03-04 04:42:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure eeprom_op [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-04 04:42:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 04:42:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:42:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:42:53,599 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:42:53,602 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:42:53,882 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7352: havoc alloc_etherdev_mqs_#t~ret334#1.base, alloc_etherdev_mqs_#t~ret334#1.offset; [2025-03-04 04:42:53,882 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5314: havoc __fswab16_#t~bitwise1#1; [2025-03-04 04:42:53,882 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5876: call ULTIMATE.dealloc(~#__key~0#1.base, ~#__key~0#1.offset);havoc ~#__key~0#1.base, ~#__key~0#1.offset; [2025-03-04 04:42:53,882 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7413: havoc register_netdev_#t~nondet345#1; [2025-03-04 04:42:54,087 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5713: havoc read_byte_mode6_#t~bitwise80#1; [2025-03-04 04:42:54,087 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5697: havoc read_byte_mode4_#t~bitwise75#1; [2025-03-04 04:42:54,087 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5683: havoc read_byte_mode2_#t~bitwise72#1; [2025-03-04 04:42:54,087 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5667: havoc read_byte_mode0_#t~bitwise67#1; [2025-03-04 04:42:54,088 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:42:54,264 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6456: call ULTIMATE.dealloc(~#rx_head~0#1.base, ~#rx_head~0#1.offset);havoc ~#rx_head~0#1.base, ~#rx_head~0#1.offset; [2025-03-04 04:42:54,265 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7402: havoc netif_rx_#t~nondet343#1; [2025-03-04 04:42:54,265 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7371: havoc eth_type_trans_#t~nondet338#1; [2025-03-04 04:42:54,420 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7367: havoc #t~nondet337; [2025-03-04 04:42:54,459 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7375: havoc #t~nondet339; [2025-03-04 04:42:54,463 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7409: havoc #t~nondet344; [2025-03-04 04:42:54,476 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7363: havoc #t~nondet336; [2025-03-04 04:42:54,482 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5569: havoc #t~mem41.base, #t~mem41.offset; [2025-03-04 04:42:59,636 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6842: call ULTIMATE.dealloc(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset);havoc main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset; [2025-03-04 04:42:59,636 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7391: havoc ldv_ndo_init_3_#t~nondet340#1; [2025-03-04 04:42:59,636 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7359: havoc del_timer_sync_#t~nondet335#1; [2025-03-04 04:42:59,637 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7395: havoc ldv_ndo_uninit_3_#t~nondet341#1; [2025-03-04 04:42:59,637 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5812: call ULTIMATE.dealloc(atp_init_~#ports~0#1.base, atp_init_~#ports~0#1.offset);havoc atp_init_~#ports~0#1.base, atp_init_~#ports~0#1.offset; [2025-03-04 04:42:59,637 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7417: havoc request_threaded_irq_#t~nondet346#1; [2025-03-04 04:42:59,914 INFO L? ?]: Removed 775 outVars from TransFormulas that were not future-live. [2025-03-04 04:42:59,914 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:42:59,975 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:42:59,975 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 04:42:59,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:42:59 BoogieIcfgContainer [2025-03-04 04:42:59,976 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:42:59,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:42:59,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:42:59,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:42:59,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:42:51" (1/3) ... [2025-03-04 04:42:59,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70be6c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:42:59, skipping insertion in model container [2025-03-04 04:42:59,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:42:52" (2/3) ... [2025-03-04 04:42:59,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70be6c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:42:59, skipping insertion in model container [2025-03-04 04:42:59,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:42:59" (3/3) ... [2025-03-04 04:42:59,984 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--net--ethernet--realtek--atp.ko-entry_point.cil.out.i [2025-03-04 04:42:59,996 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:42:59,999 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--net--ethernet--realtek--atp.ko-entry_point.cil.out.i that has 41 procedures, 924 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 04:43:00,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:43:00,077 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;@2cd497cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:43:00,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:43:00,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 923 states, 639 states have (on average 1.3708920187793427) internal successors, (876), 654 states have internal predecessors, (876), 243 states have call successors, (243), 40 states have call predecessors, (243), 39 states have return successors, (238), 236 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-04 04:43:00,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-04 04:43:00,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:43:00,115 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:43:00,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:43:00,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:43:00,121 INFO L85 PathProgramCache]: Analyzing trace with hash -18470912, now seen corresponding path program 1 times [2025-03-04 04:43:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:43:00,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928551753] [2025-03-04 04:43:00,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:43:00,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:43:02,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-04 04:43:02,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-04 04:43:02,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:43:02,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:43:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2471 trivial. 0 not checked. [2025-03-04 04:43:02,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:43:02,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928551753] [2025-03-04 04:43:02,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928551753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:43:02,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124216913] [2025-03-04 04:43:02,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:43:02,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:43:02,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:43:02,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:43:02,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 04:43:04,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-04 04:43:04,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-04 04:43:04,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:43:04,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:43:04,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 2750 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 04:43:04,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:43:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2467 trivial. 0 not checked. [2025-03-04 04:43:04,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:43:04,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124216913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:43:04,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:43:04,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 04:43:04,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481151147] [2025-03-04 04:43:04,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:43:04,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 04:43:04,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:43:05,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 04:43:05,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 04:43:05,011 INFO L87 Difference]: Start difference. First operand has 923 states, 639 states have (on average 1.3708920187793427) internal successors, (876), 654 states have internal predecessors, (876), 243 states have call successors, (243), 40 states have call predecessors, (243), 39 states have return successors, (238), 236 states have call predecessors, (238), 238 states have call successors, (238) Second operand has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-04 04:43:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:43:05,404 INFO L93 Difference]: Finished difference Result 1841 states and 2789 transitions. [2025-03-04 04:43:05,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 04:43:05,406 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 363 [2025-03-04 04:43:05,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:43:05,422 INFO L225 Difference]: With dead ends: 1841 [2025-03-04 04:43:05,422 INFO L226 Difference]: Without dead ends: 901 [2025-03-04 04:43:05,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 04:43:05,437 INFO L435 NwaCegarLoop]: 1294 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:43:05,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1294 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 04:43:05,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2025-03-04 04:43:05,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2025-03-04 04:43:05,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 626 states have (on average 1.3370607028753994) internal successors, (837), 634 states have internal predecessors, (837), 236 states have call successors, (236), 39 states have call predecessors, (236), 38 states have return successors, (235), 233 states have call predecessors, (235), 235 states have call successors, (235) [2025-03-04 04:43:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1308 transitions. [2025-03-04 04:43:05,559 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1308 transitions. Word has length 363 [2025-03-04 04:43:05,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:43:05,564 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1308 transitions. [2025-03-04 04:43:05,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-04 04:43:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1308 transitions. [2025-03-04 04:43:05,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-04 04:43:05,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:43:05,580 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 04:43:05,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 04:43:05,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 04:43:05,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:43:05,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:43:05,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2061424548, now seen corresponding path program 1 times [2025-03-04 04:43:05,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:43:05,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800340743] [2025-03-04 04:43:05,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:43:05,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:43:07,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-04 04:43:07,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-04 04:43:07,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:43:07,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:43:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1720 trivial. 0 not checked. [2025-03-04 04:43:08,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:43:08,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800340743] [2025-03-04 04:43:08,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800340743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:43:08,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:43:08,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:43:08,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833776881] [2025-03-04 04:43:08,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:43:08,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:43:08,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:43:08,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:43:08,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:43:08,109 INFO L87 Difference]: Start difference. First operand 901 states and 1308 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-04 04:43:09,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:43:09,623 INFO L93 Difference]: Finished difference Result 2686 states and 3899 transitions. [2025-03-04 04:43:09,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 04:43:09,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 323 [2025-03-04 04:43:09,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:43:09,639 INFO L225 Difference]: With dead ends: 2686 [2025-03-04 04:43:09,640 INFO L226 Difference]: Without dead ends: 1795 [2025-03-04 04:43:09,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 04:43:09,647 INFO L435 NwaCegarLoop]: 1310 mSDtfsCounter, 1289 mSDsluCounter, 3854 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 5164 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:43:09,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 5164 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 04:43:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2025-03-04 04:43:09,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1786. [2025-03-04 04:43:09,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1239 states have (on average 1.3357546408393866) internal successors, (1655), 1259 states have internal predecessors, (1655), 469 states have call successors, (469), 78 states have call predecessors, (469), 77 states have return successors, (468), 460 states have call predecessors, (468), 468 states have call successors, (468) [2025-03-04 04:43:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2592 transitions. [2025-03-04 04:43:09,734 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2592 transitions. Word has length 323 [2025-03-04 04:43:09,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:43:09,735 INFO L471 AbstractCegarLoop]: Abstraction has 1786 states and 2592 transitions. [2025-03-04 04:43:09,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-04 04:43:09,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2592 transitions. [2025-03-04 04:43:09,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-04 04:43:09,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:43:09,748 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:43:09,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:43:09,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:43:09,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:43:09,749 INFO L85 PathProgramCache]: Analyzing trace with hash 882387818, now seen corresponding path program 1 times [2025-03-04 04:43:09,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:43:09,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077413559] [2025-03-04 04:43:09,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:43:09,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:43:11,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-04 04:43:11,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-04 04:43:11,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:43:11,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:43:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2476 trivial. 0 not checked. [2025-03-04 04:43:11,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:43:11,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077413559] [2025-03-04 04:43:11,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077413559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:43:11,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:43:11,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:43:11,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405613255] [2025-03-04 04:43:11,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:43:11,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:43:11,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:43:11,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:43:11,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:43:11,989 INFO L87 Difference]: Start difference. First operand 1786 states and 2592 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 3 states have call successors, (46), 3 states have call predecessors, (46), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-03-04 04:43:13,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:43:13,882 INFO L93 Difference]: Finished difference Result 5351 states and 7764 transitions. [2025-03-04 04:43:13,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 04:43:13,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 3 states have call successors, (46), 3 states have call predecessors, (46), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 364 [2025-03-04 04:43:13,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:43:13,907 INFO L225 Difference]: With dead ends: 5351 [2025-03-04 04:43:13,907 INFO L226 Difference]: Without dead ends: 3575 [2025-03-04 04:43:13,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 04:43:13,920 INFO L435 NwaCegarLoop]: 1625 mSDtfsCounter, 1291 mSDsluCounter, 4482 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 6107 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 04:43:13,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 6107 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 04:43:13,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3575 states. [2025-03-04 04:43:14,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3575 to 3562. [2025-03-04 04:43:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3562 states, 2472 states have (on average 1.3345469255663431) internal successors, (3299), 2511 states have internal predecessors, (3299), 934 states have call successors, (934), 156 states have call predecessors, (934), 155 states have return successors, (933), 918 states have call predecessors, (933), 933 states have call successors, (933) [2025-03-04 04:43:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3562 states to 3562 states and 5166 transitions. [2025-03-04 04:43:14,068 INFO L78 Accepts]: Start accepts. Automaton has 3562 states and 5166 transitions. Word has length 364 [2025-03-04 04:43:14,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:43:14,068 INFO L471 AbstractCegarLoop]: Abstraction has 3562 states and 5166 transitions. [2025-03-04 04:43:14,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 3 states have call successors, (46), 3 states have call predecessors, (46), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-03-04 04:43:14,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states and 5166 transitions. [2025-03-04 04:43:14,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-04 04:43:14,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:43:14,082 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:43:14,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:43:14,082 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:43:14,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:43:14,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1984345221, now seen corresponding path program 1 times [2025-03-04 04:43:14,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:43:14,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293925349] [2025-03-04 04:43:14,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:43:14,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:43:15,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-04 04:43:15,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-04 04:43:15,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:43:15,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:43:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2476 trivial. 0 not checked. [2025-03-04 04:43:16,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:43:16,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293925349] [2025-03-04 04:43:16,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293925349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:43:16,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:43:16,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:43:16,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518287175] [2025-03-04 04:43:16,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:43:16,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:43:16,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:43:16,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:43:16,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:43:16,083 INFO L87 Difference]: Start difference. First operand 3562 states and 5166 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (46), 3 states have call predecessors, (46), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-03-04 04:43:17,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:43:17,641 INFO L93 Difference]: Finished difference Result 10694 states and 15504 transitions. [2025-03-04 04:43:17,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 04:43:17,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (46), 3 states have call predecessors, (46), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 365 [2025-03-04 04:43:17,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:43:17,682 INFO L225 Difference]: With dead ends: 10694 [2025-03-04 04:43:17,683 INFO L226 Difference]: Without dead ends: 7142 [2025-03-04 04:43:17,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 04:43:17,704 INFO L435 NwaCegarLoop]: 1262 mSDtfsCounter, 1292 mSDsluCounter, 3757 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 5019 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:43:17,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 5019 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 04:43:17,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7142 states. [2025-03-04 04:43:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7142 to 7119. [2025-03-04 04:43:17,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7119 states, 4943 states have (on average 1.3334007687639085) internal successors, (6591), 5019 states have internal predecessors, (6591), 1863 states have call successors, (1863), 313 states have call predecessors, (1863), 312 states have return successors, (1862), 1834 states have call predecessors, (1862), 1862 states have call successors, (1862) [2025-03-04 04:43:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7119 states to 7119 states and 10316 transitions. [2025-03-04 04:43:17,979 INFO L78 Accepts]: Start accepts. Automaton has 7119 states and 10316 transitions. Word has length 365 [2025-03-04 04:43:17,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:43:17,980 INFO L471 AbstractCegarLoop]: Abstraction has 7119 states and 10316 transitions. [2025-03-04 04:43:17,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (46), 3 states have call predecessors, (46), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-03-04 04:43:17,982 INFO L276 IsEmpty]: Start isEmpty. Operand 7119 states and 10316 transitions. [2025-03-04 04:43:17,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-04 04:43:18,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:43:18,001 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:43:18,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:43:18,001 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:43:18,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:43:18,003 INFO L85 PathProgramCache]: Analyzing trace with hash -886598210, now seen corresponding path program 1 times [2025-03-04 04:43:18,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:43:18,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715211992] [2025-03-04 04:43:18,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:43:18,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:43:19,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-04 04:43:19,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-04 04:43:19,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:43:19,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:43:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2476 trivial. 0 not checked. [2025-03-04 04:43:20,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:43:20,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715211992] [2025-03-04 04:43:20,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715211992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:43:20,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:43:20,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:43:20,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067485659] [2025-03-04 04:43:20,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:43:20,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:43:20,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:43:20,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:43:20,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:43:20,104 INFO L87 Difference]: Start difference. First operand 7119 states and 10316 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 3 states have call successors, (46), 3 states have call predecessors, (46), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-03-04 04:43:21,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:43:21,954 INFO L93 Difference]: Finished difference Result 21145 states and 30598 transitions. [2025-03-04 04:43:21,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 04:43:21,955 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), 3 states have call successors, (46), 3 states have call predecessors, (46), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 363 [2025-03-04 04:43:21,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:43:22,060 INFO L225 Difference]: With dead ends: 21145 [2025-03-04 04:43:22,060 INFO L226 Difference]: Without dead ends: 14036 [2025-03-04 04:43:22,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 04:43:22,096 INFO L435 NwaCegarLoop]: 1627 mSDtfsCounter, 1290 mSDsluCounter, 4486 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 6113 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 04:43:22,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 6113 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 04:43:22,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14036 states. [2025-03-04 04:43:22,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14036 to 13994. [2025-03-04 04:43:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13994 states, 9722 states have (on average 1.3302818350133718) internal successors, (12933), 9865 states have internal predecessors, (12933), 3647 states have call successors, (3647), 625 states have call predecessors, (3647), 624 states have return successors, (3646), 3596 states have call predecessors, (3646), 3646 states have call successors, (3646) [2025-03-04 04:43:22,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13994 states to 13994 states and 20226 transitions. [2025-03-04 04:43:22,704 INFO L78 Accepts]: Start accepts. Automaton has 13994 states and 20226 transitions. Word has length 363 [2025-03-04 04:43:22,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:43:22,704 INFO L471 AbstractCegarLoop]: Abstraction has 13994 states and 20226 transitions. [2025-03-04 04:43:22,705 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), 3 states have call successors, (46), 3 states have call predecessors, (46), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-03-04 04:43:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 13994 states and 20226 transitions. [2025-03-04 04:43:22,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-04 04:43:22,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:43:22,726 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:43:22,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 04:43:22,726 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:43:22,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:43:22,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1094119460, now seen corresponding path program 1 times [2025-03-04 04:43:22,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:43:22,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141315950] [2025-03-04 04:43:22,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:43:22,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:43:24,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-04 04:43:24,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-04 04:43:24,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:43:24,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:43:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1725 trivial. 0 not checked. [2025-03-04 04:43:25,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:43:25,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141315950] [2025-03-04 04:43:25,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141315950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:43:25,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136115971] [2025-03-04 04:43:25,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:43:25,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:43:25,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:43:25,068 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:43:25,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 04:43:27,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-04 04:43:27,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-04 04:43:27,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:43:27,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:43:27,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 2682 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 04:43:27,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:43:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1727 trivial. 0 not checked. [2025-03-04 04:43:27,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:43:27,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136115971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:43:27,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:43:27,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-04 04:43:27,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190716573] [2025-03-04 04:43:27,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:43:27,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:43:27,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:43:27,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:43:27,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 04:43:27,545 INFO L87 Difference]: Start difference. First operand 13994 states and 20226 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 04:43:28,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:43:28,266 INFO L93 Difference]: Finished difference Result 14012 states and 20258 transitions. [2025-03-04 04:43:28,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:43:28,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 335 [2025-03-04 04:43:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:43:28,337 INFO L225 Difference]: With dead ends: 14012 [2025-03-04 04:43:28,337 INFO L226 Difference]: Without dead ends: 14009 [2025-03-04 04:43:28,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 04:43:28,350 INFO L435 NwaCegarLoop]: 1264 mSDtfsCounter, 0 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 04:43:28,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2523 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 04:43:28,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14009 states. [2025-03-04 04:43:28,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14009 to 14009. [2025-03-04 04:43:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14009 states, 9737 states have (on average 1.32977303070761) internal successors, (12948), 9880 states have internal predecessors, (12948), 3647 states have call successors, (3647), 625 states have call predecessors, (3647), 624 states have return successors, (3646), 3596 states have call predecessors, (3646), 3646 states have call successors, (3646) [2025-03-04 04:43:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14009 states to 14009 states and 20241 transitions. [2025-03-04 04:43:28,966 INFO L78 Accepts]: Start accepts. Automaton has 14009 states and 20241 transitions. Word has length 335 [2025-03-04 04:43:28,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:43:28,968 INFO L471 AbstractCegarLoop]: Abstraction has 14009 states and 20241 transitions. [2025-03-04 04:43:28,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 04:43:28,968 INFO L276 IsEmpty]: Start isEmpty. Operand 14009 states and 20241 transitions. [2025-03-04 04:43:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-04 04:43:28,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:43:28,985 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:43:28,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 04:43:29,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 04:43:29,187 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:43:29,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:43:29,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1009802761, now seen corresponding path program 1 times [2025-03-04 04:43:29,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:43:29,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870868017] [2025-03-04 04:43:29,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:43:29,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:43:30,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-04 04:43:30,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 04:43:30,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:43:30,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:43:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2483 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2481 trivial. 0 not checked. [2025-03-04 04:43:31,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:43:31,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870868017] [2025-03-04 04:43:31,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870868017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:43:31,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404569739] [2025-03-04 04:43:31,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:43:31,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:43:31,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:43:31,694 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:43:31,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 04:43:33,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-04 04:43:34,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 04:43:34,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:43:34,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:43:34,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 2814 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 04:43:34,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:43:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2483 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2483 trivial. 0 not checked. [2025-03-04 04:43:34,130 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:43:34,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404569739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:43:34,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:43:34,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-04 04:43:34,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579202136] [2025-03-04 04:43:34,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:43:34,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:43:34,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:43:34,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:43:34,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 04:43:34,132 INFO L87 Difference]: Start difference. First operand 14009 states and 20241 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 04:43:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:43:34,941 INFO L93 Difference]: Finished difference Result 28023 states and 40561 transitions. [2025-03-04 04:43:34,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:43:34,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 376 [2025-03-04 04:43:34,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:43:35,012 INFO L225 Difference]: With dead ends: 28023 [2025-03-04 04:43:35,012 INFO L226 Difference]: Without dead ends: 14024 [2025-03-04 04:43:35,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 04:43:35,069 INFO L435 NwaCegarLoop]: 1264 mSDtfsCounter, 0 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 04:43:35,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2525 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 04:43:35,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14024 states. [2025-03-04 04:43:35,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14024 to 14024. [2025-03-04 04:43:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14024 states, 9752 states have (on average 1.3292657916324857) internal successors, (12963), 9895 states have internal predecessors, (12963), 3647 states have call successors, (3647), 625 states have call predecessors, (3647), 624 states have return successors, (3646), 3596 states have call predecessors, (3646), 3646 states have call successors, (3646) [2025-03-04 04:43:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14024 states to 14024 states and 20256 transitions. [2025-03-04 04:43:35,588 INFO L78 Accepts]: Start accepts. Automaton has 14024 states and 20256 transitions. Word has length 376 [2025-03-04 04:43:35,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:43:35,591 INFO L471 AbstractCegarLoop]: Abstraction has 14024 states and 20256 transitions. [2025-03-04 04:43:35,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 04:43:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 14024 states and 20256 transitions. [2025-03-04 04:43:35,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-04 04:43:35,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:43:35,614 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:43:35,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 04:43:35,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:43:35,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:43:35,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:43:35,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1641652716, now seen corresponding path program 1 times [2025-03-04 04:43:35,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:43:35,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385133616] [2025-03-04 04:43:35,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:43:35,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:43:37,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-04 04:43:37,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-04 04:43:37,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:43:37,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:43:38,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2483 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2481 trivial. 0 not checked. [2025-03-04 04:43:38,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:43:38,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385133616] [2025-03-04 04:43:38,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385133616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:43:38,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115794813] [2025-03-04 04:43:38,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:43:38,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:43:38,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:43:38,498 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:43:38,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 04:43:40,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-04 04:43:40,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-04 04:43:40,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:43:40,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:43:40,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 2815 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 04:43:40,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:43:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2483 backedges. 1268 proven. 0 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2025-03-04 04:43:41,110 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:43:41,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115794813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:43:41,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:43:41,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-04 04:43:41,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925175525] [2025-03-04 04:43:41,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:43:41,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:43:41,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:43:41,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:43:41,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 04:43:41,112 INFO L87 Difference]: Start difference. First operand 14024 states and 20256 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-03-04 04:43:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:43:41,934 INFO L93 Difference]: Finished difference Result 28053 states and 40561 transitions. [2025-03-04 04:43:41,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:43:41,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 377 [2025-03-04 04:43:41,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:43:42,006 INFO L225 Difference]: With dead ends: 28053 [2025-03-04 04:43:42,006 INFO L226 Difference]: Without dead ends: 14039 [2025-03-04 04:43:42,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 04:43:42,062 INFO L435 NwaCegarLoop]: 1264 mSDtfsCounter, 0 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 04:43:42,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2523 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 04:43:42,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14039 states. [2025-03-04 04:43:42,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14039 to 14039. [2025-03-04 04:43:42,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14039 states, 9767 states have (on average 1.3287601105764308) internal successors, (12978), 9910 states have internal predecessors, (12978), 3647 states have call successors, (3647), 625 states have call predecessors, (3647), 624 states have return successors, (3646), 3596 states have call predecessors, (3646), 3646 states have call successors, (3646) [2025-03-04 04:43:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14039 states to 14039 states and 20271 transitions. [2025-03-04 04:43:42,520 INFO L78 Accepts]: Start accepts. Automaton has 14039 states and 20271 transitions. Word has length 377 [2025-03-04 04:43:42,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:43:42,521 INFO L471 AbstractCegarLoop]: Abstraction has 14039 states and 20271 transitions. [2025-03-04 04:43:42,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-03-04 04:43:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 14039 states and 20271 transitions. [2025-03-04 04:43:42,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-04 04:43:42,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:43:42,535 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:43:42,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 04:43:42,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:43:42,737 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:43:42,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:43:42,737 INFO L85 PathProgramCache]: Analyzing trace with hash 159795849, now seen corresponding path program 1 times [2025-03-04 04:43:42,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:43:42,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656132270] [2025-03-04 04:43:42,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:43:42,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:43:44,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-04 04:43:44,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-04 04:43:44,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:43:44,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:43:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2483 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2481 trivial. 0 not checked. [2025-03-04 04:43:45,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:43:45,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656132270] [2025-03-04 04:43:45,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656132270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:43:45,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260458770] [2025-03-04 04:43:45,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:43:45,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:43:45,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:43:45,067 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:43:45,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 04:43:47,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-04 04:43:47,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-04 04:43:47,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:43:47,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:43:47,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 2816 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 04:43:47,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:43:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2483 backedges. 1035 proven. 0 refuted. 0 times theorem prover too weak. 1448 trivial. 0 not checked. [2025-03-04 04:43:47,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:43:47,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260458770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:43:47,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:43:47,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-04 04:43:47,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128695791] [2025-03-04 04:43:47,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:43:47,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:43:47,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:43:47,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:43:47,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 04:43:47,701 INFO L87 Difference]: Start difference. First operand 14039 states and 20271 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 04:43:48,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:43:48,426 INFO L93 Difference]: Finished difference Result 28083 states and 40591 transitions. [2025-03-04 04:43:48,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:43:48,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 378 [2025-03-04 04:43:48,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:43:48,490 INFO L225 Difference]: With dead ends: 28083 [2025-03-04 04:43:48,490 INFO L226 Difference]: Without dead ends: 14054 [2025-03-04 04:43:48,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 04:43:48,540 INFO L435 NwaCegarLoop]: 1264 mSDtfsCounter, 0 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 04:43:48,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2523 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 04:43:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14054 states. [2025-03-04 04:43:48,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14054 to 14054. [2025-03-04 04:43:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14054 states, 9782 states have (on average 1.3282559803721121) internal successors, (12993), 9925 states have internal predecessors, (12993), 3647 states have call successors, (3647), 625 states have call predecessors, (3647), 624 states have return successors, (3646), 3596 states have call predecessors, (3646), 3646 states have call successors, (3646) [2025-03-04 04:43:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14054 states to 14054 states and 20286 transitions. [2025-03-04 04:43:48,929 INFO L78 Accepts]: Start accepts. Automaton has 14054 states and 20286 transitions. Word has length 378 [2025-03-04 04:43:48,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:43:48,930 INFO L471 AbstractCegarLoop]: Abstraction has 14054 states and 20286 transitions. [2025-03-04 04:43:48,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 04:43:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 14054 states and 20286 transitions. [2025-03-04 04:43:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-03-04 04:43:48,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:43:48,943 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:43:48,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 04:43:49,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:43:49,144 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:43:49,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:43:49,145 INFO L85 PathProgramCache]: Analyzing trace with hash 141539384, now seen corresponding path program 1 times [2025-03-04 04:43:49,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:43:49,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092543862] [2025-03-04 04:43:49,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:43:49,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:43:50,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-04 04:43:50,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-04 04:43:50,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:43:50,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:43:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2483 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2481 trivial. 0 not checked. [2025-03-04 04:43:51,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:43:51,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092543862] [2025-03-04 04:43:51,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092543862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:43:51,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394679050] [2025-03-04 04:43:51,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:43:51,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:43:51,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:43:51,398 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:43:51,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 04:43:53,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-04 04:43:54,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-04 04:43:54,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:43:54,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:43:54,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 2817 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 04:43:54,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:43:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2483 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2476 trivial. 0 not checked. [2025-03-04 04:43:54,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:43:54,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394679050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:43:54,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:43:54,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-03-04 04:43:54,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348776507] [2025-03-04 04:43:54,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:43:54,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 04:43:54,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:43:54,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 04:43:54,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-04 04:43:54,663 INFO L87 Difference]: Start difference. First operand 14054 states and 20286 transitions. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (43), 3 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 04:43:57,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:43:57,068 INFO L93 Difference]: Finished difference Result 35184 states and 50752 transitions. [2025-03-04 04:43:57,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 04:43:57,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (43), 3 states have call predecessors, (43), 2 states have call successors, (43) Word has length 379 [2025-03-04 04:43:57,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:43:57,163 INFO L225 Difference]: With dead ends: 35184 [2025-03-04 04:43:57,163 INFO L226 Difference]: Without dead ends: 21140 [2025-03-04 04:43:57,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-03-04 04:43:57,225 INFO L435 NwaCegarLoop]: 1324 mSDtfsCounter, 1321 mSDsluCounter, 6539 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 7863 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 04:43:57,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 7863 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 04:43:57,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21140 states. [2025-03-04 04:43:57,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21140 to 20991. [2025-03-04 04:43:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20991 states, 14623 states have (on average 1.3288654858784108) internal successors, (19432), 14845 states have internal predecessors, (19432), 5427 states have call successors, (5427), 933 states have call predecessors, (5427), 940 states have return successors, (5446), 5350 states have call predecessors, (5446), 5426 states have call successors, (5446) [2025-03-04 04:43:57,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20991 states to 20991 states and 30305 transitions. [2025-03-04 04:43:57,837 INFO L78 Accepts]: Start accepts. Automaton has 20991 states and 30305 transitions. Word has length 379 [2025-03-04 04:43:57,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:43:57,838 INFO L471 AbstractCegarLoop]: Abstraction has 20991 states and 30305 transitions. [2025-03-04 04:43:57,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (43), 3 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 04:43:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 20991 states and 30305 transitions. [2025-03-04 04:43:57,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-03-04 04:43:57,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:43:57,860 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:43:57,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 04:43:58,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:43:58,061 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:43:58,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:43:58,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2073536930, now seen corresponding path program 1 times [2025-03-04 04:43:58,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:43:58,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160216613] [2025-03-04 04:43:58,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:43:58,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:43:59,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-04 04:43:59,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-04 04:43:59,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:43:59,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:44:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2482 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2476 trivial. 0 not checked. [2025-03-04 04:44:00,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:44:00,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160216613] [2025-03-04 04:44:00,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160216613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:44:00,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933906811] [2025-03-04 04:44:00,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:44:00,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:44:00,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:44:00,489 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:44:00,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 04:44:02,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-04 04:44:02,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-04 04:44:02,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:44:02,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:44:02,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 2819 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 04:44:02,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:44:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2482 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2476 trivial. 0 not checked. [2025-03-04 04:44:03,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:44:03,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933906811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:44:03,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:44:03,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2025-03-04 04:44:03,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402007854] [2025-03-04 04:44:03,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:44:03,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 04:44:03,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:44:03,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 04:44:03,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-04 04:44:03,408 INFO L87 Difference]: Start difference. First operand 20991 states and 30305 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 5 states have internal predecessors, (118), 3 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (43), 3 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 04:44:06,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:44:06,452 INFO L93 Difference]: Finished difference Result 49111 states and 70836 transitions. [2025-03-04 04:44:06,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 04:44:06,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 5 states have internal predecessors, (118), 3 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (43), 3 states have call predecessors, (43), 2 states have call successors, (43) Word has length 380 [2025-03-04 04:44:06,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:44:06,557 INFO L225 Difference]: With dead ends: 49111 [2025-03-04 04:44:06,558 INFO L226 Difference]: Without dead ends: 28130 [2025-03-04 04:44:06,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-04 04:44:06,619 INFO L435 NwaCegarLoop]: 1700 mSDtfsCounter, 1321 mSDsluCounter, 8029 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 9729 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:44:06,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 9729 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 04:44:06,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28130 states. [2025-03-04 04:44:07,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28130 to 27960. [2025-03-04 04:44:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27960 states, 19484 states have (on average 1.3288339150071853) internal successors, (25891), 19801 states have internal predecessors, (25891), 7207 states have call successors, (7207), 1241 states have call predecessors, (7207), 1268 states have return successors, (7258), 7100 states have call predecessors, (7258), 7206 states have call successors, (7258) [2025-03-04 04:44:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27960 states to 27960 states and 40356 transitions. [2025-03-04 04:44:07,398 INFO L78 Accepts]: Start accepts. Automaton has 27960 states and 40356 transitions. Word has length 380 [2025-03-04 04:44:07,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:44:07,399 INFO L471 AbstractCegarLoop]: Abstraction has 27960 states and 40356 transitions. [2025-03-04 04:44:07,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 5 states have internal predecessors, (118), 3 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (43), 3 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 04:44:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 27960 states and 40356 transitions. [2025-03-04 04:44:07,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-04 04:44:07,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:44:07,434 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:44:07,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 04:44:07,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:44:07,635 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:44:07,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:44:07,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2013632319, now seen corresponding path program 1 times [2025-03-04 04:44:07,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:44:07,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229605054] [2025-03-04 04:44:07,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:44:07,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:44:09,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-04 04:44:09,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-04 04:44:09,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:44:09,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:44:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1726 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1720 trivial. 0 not checked. [2025-03-04 04:44:09,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:44:09,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229605054] [2025-03-04 04:44:09,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229605054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:44:09,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731859483] [2025-03-04 04:44:09,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:44:09,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:44:09,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:44:09,812 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:44:09,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 04:44:12,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-04 04:44:12,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-04 04:44:12,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:44:12,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:44:12,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 2693 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 04:44:12,782 INFO L279 TraceCheckSpWp]: Computing forward predicates...