./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-32_7a-drivers--message--fusion--mptctl.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-32_7a-drivers--message--fusion--mptctl.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 1cfba800a850f13ff72fddf9946e31aec208a19aa4b82d402046e12670b66199 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 04:25:08,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:25:08,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:25:08,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:25:08,747 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:25:08,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:25:08,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:25:08,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:25:08,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:25:08,761 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:25:08,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:25:08,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:25:08,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:25:08,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:25:08,762 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:25:08,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:25:08,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:25:08,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:25:08,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:25:08,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:25:08,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:25:08,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:25:08,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:25:08,762 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:25:08,763 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:25:08,763 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:25:08,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:25:08,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:25:08,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:25:08,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:25:08,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:25:08,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:25:08,763 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:25:08,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:25:08,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:25:08,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:25:08,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:25:08,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:25:08,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:25:08,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:25:08,764 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 -> 1cfba800a850f13ff72fddf9946e31aec208a19aa4b82d402046e12670b66199 [2025-03-04 04:25:08,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:25:09,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:25:09,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:25:09,014 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:25:09,014 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:25:09,015 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-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i [2025-03-04 04:25:10,229 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81efc0417/25716884047a4a5c8b241b37cdea4d8c/FLAG5fb5e405d [2025-03-04 04:25:10,687 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:25:10,688 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i [2025-03-04 04:25:10,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81efc0417/25716884047a4a5c8b241b37cdea4d8c/FLAG5fb5e405d [2025-03-04 04:25:10,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81efc0417/25716884047a4a5c8b241b37cdea4d8c [2025-03-04 04:25:10,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:25:10,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:25:10,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:25:10,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:25:10,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:25:10,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:25:10" (1/1) ... [2025-03-04 04:25:10,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df085a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:10, skipping insertion in model container [2025-03-04 04:25:10,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:25:10" (1/1) ... [2025-03-04 04:25:10,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:25:12,275 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-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i[277952,277965] [2025-03-04 04:25:12,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:25:12,456 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:25:12,563 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/asm-generic/dma-mapping-common.h"), "i" (19), "i" (12UL)); [5693-5694] [2025-03-04 04:25:12,566 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/asm-generic/dma-mapping-common.h"), "i" (36), "i" (12UL)); [5722-5723] [2025-03-04 04:25:12,753 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-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i[277952,277965] [2025-03-04 04:25:12,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:25:12,811 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:25:12,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:12 WrapperNode [2025-03-04 04:25:12,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:25:12,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:25:12,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:25:12,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:25:12,818 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:25:12" (1/1) ... [2025-03-04 04:25:12,890 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:25:12" (1/1) ... [2025-03-04 04:25:13,099 INFO L138 Inliner]: procedures = 258, calls = 2402, calls flagged for inlining = 96, calls inlined = 93, statements flattened = 6774 [2025-03-04 04:25:13,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:25:13,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:25:13,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:25:13,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:25:13,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:12" (1/1) ... [2025-03-04 04:25:13,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:12" (1/1) ... [2025-03-04 04:25:13,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:12" (1/1) ... [2025-03-04 04:25:13,668 INFO L175 MemorySlicer]: Split 1117 memory accesses to 24 slices as follows [2, 11, 6, 25, 57, 11, 26, 294, 2, 1, 8, 8, 4, 17, 2, 36, 15, 16, 549, 2, 5, 1, 13, 6]. 49 percent of accesses are in the largest equivalence class. The 30 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 0, 0, 1, 8, 8, 0, 0, 2, 7, 0, 0, 0, 2, 0, 0, 0, 0]. The 309 writes are split as follows [0, 1, 3, 22, 16, 4, 12, 3, 1, 0, 0, 0, 1, 12, 0, 29, 0, 12, 184, 0, 2, 0, 4, 3]. [2025-03-04 04:25:13,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:12" (1/1) ... [2025-03-04 04:25:13,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:12" (1/1) ... [2025-03-04 04:25:13,766 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:12" (1/1) ... [2025-03-04 04:25:13,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:12" (1/1) ... [2025-03-04 04:25:13,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:12" (1/1) ... [2025-03-04 04:25:13,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:12" (1/1) ... [2025-03-04 04:25:13,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:25:13,880 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:25:13,880 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:25:13,881 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:25:13,882 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:12" (1/1) ... [2025-03-04 04:25:13,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:25:13,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:25:13,907 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:25:13,910 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:25:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:25:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:25:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:25:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 04:25:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 04:25:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 04:25:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 04:25:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 04:25:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 04:25:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 04:25:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 04:25:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 04:25:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 04:25:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 04:25:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 04:25:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 04:25:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 04:25:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 04:25:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 04:25:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-04 04:25:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-04 04:25:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-04 04:25:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-03-04 04:25:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2025-03-04 04:25:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:25:13,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:25:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 04:25:13,929 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 04:25:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~~dma_addr_t~0~TO~VOID [2025-03-04 04:25:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~~dma_addr_t~0~TO~VOID [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2025-03-04 04:25:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mpctl_mutex [2025-03-04 04:25:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mpctl_mutex [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:25:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_GetIocState [2025-03-04 04:25:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_GetIocState [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2025-03-04 04:25:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure __scsi_iterate_devices [2025-03-04 04:25:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure __scsi_iterate_devices [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-04 04:25:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 04:25:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_syscall_down [2025-03-04 04:25:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_syscall_down [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_device_driver_deregister [2025-03-04 04:25:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_device_driver_deregister [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2025-03-04 04:25:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_remove [2025-03-04 04:25:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_remove [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-04 04:25:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-04 04:25:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-04 04:25:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-04 04:25:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-04 04:25:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-03-04 04:25:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-03-04 04:25:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-03-04 04:25:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-03-04 04:25:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-03-04 04:25:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#20 [2025-03-04 04:25:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#21 [2025-03-04 04:25:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#22 [2025-03-04 04:25:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#23 [2025-03-04 04:25:13,931 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 04:25:13,931 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 04:25:13,931 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 04:25:13,931 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-04 04:25:13,931 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-04 04:25:13,931 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-04 04:25:13,931 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-04 04:25:13,931 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-04 04:25:13,931 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-04 04:25:13,931 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-04 04:25:13,931 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-04 04:25:13,931 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-04 04:25:13,933 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-04 04:25:13,933 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-04 04:25:13,933 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-04 04:25:13,934 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-03-04 04:25:13,934 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-03-04 04:25:13,934 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-03-04 04:25:13,934 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-03-04 04:25:13,935 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-03-04 04:25:13,935 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#20 [2025-03-04 04:25:13,935 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#21 [2025-03-04 04:25:13,935 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#22 [2025-03-04 04:25:13,935 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#23 [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:25:13,935 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_put_msg_frame [2025-03-04 04:25:13,935 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_put_msg_frame [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure pci_alloc_consistent [2025-03-04 04:25:13,935 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_alloc_consistent [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-04 04:25:13,935 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-04 04:25:13,935 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure __mptctl_ioctl [2025-03-04 04:25:13,935 INFO L138 BoogieDeclarations]: Found implementation of procedure __mptctl_ioctl [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_do_mpt_command [2025-03-04 04:25:13,935 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_do_mpt_command [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_do_fw_download [2025-03-04 04:25:13,935 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_do_fw_download [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 04:25:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of__MPT_MGMT [2025-03-04 04:25:13,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of__MPT_MGMT [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_put_msg_frame_hi_pri [2025-03-04 04:25:13,936 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_put_msg_frame_hi_pri [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-04 04:25:13,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-04 04:25:13,936 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_free_fw_memory [2025-03-04 04:25:13,936 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_free_fw_memory [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_do_taskmgmt [2025-03-04 04:25:13,936 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_do_taskmgmt [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_single [2025-03-04 04:25:13,936 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_single [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 04:25:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 04:25:13,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 04:25:13,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_clear_taskmgmt_in_progress_flag [2025-03-04 04:25:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_clear_taskmgmt_in_progress_flag [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 04:25:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_timeout_expired [2025-03-04 04:25:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_timeout_expired [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2025-03-04 04:25:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-04 04:25:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-03-04 04:25:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mpctl_mutex [2025-03-04 04:25:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mpctl_mutex [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_fasync [2025-03-04 04:25:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_fasync [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2025-03-04 04:25:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2025-03-04 04:25:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 04:25:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 04:25:13,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 04:25:13,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 04:25:13,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 04:25:13,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 04:25:13,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 04:25:13,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 04:25:13,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 04:25:13,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 04:25:13,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 04:25:13,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 04:25:13,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_set_taskmgmt_in_progress_flag [2025-03-04 04:25:13,942 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_set_taskmgmt_in_progress_flag [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2025-03-04 04:25:13,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_verify_adapter [2025-03-04 04:25:13,942 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_verify_adapter [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 04:25:13,942 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2025-03-04 04:25:13,942 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:25:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-03-04 04:25:13,943 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_deregister [2025-03-04 04:25:13,943 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_deregister [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_sgl [2025-03-04 04:25:13,943 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_sgl [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 04:25:13,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-04 04:25:13,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:25:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-03-04 04:25:13,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-03-04 04:25:13,944 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2025-03-04 04:25:13,944 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2025-03-04 04:25:13,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:25:13,944 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-04 04:25:13,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-04 04:25:13,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:25:13,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:25:13,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:25:13,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 04:25:13,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 04:25:13,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 04:25:13,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 04:25:13,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 04:25:13,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 04:25:13,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 04:25:13,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 04:25:13,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 04:25:13,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 04:25:13,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 04:25:13,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 04:25:13,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 04:25:13,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_get_msg_frame [2025-03-04 04:25:13,947 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_get_msg_frame [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2025-03-04 04:25:13,947 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of__MPT_MGMT [2025-03-04 04:25:13,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of__MPT_MGMT [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_send_handshake_request [2025-03-04 04:25:13,947 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_send_handshake_request [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_register [2025-03-04 04:25:13,947 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_register [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of__MPT_MGMT [2025-03-04 04:25:13,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of__MPT_MGMT [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure shost_priv [2025-03-04 04:25:13,947 INFO L138 BoogieDeclarations]: Found implementation of procedure shost_priv [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 04:25:13,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 04:25:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 04:25:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 04:25:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 04:25:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-04 04:25:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-04 04:25:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-04 04:25:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-03-04 04:25:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:25:13,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:25:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_config [2025-03-04 04:25:13,948 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_config [2025-03-04 04:25:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_free_msg_frame [2025-03-04 04:25:13,948 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_free_msg_frame [2025-03-04 04:25:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-04 04:25:13,948 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-04 04:25:14,581 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:25:14,586 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:25:14,606 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:25:14,630 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10076: havoc #t~nondet1581; [2025-03-04 04:25:14,672 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9973: havoc #t~nondet1564; [2025-03-04 04:25:14,678 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10061: havoc #t~nondet1578; [2025-03-04 04:25:14,686 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9910: havoc #t~ret1553.base, #t~ret1553.offset; [2025-03-04 04:25:14,738 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8882-1: ldv_mutex_trylock_12_#res#1 := ldv_mutex_trylock_12_~ldv_func_res~1#1; [2025-03-04 04:25:14,738 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10057: havoc mutex_lock_interruptible_#t~nondet1577#1; [2025-03-04 04:25:14,738 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8895-1: ldv_mutex_lock_interruptible_13_#res#1 := ldv_mutex_lock_interruptible_13_~ldv_func_res~2#1; [2025-03-04 04:25:14,774 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9937: havoc dma_alloc_attrs_#t~ret1557#1.base, dma_alloc_attrs_#t~ret1557#1.offset; [2025-03-04 04:25:16,426 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7369: call ULTIMATE.dealloc(mptctl_eventreport_~#karg~5#1.base, mptctl_eventreport_~#karg~5#1.offset);havoc mptctl_eventreport_~#karg~5#1.base, mptctl_eventreport_~#karg~5#1.offset;call ULTIMATE.dealloc(mptctl_eventreport_~#ioc~6#1.base, mptctl_eventreport_~#ioc~6#1.offset);havoc mptctl_eventreport_~#ioc~6#1.base, mptctl_eventreport_~#ioc~6#1.offset; [2025-03-04 04:25:16,426 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6977: call ULTIMATE.dealloc(mptctl_getiocinfo_~#ioc~1#1.base, mptctl_getiocinfo_~#ioc~1#1.offset);havoc mptctl_getiocinfo_~#ioc~1#1.base, mptctl_getiocinfo_~#ioc~1#1.offset; [2025-03-04 04:25:16,426 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6384: call ULTIMATE.dealloc(~#khdr~0#1.base, ~#khdr~0#1.offset);havoc ~#khdr~0#1.base, ~#khdr~0#1.offset;call ULTIMATE.dealloc(~#iocp~0#1.base, ~#iocp~0#1.offset);havoc ~#iocp~0#1.base, ~#iocp~0#1.offset; [2025-03-04 04:25:16,426 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9985: havoc mpt_alloc_fw_memory_#t~nondet1567#1; [2025-03-04 04:25:16,426 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8235: call ULTIMATE.dealloc(mptctl_hp_targetinfo_~#ioc~11#1.base, mptctl_hp_targetinfo_~#ioc~11#1.offset);havoc mptctl_hp_targetinfo_~#ioc~11#1.base, mptctl_hp_targetinfo_~#ioc~11#1.offset;call ULTIMATE.dealloc(mptctl_hp_targetinfo_~#karg~9#1.base, mptctl_hp_targetinfo_~#karg~9#1.offset);havoc mptctl_hp_targetinfo_~#karg~9#1.base, mptctl_hp_targetinfo_~#karg~9#1.offset;call ULTIMATE.dealloc(mptctl_hp_targetinfo_~#page_dma~0#1.base, mptctl_hp_targetinfo_~#page_dma~0#1.offset);havoc mptctl_hp_targetinfo_~#page_dma~0#1.base, mptctl_hp_targetinfo_~#page_dma~0#1.offset;call ULTIMATE.dealloc(mptctl_hp_targetinfo_~#cfg~1#1.base, mptctl_hp_targetinfo_~#cfg~1#1.offset);havoc mptctl_hp_targetinfo_~#cfg~1#1.base, mptctl_hp_targetinfo_~#cfg~1#1.offset;call ULTIMATE.dealloc(mptctl_hp_targetinfo_~#hdr~2#1.base, mptctl_hp_targetinfo_~#hdr~2#1.offset);havoc mptctl_hp_targetinfo_~#hdr~2#1.base, mptctl_hp_targetinfo_~#hdr~2#1.offset; [2025-03-04 04:25:16,426 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7477: call ULTIMATE.dealloc(mptctl_mpt_command_~#karg~7#1.base, mptctl_mpt_command_~#karg~7#1.offset);havoc mptctl_mpt_command_~#karg~7#1.base, mptctl_mpt_command_~#karg~7#1.offset;call ULTIMATE.dealloc(mptctl_mpt_command_~#ioc~8#1.base, mptctl_mpt_command_~#ioc~8#1.offset);havoc mptctl_mpt_command_~#ioc~8#1.base, mptctl_mpt_command_~#ioc~8#1.offset; [2025-03-04 04:25:16,427 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7279: call ULTIMATE.dealloc(mptctl_eventquery_~#karg~3#1.base, mptctl_eventquery_~#karg~3#1.offset);havoc mptctl_eventquery_~#karg~3#1.base, mptctl_eventquery_~#karg~3#1.offset;call ULTIMATE.dealloc(mptctl_eventquery_~#ioc~4#1.base, mptctl_eventquery_~#ioc~4#1.offset);havoc mptctl_eventquery_~#ioc~4#1.base, mptctl_eventquery_~#ioc~4#1.offset; [2025-03-04 04:25:16,427 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6491: call ULTIMATE.dealloc(mptctl_do_reset_~#krinfo~0#1.base, mptctl_do_reset_~#krinfo~0#1.offset);havoc mptctl_do_reset_~#krinfo~0#1.base, mptctl_do_reset_~#krinfo~0#1.offset;call ULTIMATE.dealloc(mptctl_do_reset_~#iocp~1#1.base, mptctl_do_reset_~#iocp~1#1.offset);havoc mptctl_do_reset_~#iocp~1#1.base, mptctl_do_reset_~#iocp~1#1.offset; [2025-03-04 04:25:16,427 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7119: call ULTIMATE.dealloc(mptctl_gettargetinfo_~#karg~1#1.base, mptctl_gettargetinfo_~#karg~1#1.offset);havoc mptctl_gettargetinfo_~#karg~1#1.base, mptctl_gettargetinfo_~#karg~1#1.offset;call ULTIMATE.dealloc(mptctl_gettargetinfo_~#ioc~2#1.base, mptctl_gettargetinfo_~#ioc~2#1.offset);havoc mptctl_gettargetinfo_~#ioc~2#1.base, mptctl_gettargetinfo_~#ioc~2#1.offset; [2025-03-04 04:25:16,427 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9961: havoc memdup_user_#t~ret1561#1.base, memdup_user_#t~ret1561#1.offset; [2025-03-04 04:25:16,427 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7321: call ULTIMATE.dealloc(mptctl_eventenable_~#karg~4#1.base, mptctl_eventenable_~#karg~4#1.offset);havoc mptctl_eventenable_~#karg~4#1.base, mptctl_eventenable_~#karg~4#1.offset;call ULTIMATE.dealloc(mptctl_eventenable_~#ioc~5#1.base, mptctl_eventenable_~#ioc~5#1.offset);havoc mptctl_eventenable_~#ioc~5#1.base, mptctl_eventenable_~#ioc~5#1.offset; [2025-03-04 04:25:16,427 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7422: call ULTIMATE.dealloc(mptctl_replace_fw_~#karg~6#1.base, mptctl_replace_fw_~#karg~6#1.offset);havoc mptctl_replace_fw_~#karg~6#1.base, mptctl_replace_fw_~#karg~6#1.offset;call ULTIMATE.dealloc(mptctl_replace_fw_~#ioc~7#1.base, mptctl_replace_fw_~#ioc~7#1.offset);havoc mptctl_replace_fw_~#ioc~7#1.base, mptctl_replace_fw_~#ioc~7#1.offset; [2025-03-04 04:25:16,427 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6531: call ULTIMATE.dealloc(mptctl_fw_download_~#kfwdl~0#1.base, mptctl_fw_download_~#kfwdl~0#1.offset);havoc mptctl_fw_download_~#kfwdl~0#1.base, mptctl_fw_download_~#kfwdl~0#1.offset; [2025-03-04 04:25:16,427 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5643: havoc pci_domain_nr_#t~mem54#1; [2025-03-04 04:25:16,427 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7993: call ULTIMATE.dealloc(mptctl_hp_hostinfo_~#ioc~10#1.base, mptctl_hp_hostinfo_~#ioc~10#1.offset);havoc mptctl_hp_hostinfo_~#ioc~10#1.base, mptctl_hp_hostinfo_~#ioc~10#1.offset;call ULTIMATE.dealloc(mptctl_hp_hostinfo_~#buf_dma~0#1.base, mptctl_hp_hostinfo_~#buf_dma~0#1.offset);havoc mptctl_hp_hostinfo_~#buf_dma~0#1.base, mptctl_hp_hostinfo_~#buf_dma~0#1.offset;call ULTIMATE.dealloc(mptctl_hp_hostinfo_~#karg~8#1.base, mptctl_hp_hostinfo_~#karg~8#1.offset);havoc mptctl_hp_hostinfo_~#karg~8#1.base, mptctl_hp_hostinfo_~#karg~8#1.offset;call ULTIMATE.dealloc(mptctl_hp_hostinfo_~#cfg~0#1.base, mptctl_hp_hostinfo_~#cfg~0#1.offset);havoc mptctl_hp_hostinfo_~#cfg~0#1.base, mptctl_hp_hostinfo_~#cfg~0#1.offset;call ULTIMATE.dealloc(mptctl_hp_hostinfo_~#hdr~1#1.base, mptctl_hp_hostinfo_~#hdr~1#1.offset);havoc mptctl_hp_hostinfo_~#hdr~1#1.base, mptctl_hp_hostinfo_~#hdr~1#1.offset; [2025-03-04 04:25:16,427 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7234: call ULTIMATE.dealloc(mptctl_readtest_~#karg~2#1.base, mptctl_readtest_~#karg~2#1.offset);havoc mptctl_readtest_~#karg~2#1.base, mptctl_readtest_~#karg~2#1.offset;call ULTIMATE.dealloc(mptctl_readtest_~#ioc~3#1.base, mptctl_readtest_~#ioc~3#1.offset);havoc mptctl_readtest_~#ioc~3#1.base, mptctl_readtest_~#ioc~3#1.offset; [2025-03-04 04:25:16,427 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9977: havoc mpt_HardResetHandler_#t~nondet1565#1; [2025-03-04 04:25:17,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7503: call ULTIMATE.dealloc(~#karg#1.base, ~#karg#1.offset);havoc ~#karg#1.base, ~#karg#1.offset;call ULTIMATE.dealloc(~#ioc~9#1.base, ~#ioc~9#1.offset);havoc ~#ioc~9#1.base, ~#ioc~9#1.offset;call ULTIMATE.dealloc(~#bufIn~0#1.base, ~#bufIn~0#1.offset);havoc ~#bufIn~0#1.base, ~#bufIn~0#1.offset;call ULTIMATE.dealloc(~#bufOut~0#1.base, ~#bufOut~0#1.offset);havoc ~#bufOut~0#1.base, ~#bufOut~0#1.offset;call ULTIMATE.dealloc(~#dma_addr_in~0#1.base, ~#dma_addr_in~0#1.offset);havoc ~#dma_addr_in~0#1.base, ~#dma_addr_in~0#1.offset;call ULTIMATE.dealloc(~#dma_addr_out~0#1.base, ~#dma_addr_out~0#1.offset);havoc ~#dma_addr_out~0#1.base, ~#dma_addr_out~0#1.offset; [2025-03-04 04:25:17,440 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6744: #res#1 := 0;call ULTIMATE.dealloc(~#iocp~2#1.base, ~#iocp~2#1.offset);havoc ~#iocp~2#1.base, ~#iocp~2#1.offset;call ULTIMATE.dealloc(~#buflist~0#1.base, ~#buflist~0#1.offset);havoc ~#buflist~0#1.base, ~#buflist~0#1.offset;call ULTIMATE.dealloc(~#sgl_dma~0#1.base, ~#sgl_dma~0#1.offset);havoc ~#sgl_dma~0#1.base, ~#sgl_dma~0#1.offset;call ULTIMATE.dealloc(~#numfrags~0#1.base, ~#numfrags~0#1.offset);havoc ~#numfrags~0#1.base, ~#numfrags~0#1.offset; [2025-03-04 04:25:17,440 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6766: call ULTIMATE.dealloc(kbuf_alloc_2_sgl_~#pa~0#1.base, kbuf_alloc_2_sgl_~#pa~0#1.offset);havoc kbuf_alloc_2_sgl_~#pa~0#1.base, kbuf_alloc_2_sgl_~#pa~0#1.offset; [2025-03-04 04:25:17,440 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6552: call ULTIMATE.dealloc(~#iocp~2#1.base, ~#iocp~2#1.offset);havoc ~#iocp~2#1.base, ~#iocp~2#1.offset;call ULTIMATE.dealloc(~#buflist~0#1.base, ~#buflist~0#1.offset);havoc ~#buflist~0#1.base, ~#buflist~0#1.offset;call ULTIMATE.dealloc(~#sgl_dma~0#1.base, ~#sgl_dma~0#1.offset);havoc ~#sgl_dma~0#1.base, ~#sgl_dma~0#1.offset;call ULTIMATE.dealloc(~#numfrags~0#1.base, ~#numfrags~0#1.offset);havoc ~#numfrags~0#1.base, ~#numfrags~0#1.offset; [2025-03-04 04:25:17,597 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10072: havoc #t~nondet1580; [2025-03-04 04:25:17,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9981: havoc mpt_Soft_Hard_ResetHandler_#t~nondet1566#1; [2025-03-04 04:25:17,667 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5602: havoc __kmalloc_#t~ret48#1.base, __kmalloc_#t~ret48#1.offset; [2025-03-04 04:25:17,668 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9922: havoc #t~nondet1556; [2025-03-04 04:25:17,685 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9944: havoc fasync_helper_#t~nondet1558#1; [2025-03-04 04:25:17,692 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5672: havoc #t~mem70.base, #t~mem70.offset; [2025-03-04 04:25:17,717 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9965: havoc #t~nondet1562; [2025-03-04 04:25:17,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10046: havoc #t~nondet1575; [2025-03-04 04:25:17,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9907: havoc #t~nondet1552; [2025-03-04 04:25:17,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10050: havoc #t~nondet1576; [2025-03-04 04:25:17,749 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9918: havoc _copy_to_user_#t~nondet1555#1; [2025-03-04 04:25:17,921 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9914: havoc _copy_from_user_#t~nondet1554#1; [2025-03-04 04:25:17,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10018: havoc #t~ret1571.base, #t~ret1571.offset; [2025-03-04 04:25:17,936 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10042: havoc #t~nondet1574; [2025-03-04 04:25:17,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10031: havoc #t~nondet1572; [2025-03-04 04:25:22,874 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8525: call ULTIMATE.dealloc(mptctl_probe_~#__key~1#1.base, mptctl_probe_~#__key~1#1.offset);havoc mptctl_probe_~#__key~1#1.base, mptctl_probe_~#__key~1#1.offset; [2025-03-04 04:25:22,874 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5635: havoc dev_get_drvdata_#t~mem52#1.base, dev_get_drvdata_#t~mem52#1.offset; [2025-03-04 04:25:22,875 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8625: call ULTIMATE.dealloc(main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset);havoc main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset);havoc main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset);havoc main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset);havoc main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset);havoc main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset);havoc main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset);havoc main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset;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:25:22,875 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5588: call ULTIMATE.dealloc(init_completion_~#__key~0#1.base, init_completion_~#__key~0#1.offset);havoc init_completion_~#__key~0#1.base, init_completion_~#__key~0#1.offset; [2025-03-04 04:25:22,875 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8432: call ULTIMATE.dealloc(compat_mpt_command_~#karg32~0#1.base, compat_mpt_command_~#karg32~0#1.offset);havoc compat_mpt_command_~#karg32~0#1.base, compat_mpt_command_~#karg32~0#1.offset;call ULTIMATE.dealloc(compat_mpt_command_~#karg~10#1.base, compat_mpt_command_~#karg~10#1.offset);havoc compat_mpt_command_~#karg~10#1.base, compat_mpt_command_~#karg~10#1.offset;call ULTIMATE.dealloc(compat_mpt_command_~#iocp~4#1.base, compat_mpt_command_~#iocp~4#1.offset);havoc compat_mpt_command_~#iocp~4#1.base, compat_mpt_command_~#iocp~4#1.offset; [2025-03-04 04:25:22,875 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10068: havoc no_llseek_#t~nondet1579#1; [2025-03-04 04:25:22,875 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10002: havoc mpt_device_driver_register_#t~nondet1569#1; [2025-03-04 04:25:22,875 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9969: havoc misc_register_#t~nondet1563#1; [2025-03-04 04:25:22,876 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9954: havoc ldv_open_2_#t~nondet1559#1; [2025-03-04 04:25:22,876 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10038: havoc mpt_reset_register_#t~nondet1573#1; [2025-03-04 04:25:22,876 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9958: havoc ldv_release_2_#t~nondet1560#1; [2025-03-04 04:25:22,877 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8390: call ULTIMATE.dealloc(compat_mptfwxfer_ioctl_~#kfw32~0#1.base, compat_mptfwxfer_ioctl_~#kfw32~0#1.offset);havoc compat_mptfwxfer_ioctl_~#kfw32~0#1.base, compat_mptfwxfer_ioctl_~#kfw32~0#1.offset;call ULTIMATE.dealloc(compat_mptfwxfer_ioctl_~#kfw~0#1.base, compat_mptfwxfer_ioctl_~#kfw~0#1.offset);havoc compat_mptfwxfer_ioctl_~#kfw~0#1.base, compat_mptfwxfer_ioctl_~#kfw~0#1.offset;call ULTIMATE.dealloc(compat_mptfwxfer_ioctl_~#iocp~3#1.base, compat_mptfwxfer_ioctl_~#iocp~3#1.offset);havoc compat_mptfwxfer_ioctl_~#iocp~3#1.base, compat_mptfwxfer_ioctl_~#iocp~3#1.offset; [2025-03-04 04:25:22,877 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10009: havoc mpt_event_register_#t~nondet1570#1; [2025-03-04 04:25:22,882 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9992: havoc #t~nondet1568; [2025-03-04 04:25:23,582 INFO L? ?]: Removed 2189 outVars from TransFormulas that were not future-live. [2025-03-04 04:25:23,582 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:25:23,650 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:25:23,651 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 04:25:23,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:25:23 BoogieIcfgContainer [2025-03-04 04:25:23,654 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:25:23,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:25:23,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:25:23,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:25:23,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:25:10" (1/3) ... [2025-03-04 04:25:23,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ce2bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:25:23, skipping insertion in model container [2025-03-04 04:25:23,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:12" (2/3) ... [2025-03-04 04:25:23,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ce2bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:25:23, skipping insertion in model container [2025-03-04 04:25:23,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:25:23" (3/3) ... [2025-03-04 04:25:23,663 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i [2025-03-04 04:25:23,675 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:25:23,678 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i that has 88 procedures, 1894 locations, 1 initial locations, 24 loop locations, and 1 error locations. [2025-03-04 04:25:23,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:25:23,767 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;@299065a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:25:23,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:25:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 1805 states, 1352 states have (on average 1.4127218934911243) internal successors, (1910), 1372 states have internal predecessors, (1910), 387 states have call successors, (387), 65 states have call predecessors, (387), 64 states have return successors, (383), 382 states have call predecessors, (383), 383 states have call successors, (383) [2025-03-04 04:25:23,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 04:25:23,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:23,783 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:23,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:23,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:23,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1340028858, now seen corresponding path program 1 times [2025-03-04 04:25:23,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:23,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400364886] [2025-03-04 04:25:23,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:23,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:24,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 04:25:24,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 04:25:24,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:24,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-04 04:25:24,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:24,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400364886] [2025-03-04 04:25:24,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400364886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:24,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:24,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 04:25:24,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206363038] [2025-03-04 04:25:24,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:24,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 04:25:24,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:24,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 04:25:24,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 04:25:24,618 INFO L87 Difference]: Start difference. First operand has 1805 states, 1352 states have (on average 1.4127218934911243) internal successors, (1910), 1372 states have internal predecessors, (1910), 387 states have call successors, (387), 65 states have call predecessors, (387), 64 states have return successors, (383), 382 states have call predecessors, (383), 383 states have call successors, (383) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 04:25:24,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:24,934 INFO L93 Difference]: Finished difference Result 3605 states and 5424 transitions. [2025-03-04 04:25:24,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 04:25:24,937 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-03-04 04:25:24,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:24,964 INFO L225 Difference]: With dead ends: 3605 [2025-03-04 04:25:24,964 INFO L226 Difference]: Without dead ends: 1792 [2025-03-04 04:25:24,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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:25:24,981 INFO L435 NwaCegarLoop]: 2586 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2586 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:24,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2586 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:25:24,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2025-03-04 04:25:25,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1792. [2025-03-04 04:25:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1345 states have (on average 1.4059479553903347) internal successors, (1891), 1359 states have internal predecessors, (1891), 383 states have call successors, (383), 64 states have call predecessors, (383), 63 states have return successors, (372), 371 states have call predecessors, (372), 372 states have call successors, (372) [2025-03-04 04:25:25,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2646 transitions. [2025-03-04 04:25:25,231 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2646 transitions. Word has length 119 [2025-03-04 04:25:25,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:25,232 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2646 transitions. [2025-03-04 04:25:25,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 04:25:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2646 transitions. [2025-03-04 04:25:25,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 04:25:25,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:25,234 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:25,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 04:25:25,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:25,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:25,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1968355749, now seen corresponding path program 1 times [2025-03-04 04:25:25,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:25,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377773764] [2025-03-04 04:25:25,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:25,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:25,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 04:25:25,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 04:25:25,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:25,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-04 04:25:25,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:25,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377773764] [2025-03-04 04:25:25,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377773764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:25,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:25,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:25,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292411957] [2025-03-04 04:25:25,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:25,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:25,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:25,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:25,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:25,834 INFO L87 Difference]: Start difference. First operand 1792 states and 2646 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 04:25:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:26,196 INFO L93 Difference]: Finished difference Result 3656 states and 5376 transitions. [2025-03-04 04:25:26,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:26,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-03-04 04:25:26,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:26,211 INFO L225 Difference]: With dead ends: 3656 [2025-03-04 04:25:26,211 INFO L226 Difference]: Without dead ends: 1894 [2025-03-04 04:25:26,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:26,218 INFO L435 NwaCegarLoop]: 2598 mSDtfsCounter, 168 mSDsluCounter, 2488 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 5086 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:26,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 5086 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 04:25:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2025-03-04 04:25:26,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1877. [2025-03-04 04:25:26,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1408 states have (on average 1.3998579545454546) internal successors, (1971), 1424 states have internal predecessors, (1971), 394 states have call successors, (394), 75 states have call predecessors, (394), 74 states have return successors, (383), 380 states have call predecessors, (383), 383 states have call successors, (383) [2025-03-04 04:25:26,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2748 transitions. [2025-03-04 04:25:26,310 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2748 transitions. Word has length 119 [2025-03-04 04:25:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:26,310 INFO L471 AbstractCegarLoop]: Abstraction has 1877 states and 2748 transitions. [2025-03-04 04:25:26,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 04:25:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2748 transitions. [2025-03-04 04:25:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 04:25:26,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:26,312 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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] [2025-03-04 04:25:26,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:25:26,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:26,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:26,313 INFO L85 PathProgramCache]: Analyzing trace with hash -589557154, now seen corresponding path program 1 times [2025-03-04 04:25:26,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:26,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974360248] [2025-03-04 04:25:26,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:26,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:26,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 04:25:26,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 04:25:26,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:26,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-04 04:25:27,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:27,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974360248] [2025-03-04 04:25:27,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974360248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:27,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:27,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:27,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119431808] [2025-03-04 04:25:27,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:27,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:27,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:27,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:27,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:27,033 INFO L87 Difference]: Start difference. First operand 1877 states and 2748 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 04:25:31,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:25:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:31,411 INFO L93 Difference]: Finished difference Result 5431 states and 7997 transitions. [2025-03-04 04:25:31,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:31,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2025-03-04 04:25:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:31,430 INFO L225 Difference]: With dead ends: 5431 [2025-03-04 04:25:31,431 INFO L226 Difference]: Without dead ends: 3594 [2025-03-04 04:25:31,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:31,439 INFO L435 NwaCegarLoop]: 2695 mSDtfsCounter, 2562 mSDsluCounter, 2498 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2562 SdHoareTripleChecker+Valid, 5193 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:31,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2562 Valid, 5193 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 169 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 04:25:31,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2025-03-04 04:25:31,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3582. [2025-03-04 04:25:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3582 states, 2715 states have (on average 1.4084714548802946) internal successors, (3824), 2734 states have internal predecessors, (3824), 734 states have call successors, (734), 133 states have call predecessors, (734), 132 states have return successors, (723), 720 states have call predecessors, (723), 723 states have call successors, (723) [2025-03-04 04:25:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 5281 transitions. [2025-03-04 04:25:31,555 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 5281 transitions. Word has length 143 [2025-03-04 04:25:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:31,557 INFO L471 AbstractCegarLoop]: Abstraction has 3582 states and 5281 transitions. [2025-03-04 04:25:31,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 04:25:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 5281 transitions. [2025-03-04 04:25:31,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 04:25:31,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:31,560 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:25:31,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:25:31,560 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:31,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:31,563 INFO L85 PathProgramCache]: Analyzing trace with hash -748759640, now seen corresponding path program 1 times [2025-03-04 04:25:31,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:31,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579564846] [2025-03-04 04:25:31,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:31,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:31,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 04:25:31,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 04:25:31,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:31,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 04:25:32,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:32,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579564846] [2025-03-04 04:25:32,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579564846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:32,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:32,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:32,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751401587] [2025-03-04 04:25:32,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:32,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:32,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:32,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:32,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:32,037 INFO L87 Difference]: Start difference. First operand 3582 states and 5281 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 04:25:32,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:32,225 INFO L93 Difference]: Finished difference Result 3584 states and 5282 transitions. [2025-03-04 04:25:32,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:32,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 173 [2025-03-04 04:25:32,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:32,241 INFO L225 Difference]: With dead ends: 3584 [2025-03-04 04:25:32,242 INFO L226 Difference]: Without dead ends: 3581 [2025-03-04 04:25:32,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:32,245 INFO L435 NwaCegarLoop]: 2566 mSDtfsCounter, 2597 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2597 SdHoareTripleChecker+Valid, 2566 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:32,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2597 Valid, 2566 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:25:32,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2025-03-04 04:25:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3581. [2025-03-04 04:25:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 2715 states have (on average 1.4081031307550644) internal successors, (3823), 2733 states have internal predecessors, (3823), 733 states have call successors, (733), 133 states have call predecessors, (733), 132 states have return successors, (723), 720 states have call predecessors, (723), 723 states have call successors, (723) [2025-03-04 04:25:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 5279 transitions. [2025-03-04 04:25:32,368 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 5279 transitions. Word has length 173 [2025-03-04 04:25:32,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:32,368 INFO L471 AbstractCegarLoop]: Abstraction has 3581 states and 5279 transitions. [2025-03-04 04:25:32,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 04:25:32,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 5279 transitions. [2025-03-04 04:25:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 04:25:32,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:32,370 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:25:32,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:25:32,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:32,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:32,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1737623722, now seen corresponding path program 1 times [2025-03-04 04:25:32,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:32,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748194495] [2025-03-04 04:25:32,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:32,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:32,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 04:25:32,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 04:25:32,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:32,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 04:25:32,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:32,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748194495] [2025-03-04 04:25:32,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748194495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:32,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:32,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:32,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048933145] [2025-03-04 04:25:32,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:32,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:32,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:32,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:32,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:32,959 INFO L87 Difference]: Start difference. First operand 3581 states and 5279 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 04:25:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:33,138 INFO L93 Difference]: Finished difference Result 3583 states and 5280 transitions. [2025-03-04 04:25:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:33,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 174 [2025-03-04 04:25:33,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:33,157 INFO L225 Difference]: With dead ends: 3583 [2025-03-04 04:25:33,157 INFO L226 Difference]: Without dead ends: 3580 [2025-03-04 04:25:33,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:33,161 INFO L435 NwaCegarLoop]: 2564 mSDtfsCounter, 2594 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2594 SdHoareTripleChecker+Valid, 2564 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:33,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2594 Valid, 2564 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:25:33,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2025-03-04 04:25:33,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 3580. [2025-03-04 04:25:33,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3580 states, 2715 states have (on average 1.4077348066298343) internal successors, (3822), 2732 states have internal predecessors, (3822), 732 states have call successors, (732), 133 states have call predecessors, (732), 132 states have return successors, (723), 720 states have call predecessors, (723), 723 states have call successors, (723) [2025-03-04 04:25:33,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 5277 transitions. [2025-03-04 04:25:33,281 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 5277 transitions. Word has length 174 [2025-03-04 04:25:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:33,281 INFO L471 AbstractCegarLoop]: Abstraction has 3580 states and 5277 transitions. [2025-03-04 04:25:33,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 04:25:33,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 5277 transitions. [2025-03-04 04:25:33,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 04:25:33,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:33,283 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:25:33,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 04:25:33,283 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:33,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:33,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1967327081, now seen corresponding path program 1 times [2025-03-04 04:25:33,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:33,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263532131] [2025-03-04 04:25:33,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:33,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:33,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 04:25:33,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 04:25:33,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:33,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 04:25:33,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:33,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263532131] [2025-03-04 04:25:33,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263532131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:33,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:33,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:33,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015960339] [2025-03-04 04:25:33,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:33,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:33,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:33,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:33,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:33,735 INFO L87 Difference]: Start difference. First operand 3580 states and 5277 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 04:25:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:34,081 INFO L93 Difference]: Finished difference Result 3617 states and 5309 transitions. [2025-03-04 04:25:34,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:34,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 175 [2025-03-04 04:25:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:34,099 INFO L225 Difference]: With dead ends: 3617 [2025-03-04 04:25:34,099 INFO L226 Difference]: Without dead ends: 3613 [2025-03-04 04:25:34,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:34,103 INFO L435 NwaCegarLoop]: 2559 mSDtfsCounter, 233 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 4860 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:34,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 4860 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:25:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2025-03-04 04:25:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 3611. [2025-03-04 04:25:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3611 states, 2736 states have (on average 1.4038742690058479) internal successors, (3841), 2751 states have internal predecessors, (3841), 734 states have call successors, (734), 141 states have call predecessors, (734), 140 states have return successors, (727), 724 states have call predecessors, (727), 727 states have call successors, (727) [2025-03-04 04:25:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 3611 states and 5302 transitions. [2025-03-04 04:25:34,229 INFO L78 Accepts]: Start accepts. Automaton has 3611 states and 5302 transitions. Word has length 175 [2025-03-04 04:25:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:34,229 INFO L471 AbstractCegarLoop]: Abstraction has 3611 states and 5302 transitions. [2025-03-04 04:25:34,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 04:25:34,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 5302 transitions. [2025-03-04 04:25:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 04:25:34,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:34,232 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:25:34,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 04:25:34,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:34,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:34,234 INFO L85 PathProgramCache]: Analyzing trace with hash 856683959, now seen corresponding path program 1 times [2025-03-04 04:25:34,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:34,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306302918] [2025-03-04 04:25:34,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:34,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:34,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 04:25:34,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 04:25:34,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:34,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 04:25:34,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:34,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306302918] [2025-03-04 04:25:34,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306302918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:34,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:34,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:34,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150489079] [2025-03-04 04:25:34,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:34,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:34,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:34,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:34,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:34,671 INFO L87 Difference]: Start difference. First operand 3611 states and 5302 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 04:25:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:35,230 INFO L93 Difference]: Finished difference Result 10381 states and 15316 transitions. [2025-03-04 04:25:35,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:35,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 176 [2025-03-04 04:25:35,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:35,276 INFO L225 Difference]: With dead ends: 10381 [2025-03-04 04:25:35,277 INFO L226 Difference]: Without dead ends: 6810 [2025-03-04 04:25:35,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:35,298 INFO L435 NwaCegarLoop]: 3200 mSDtfsCounter, 2372 mSDsluCounter, 2453 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2372 SdHoareTripleChecker+Valid, 5653 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:35,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2372 Valid, 5653 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 04:25:35,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6810 states. [2025-03-04 04:25:35,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6810 to 6776. [2025-03-04 04:25:35,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6776 states, 5158 states have (on average 1.4055835595191934) internal successors, (7250), 5205 states have internal predecessors, (7250), 1359 states have call successors, (1359), 264 states have call predecessors, (1359), 258 states have return successors, (1388), 1314 states have call predecessors, (1388), 1346 states have call successors, (1388) [2025-03-04 04:25:35,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6776 states to 6776 states and 9997 transitions. [2025-03-04 04:25:35,724 INFO L78 Accepts]: Start accepts. Automaton has 6776 states and 9997 transitions. Word has length 176 [2025-03-04 04:25:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:35,726 INFO L471 AbstractCegarLoop]: Abstraction has 6776 states and 9997 transitions. [2025-03-04 04:25:35,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 04:25:35,727 INFO L276 IsEmpty]: Start isEmpty. Operand 6776 states and 9997 transitions. [2025-03-04 04:25:35,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-04 04:25:35,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:35,729 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:25:35,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 04:25:35,729 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:35,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:35,729 INFO L85 PathProgramCache]: Analyzing trace with hash 786484522, now seen corresponding path program 1 times [2025-03-04 04:25:35,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:35,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32367577] [2025-03-04 04:25:35,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:35,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:36,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 04:25:36,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 04:25:36,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:36,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 04:25:36,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:36,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32367577] [2025-03-04 04:25:36,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32367577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:36,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:36,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:36,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697340118] [2025-03-04 04:25:36,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:36,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:36,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:36,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:36,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:36,163 INFO L87 Difference]: Start difference. First operand 6776 states and 9997 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 04:25:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:36,447 INFO L93 Difference]: Finished difference Result 6778 states and 9998 transitions. [2025-03-04 04:25:36,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:36,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 177 [2025-03-04 04:25:36,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:36,476 INFO L225 Difference]: With dead ends: 6778 [2025-03-04 04:25:36,476 INFO L226 Difference]: Without dead ends: 6746 [2025-03-04 04:25:36,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:36,481 INFO L435 NwaCegarLoop]: 2559 mSDtfsCounter, 2585 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2585 SdHoareTripleChecker+Valid, 2559 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:36,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2585 Valid, 2559 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:25:36,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6746 states. [2025-03-04 04:25:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6746 to 6746. [2025-03-04 04:25:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6746 states, 5138 states have (on average 1.405799922148696) internal successors, (7223), 5184 states have internal predecessors, (7223), 1353 states have call successors, (1353), 260 states have call predecessors, (1353), 254 states have return successors, (1383), 1309 states have call predecessors, (1383), 1341 states have call successors, (1383) [2025-03-04 04:25:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6746 states to 6746 states and 9959 transitions. [2025-03-04 04:25:36,819 INFO L78 Accepts]: Start accepts. Automaton has 6746 states and 9959 transitions. Word has length 177 [2025-03-04 04:25:36,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:36,820 INFO L471 AbstractCegarLoop]: Abstraction has 6746 states and 9959 transitions. [2025-03-04 04:25:36,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 04:25:36,821 INFO L276 IsEmpty]: Start isEmpty. Operand 6746 states and 9959 transitions. [2025-03-04 04:25:36,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-04 04:25:36,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:36,825 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:36,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 04:25:36,825 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:36,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:36,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1522282643, now seen corresponding path program 1 times [2025-03-04 04:25:36,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:36,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848065924] [2025-03-04 04:25:36,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:36,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:37,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 04:25:37,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 04:25:37,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:37,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 04:25:37,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:37,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848065924] [2025-03-04 04:25:37,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848065924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:37,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:37,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:37,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691108574] [2025-03-04 04:25:37,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:37,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:37,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:37,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:37,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:37,267 INFO L87 Difference]: Start difference. First operand 6746 states and 9959 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:25:41,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:25:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:41,622 INFO L93 Difference]: Finished difference Result 10304 states and 15153 transitions. [2025-03-04 04:25:41,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:41,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 197 [2025-03-04 04:25:41,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:41,639 INFO L225 Difference]: With dead ends: 10304 [2025-03-04 04:25:41,640 INFO L226 Difference]: Without dead ends: 3596 [2025-03-04 04:25:41,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:41,661 INFO L435 NwaCegarLoop]: 2564 mSDtfsCounter, 8 mSDsluCounter, 2552 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5116 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:41,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5116 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 04:25:41,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3596 states. [2025-03-04 04:25:41,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3596 to 3587. [2025-03-04 04:25:41,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3587 states, 2716 states have (on average 1.3917525773195876) internal successors, (3780), 2737 states have internal predecessors, (3780), 720 states have call successors, (720), 154 states have call predecessors, (720), 150 states have return successors, (729), 699 states have call predecessors, (729), 708 states have call successors, (729) [2025-03-04 04:25:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 5229 transitions. [2025-03-04 04:25:41,828 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 5229 transitions. Word has length 197 [2025-03-04 04:25:41,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:41,828 INFO L471 AbstractCegarLoop]: Abstraction has 3587 states and 5229 transitions. [2025-03-04 04:25:41,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:25:41,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 5229 transitions. [2025-03-04 04:25:41,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-04 04:25:41,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:41,834 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:41,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 04:25:41,834 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:41,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:41,835 INFO L85 PathProgramCache]: Analyzing trace with hash 559122358, now seen corresponding path program 1 times [2025-03-04 04:25:41,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:41,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765758172] [2025-03-04 04:25:41,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:41,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:42,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-04 04:25:42,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-04 04:25:42,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:42,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:42,390 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 04:25:42,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:42,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765758172] [2025-03-04 04:25:42,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765758172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:42,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:42,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:42,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325120618] [2025-03-04 04:25:42,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:42,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:42,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:42,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:42,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:42,392 INFO L87 Difference]: Start difference. First operand 3587 states and 5229 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 04:25:46,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:25:46,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:46,924 INFO L93 Difference]: Finished difference Result 7282 states and 10602 transitions. [2025-03-04 04:25:46,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:46,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 205 [2025-03-04 04:25:46,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:46,944 INFO L225 Difference]: With dead ends: 7282 [2025-03-04 04:25:46,945 INFO L226 Difference]: Without dead ends: 3768 [2025-03-04 04:25:46,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:46,958 INFO L435 NwaCegarLoop]: 2628 mSDtfsCounter, 188 mSDsluCounter, 2479 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 5107 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:46,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 5107 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 186 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 04:25:46,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2025-03-04 04:25:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3739. [2025-03-04 04:25:47,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3739 states, 2846 states have (on average 1.3889669711876318) internal successors, (3953), 2867 states have internal predecessors, (3953), 730 states have call successors, (730), 166 states have call predecessors, (730), 162 states have return successors, (739), 709 states have call predecessors, (739), 718 states have call successors, (739) [2025-03-04 04:25:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5422 transitions. [2025-03-04 04:25:47,098 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5422 transitions. Word has length 205 [2025-03-04 04:25:47,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:47,099 INFO L471 AbstractCegarLoop]: Abstraction has 3739 states and 5422 transitions. [2025-03-04 04:25:47,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 04:25:47,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5422 transitions. [2025-03-04 04:25:47,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-04 04:25:47,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:47,102 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:47,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 04:25:47,103 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:47,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:47,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1572493504, now seen corresponding path program 1 times [2025-03-04 04:25:47,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:47,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809625169] [2025-03-04 04:25:47,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:47,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:47,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-04 04:25:47,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-04 04:25:47,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:47,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-04 04:25:47,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:47,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809625169] [2025-03-04 04:25:47,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809625169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:47,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:47,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:47,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461615489] [2025-03-04 04:25:47,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:47,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:47,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:47,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:47,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:47,600 INFO L87 Difference]: Start difference. First operand 3739 states and 5422 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 04:25:51,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:25:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:51,875 INFO L93 Difference]: Finished difference Result 3743 states and 5424 transitions. [2025-03-04 04:25:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:51,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 204 [2025-03-04 04:25:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:51,891 INFO L225 Difference]: With dead ends: 3743 [2025-03-04 04:25:51,892 INFO L226 Difference]: Without dead ends: 3740 [2025-03-04 04:25:51,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:51,895 INFO L435 NwaCegarLoop]: 2580 mSDtfsCounter, 2370 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2370 SdHoareTripleChecker+Valid, 2856 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:51,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2370 Valid, 2856 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 04:25:51,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2025-03-04 04:25:52,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3738. [2025-03-04 04:25:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3738 states, 2846 states have (on average 1.38756148981026) internal successors, (3949), 2866 states have internal predecessors, (3949), 729 states have call successors, (729), 166 states have call predecessors, (729), 162 states have return successors, (739), 709 states have call predecessors, (739), 718 states have call successors, (739) [2025-03-04 04:25:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 5417 transitions. [2025-03-04 04:25:52,028 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 5417 transitions. Word has length 204 [2025-03-04 04:25:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:52,030 INFO L471 AbstractCegarLoop]: Abstraction has 3738 states and 5417 transitions. [2025-03-04 04:25:52,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 04:25:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 5417 transitions. [2025-03-04 04:25:52,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-04 04:25:52,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:52,037 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:52,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 04:25:52,037 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:52,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:52,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1854202155, now seen corresponding path program 1 times [2025-03-04 04:25:52,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:52,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18198265] [2025-03-04 04:25:52,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:52,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:52,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-04 04:25:52,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-04 04:25:52,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:52,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 04:25:52,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:52,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18198265] [2025-03-04 04:25:52,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18198265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:52,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:52,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:25:52,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360961193] [2025-03-04 04:25:52,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:52,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:25:52,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:52,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:25:52,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:25:52,715 INFO L87 Difference]: Start difference. First operand 3738 states and 5417 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-04 04:25:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:53,145 INFO L93 Difference]: Finished difference Result 7403 states and 10755 transitions. [2025-03-04 04:25:53,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:25:53,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 279 [2025-03-04 04:25:53,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:53,162 INFO L225 Difference]: With dead ends: 7403 [2025-03-04 04:25:53,162 INFO L226 Difference]: Without dead ends: 3738 [2025-03-04 04:25:53,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:25:53,175 INFO L435 NwaCegarLoop]: 2553 mSDtfsCounter, 0 mSDsluCounter, 7653 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10206 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:53,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10206 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 04:25:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2025-03-04 04:25:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 3738. [2025-03-04 04:25:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3738 states, 2846 states have (on average 1.387210119465917) internal successors, (3948), 2866 states have internal predecessors, (3948), 729 states have call successors, (729), 166 states have call predecessors, (729), 162 states have return successors, (739), 709 states have call predecessors, (739), 718 states have call successors, (739) [2025-03-04 04:25:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 5416 transitions. [2025-03-04 04:25:53,308 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 5416 transitions. Word has length 279 [2025-03-04 04:25:53,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:53,309 INFO L471 AbstractCegarLoop]: Abstraction has 3738 states and 5416 transitions. [2025-03-04 04:25:53,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-04 04:25:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 5416 transitions. [2025-03-04 04:25:53,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-04 04:25:53,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:53,315 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:53,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 04:25:53,316 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:53,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:53,317 INFO L85 PathProgramCache]: Analyzing trace with hash -321773727, now seen corresponding path program 1 times [2025-03-04 04:25:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:53,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715008021] [2025-03-04 04:25:53,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:53,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:53,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-04 04:25:53,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-04 04:25:53,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:53,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-03-04 04:25:53,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:53,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715008021] [2025-03-04 04:25:53,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715008021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:53,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:53,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:53,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183418164] [2025-03-04 04:25:53,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:53,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:53,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:53,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:53,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:53,850 INFO L87 Difference]: Start difference. First operand 3738 states and 5416 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 3 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-04 04:25:57,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:25:58,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:58,192 INFO L93 Difference]: Finished difference Result 7405 states and 10750 transitions. [2025-03-04 04:25:58,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:58,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 3 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 297 [2025-03-04 04:25:58,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:58,206 INFO L225 Difference]: With dead ends: 7405 [2025-03-04 04:25:58,206 INFO L226 Difference]: Without dead ends: 3740 [2025-03-04 04:25:58,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:58,216 INFO L435 NwaCegarLoop]: 3755 mSDtfsCounter, 2513 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2513 SdHoareTripleChecker+Valid, 6066 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:58,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2513 Valid, 6066 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 04:25:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2025-03-04 04:25:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3738. [2025-03-04 04:25:58,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3738 states, 2846 states have (on average 1.3858046380885454) internal successors, (3944), 2866 states have internal predecessors, (3944), 729 states have call successors, (729), 166 states have call predecessors, (729), 162 states have return successors, (719), 709 states have call predecessors, (719), 709 states have call successors, (719) [2025-03-04 04:25:58,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 5392 transitions. [2025-03-04 04:25:58,336 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 5392 transitions. Word has length 297 [2025-03-04 04:25:58,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:58,336 INFO L471 AbstractCegarLoop]: Abstraction has 3738 states and 5392 transitions. [2025-03-04 04:25:58,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 3 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-04 04:25:58,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 5392 transitions. [2025-03-04 04:25:58,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-04 04:25:58,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:58,342 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:58,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 04:25:58,342 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:58,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:58,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1431500329, now seen corresponding path program 1 times [2025-03-04 04:25:58,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:58,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057282139] [2025-03-04 04:25:58,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:58,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:58,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-04 04:25:58,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-04 04:25:58,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:58,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2025-03-04 04:25:58,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:58,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057282139] [2025-03-04 04:25:58,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057282139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:58,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:58,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:25:58,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615882567] [2025-03-04 04:25:58,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:58,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:25:58,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:58,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:25:58,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:25:58,878 INFO L87 Difference]: Start difference. First operand 3738 states and 5392 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-04 04:26:02,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:26:03,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:03,351 INFO L93 Difference]: Finished difference Result 7372 states and 10654 transitions. [2025-03-04 04:26:03,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:26:03,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 279 [2025-03-04 04:26:03,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:03,369 INFO L225 Difference]: With dead ends: 7372 [2025-03-04 04:26:03,369 INFO L226 Difference]: Without dead ends: 3673 [2025-03-04 04:26:03,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:26:03,381 INFO L435 NwaCegarLoop]: 2559 mSDtfsCounter, 9 mSDsluCounter, 7656 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 10215 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:03,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 10215 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 330 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 04:26:03,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states. [2025-03-04 04:26:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 3657. [2025-03-04 04:26:03,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3657 states, 2796 states have (on average 1.390200286123033) internal successors, (3887), 2816 states have internal predecessors, (3887), 710 states have call successors, (710), 154 states have call predecessors, (710), 150 states have return successors, (700), 690 states have call predecessors, (700), 690 states have call successors, (700) [2025-03-04 04:26:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 5297 transitions. [2025-03-04 04:26:03,507 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 5297 transitions. Word has length 279 [2025-03-04 04:26:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:03,507 INFO L471 AbstractCegarLoop]: Abstraction has 3657 states and 5297 transitions. [2025-03-04 04:26:03,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-04 04:26:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 5297 transitions. [2025-03-04 04:26:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-04 04:26:03,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:03,512 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:03,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 04:26:03,512 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:03,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:03,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1771391422, now seen corresponding path program 1 times [2025-03-04 04:26:03,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:03,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434959613] [2025-03-04 04:26:03,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:03,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:03,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-04 04:26:03,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-04 04:26:03,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:03,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-04 04:26:04,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:04,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434959613] [2025-03-04 04:26:04,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434959613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:04,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:04,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:26:04,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250583127] [2025-03-04 04:26:04,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:04,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:26:04,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:04,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:26:04,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:26:04,021 INFO L87 Difference]: Start difference. First operand 3657 states and 5297 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-04 04:26:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:04,350 INFO L93 Difference]: Finished difference Result 7275 states and 10556 transitions. [2025-03-04 04:26:04,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:26:04,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 311 [2025-03-04 04:26:04,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:04,368 INFO L225 Difference]: With dead ends: 7275 [2025-03-04 04:26:04,368 INFO L226 Difference]: Without dead ends: 3695 [2025-03-04 04:26:04,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:26:04,380 INFO L435 NwaCegarLoop]: 2533 mSDtfsCounter, 8 mSDsluCounter, 2514 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5047 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:04,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5047 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:26:04,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3695 states. [2025-03-04 04:26:04,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3695 to 3695. [2025-03-04 04:26:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3695 states, 2834 states have (on average 1.3842625264643613) internal successors, (3923), 2854 states have internal predecessors, (3923), 710 states have call successors, (710), 154 states have call predecessors, (710), 150 states have return successors, (700), 690 states have call predecessors, (700), 690 states have call successors, (700) [2025-03-04 04:26:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3695 states to 3695 states and 5333 transitions. [2025-03-04 04:26:04,504 INFO L78 Accepts]: Start accepts. Automaton has 3695 states and 5333 transitions. Word has length 311 [2025-03-04 04:26:04,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:04,505 INFO L471 AbstractCegarLoop]: Abstraction has 3695 states and 5333 transitions. [2025-03-04 04:26:04,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-04 04:26:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3695 states and 5333 transitions. [2025-03-04 04:26:04,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-04 04:26:04,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:04,509 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:04,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 04:26:04,509 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:04,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:04,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1840495445, now seen corresponding path program 1 times [2025-03-04 04:26:04,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:04,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837336816] [2025-03-04 04:26:04,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:04,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:04,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-04 04:26:04,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-04 04:26:04,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:04,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2025-03-04 04:26:05,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:05,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837336816] [2025-03-04 04:26:05,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837336816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:05,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:05,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:26:05,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596700058] [2025-03-04 04:26:05,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:05,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:26:05,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:05,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:26:05,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:05,095 INFO L87 Difference]: Start difference. First operand 3695 states and 5333 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 5 states have internal predecessors, (136), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-04 04:26:05,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:05,551 INFO L93 Difference]: Finished difference Result 7318 states and 10580 transitions. [2025-03-04 04:26:05,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:26:05,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 5 states have internal predecessors, (136), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) Word has length 293 [2025-03-04 04:26:05,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:05,570 INFO L225 Difference]: With dead ends: 7318 [2025-03-04 04:26:05,570 INFO L226 Difference]: Without dead ends: 3700 [2025-03-04 04:26:05,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:05,581 INFO L435 NwaCegarLoop]: 2558 mSDtfsCounter, 0 mSDsluCounter, 10213 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12771 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:05,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12771 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 04:26:05,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3700 states. [2025-03-04 04:26:05,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3700 to 3700. [2025-03-04 04:26:05,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3700 states, 2838 states have (on average 1.3837209302325582) internal successors, (3927), 2858 states have internal predecessors, (3927), 710 states have call successors, (710), 154 states have call predecessors, (710), 151 states have return successors, (703), 691 states have call predecessors, (703), 690 states have call successors, (703) [2025-03-04 04:26:05,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3700 states and 5340 transitions. [2025-03-04 04:26:05,713 INFO L78 Accepts]: Start accepts. Automaton has 3700 states and 5340 transitions. Word has length 293 [2025-03-04 04:26:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:05,714 INFO L471 AbstractCegarLoop]: Abstraction has 3700 states and 5340 transitions. [2025-03-04 04:26:05,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 5 states have internal predecessors, (136), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-04 04:26:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3700 states and 5340 transitions. [2025-03-04 04:26:05,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-04 04:26:05,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:05,720 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:05,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 04:26:05,721 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:05,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:05,722 INFO L85 PathProgramCache]: Analyzing trace with hash 417688322, now seen corresponding path program 1 times [2025-03-04 04:26:05,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:05,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047206844] [2025-03-04 04:26:05,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:05,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:06,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-04 04:26:06,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-04 04:26:06,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:06,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-04 04:26:06,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:06,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047206844] [2025-03-04 04:26:06,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047206844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:06,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:06,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:26:06,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616114377] [2025-03-04 04:26:06,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:06,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:26:06,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:06,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:26:06,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:26:06,295 INFO L87 Difference]: Start difference. First operand 3700 states and 5340 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-04 04:26:06,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:06,645 INFO L93 Difference]: Finished difference Result 7323 states and 10589 transitions. [2025-03-04 04:26:06,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:26:06,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) Word has length 311 [2025-03-04 04:26:06,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:06,662 INFO L225 Difference]: With dead ends: 7323 [2025-03-04 04:26:06,663 INFO L226 Difference]: Without dead ends: 3700 [2025-03-04 04:26:06,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:26:06,672 INFO L435 NwaCegarLoop]: 2553 mSDtfsCounter, 0 mSDsluCounter, 7649 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10202 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:06,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10202 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:26:06,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3700 states. [2025-03-04 04:26:06,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3700 to 3700. [2025-03-04 04:26:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3700 states, 2838 states have (on average 1.383368569415081) internal successors, (3926), 2858 states have internal predecessors, (3926), 710 states have call successors, (710), 154 states have call predecessors, (710), 151 states have return successors, (703), 691 states have call predecessors, (703), 690 states have call successors, (703) [2025-03-04 04:26:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3700 states and 5339 transitions. [2025-03-04 04:26:06,844 INFO L78 Accepts]: Start accepts. Automaton has 3700 states and 5339 transitions. Word has length 311 [2025-03-04 04:26:06,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:06,846 INFO L471 AbstractCegarLoop]: Abstraction has 3700 states and 5339 transitions. [2025-03-04 04:26:06,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-04 04:26:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3700 states and 5339 transitions. [2025-03-04 04:26:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-04 04:26:06,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:06,849 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:06,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 04:26:06,850 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:06,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:06,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1311867644, now seen corresponding path program 1 times [2025-03-04 04:26:06,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:06,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525443265] [2025-03-04 04:26:06,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:06,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:07,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-04 04:26:07,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-04 04:26:07,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:07,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2025-03-04 04:26:07,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:07,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525443265] [2025-03-04 04:26:07,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525443265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:07,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:07,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:26:07,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356895007] [2025-03-04 04:26:07,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:07,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:26:07,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:07,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:26:07,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:07,355 INFO L87 Difference]: Start difference. First operand 3700 states and 5339 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 4 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) [2025-03-04 04:26:07,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:07,839 INFO L93 Difference]: Finished difference Result 8166 states and 11937 transitions. [2025-03-04 04:26:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:26:07,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 4 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) Word has length 301 [2025-03-04 04:26:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:07,858 INFO L225 Difference]: With dead ends: 8166 [2025-03-04 04:26:07,858 INFO L226 Difference]: Without dead ends: 4543 [2025-03-04 04:26:07,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:07,866 INFO L435 NwaCegarLoop]: 2553 mSDtfsCounter, 588 mSDsluCounter, 10189 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 12742 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:07,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 12742 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 04:26:07,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4543 states. [2025-03-04 04:26:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4543 to 3723. [2025-03-04 04:26:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3723 states, 2857 states have (on average 1.3853692684634231) internal successors, (3958), 2879 states have internal predecessors, (3958), 713 states have call successors, (713), 154 states have call predecessors, (713), 152 states have return successors, (710), 693 states have call predecessors, (710), 693 states have call successors, (710) [2025-03-04 04:26:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 3723 states and 5381 transitions. [2025-03-04 04:26:08,091 INFO L78 Accepts]: Start accepts. Automaton has 3723 states and 5381 transitions. Word has length 301 [2025-03-04 04:26:08,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:08,091 INFO L471 AbstractCegarLoop]: Abstraction has 3723 states and 5381 transitions. [2025-03-04 04:26:08,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 4 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) [2025-03-04 04:26:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5381 transitions. [2025-03-04 04:26:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-04 04:26:08,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:08,097 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:08,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 04:26:08,098 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:08,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:08,098 INFO L85 PathProgramCache]: Analyzing trace with hash -134033471, now seen corresponding path program 1 times [2025-03-04 04:26:08,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:08,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855698171] [2025-03-04 04:26:08,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:08,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:08,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-04 04:26:08,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-04 04:26:08,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:08,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:08,705 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-04 04:26:08,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:08,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855698171] [2025-03-04 04:26:08,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855698171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:08,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:08,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:26:08,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094901389] [2025-03-04 04:26:08,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:08,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:26:08,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:08,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:26:08,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:08,707 INFO L87 Difference]: Start difference. First operand 3723 states and 5381 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 5 states have internal predecessors, (162), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (30), 2 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-04 04:26:09,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:09,069 INFO L93 Difference]: Finished difference Result 7385 states and 10692 transitions. [2025-03-04 04:26:09,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:26:09,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 5 states have internal predecessors, (162), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (30), 2 states have call predecessors, (30), 1 states have call successors, (30) Word has length 320 [2025-03-04 04:26:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:09,084 INFO L225 Difference]: With dead ends: 7385 [2025-03-04 04:26:09,085 INFO L226 Difference]: Without dead ends: 3739 [2025-03-04 04:26:09,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:09,093 INFO L435 NwaCegarLoop]: 2559 mSDtfsCounter, 1 mSDsluCounter, 10216 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 12775 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:09,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 12775 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:26:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2025-03-04 04:26:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3731. [2025-03-04 04:26:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3731 states, 2863 states have (on average 1.3845616486203283) internal successors, (3964), 2886 states have internal predecessors, (3964), 713 states have call successors, (713), 154 states have call predecessors, (713), 154 states have return successors, (716), 694 states have call predecessors, (716), 693 states have call successors, (716) [2025-03-04 04:26:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 5393 transitions. [2025-03-04 04:26:09,203 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 5393 transitions. Word has length 320 [2025-03-04 04:26:09,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:09,204 INFO L471 AbstractCegarLoop]: Abstraction has 3731 states and 5393 transitions. [2025-03-04 04:26:09,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 5 states have internal predecessors, (162), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (30), 2 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-04 04:26:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 5393 transitions. [2025-03-04 04:26:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-04 04:26:09,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:09,209 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:09,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 04:26:09,209 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:09,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:09,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1342250926, now seen corresponding path program 1 times [2025-03-04 04:26:09,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:09,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645031829] [2025-03-04 04:26:09,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:09,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:09,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 04:26:09,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 04:26:09,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:09,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2025-03-04 04:26:09,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:09,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645031829] [2025-03-04 04:26:09,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645031829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:09,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:09,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:26:09,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017875590] [2025-03-04 04:26:09,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:09,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:26:09,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:09,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:26:09,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:09,782 INFO L87 Difference]: Start difference. First operand 3731 states and 5393 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 3 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-04 04:26:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:10,101 INFO L93 Difference]: Finished difference Result 7122 states and 10280 transitions. [2025-03-04 04:26:10,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:26:10,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 3 states have call predecessors, (30), 1 states have call successors, (30) Word has length 302 [2025-03-04 04:26:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:10,118 INFO L225 Difference]: With dead ends: 7122 [2025-03-04 04:26:10,118 INFO L226 Difference]: Without dead ends: 3468 [2025-03-04 04:26:10,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:10,127 INFO L435 NwaCegarLoop]: 2551 mSDtfsCounter, 0 mSDsluCounter, 10198 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12749 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:10,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12749 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:26:10,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2025-03-04 04:26:10,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3468. [2025-03-04 04:26:10,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3468 states, 2659 states have (on average 1.3772094772470853) internal successors, (3662), 2681 states have internal predecessors, (3662), 658 states have call successors, (658), 151 states have call predecessors, (658), 150 states have return successors, (657), 639 states have call predecessors, (657), 638 states have call successors, (657) [2025-03-04 04:26:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3468 states to 3468 states and 4977 transitions. [2025-03-04 04:26:10,234 INFO L78 Accepts]: Start accepts. Automaton has 3468 states and 4977 transitions. Word has length 302 [2025-03-04 04:26:10,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:10,234 INFO L471 AbstractCegarLoop]: Abstraction has 3468 states and 4977 transitions. [2025-03-04 04:26:10,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 3 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-04 04:26:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 4977 transitions. [2025-03-04 04:26:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-03-04 04:26:10,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:10,239 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:10,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 04:26:10,239 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:10,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:10,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1466802089, now seen corresponding path program 1 times [2025-03-04 04:26:10,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:10,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789589153] [2025-03-04 04:26:10,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:10,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:10,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-03-04 04:26:10,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-03-04 04:26:10,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:10,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-04 04:26:10,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:10,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789589153] [2025-03-04 04:26:10,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789589153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:10,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:10,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:26:10,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533010332] [2025-03-04 04:26:10,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:10,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:26:10,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:10,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:26:10,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:10,852 INFO L87 Difference]: Start difference. First operand 3468 states and 4977 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 04:26:11,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:11,217 INFO L93 Difference]: Finished difference Result 6861 states and 9861 transitions. [2025-03-04 04:26:11,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:26:11,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) Word has length 314 [2025-03-04 04:26:11,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:11,232 INFO L225 Difference]: With dead ends: 6861 [2025-03-04 04:26:11,232 INFO L226 Difference]: Without dead ends: 3470 [2025-03-04 04:26:11,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:11,240 INFO L435 NwaCegarLoop]: 2558 mSDtfsCounter, 0 mSDsluCounter, 10215 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12773 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:11,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12773 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 04:26:11,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2025-03-04 04:26:11,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3470. [2025-03-04 04:26:11,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3470 states, 2661 states have (on average 1.3769259676813228) internal successors, (3664), 2682 states have internal predecessors, (3664), 658 states have call successors, (658), 151 states have call predecessors, (658), 150 states have return successors, (657), 640 states have call predecessors, (657), 638 states have call successors, (657) [2025-03-04 04:26:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 4979 transitions. [2025-03-04 04:26:11,345 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 4979 transitions. Word has length 314 [2025-03-04 04:26:11,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:11,346 INFO L471 AbstractCegarLoop]: Abstraction has 3470 states and 4979 transitions. [2025-03-04 04:26:11,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 04:26:11,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 4979 transitions. [2025-03-04 04:26:11,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-04 04:26:11,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:11,351 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:11,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 04:26:11,352 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:11,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:11,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1653750177, now seen corresponding path program 1 times [2025-03-04 04:26:11,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:11,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496246704] [2025-03-04 04:26:11,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:11,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:11,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-04 04:26:11,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-04 04:26:11,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:11,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-04 04:26:11,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:11,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496246704] [2025-03-04 04:26:11,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496246704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:11,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:11,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:26:11,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489842756] [2025-03-04 04:26:11,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:11,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:26:11,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:11,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:26:11,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:11,884 INFO L87 Difference]: Start difference. First operand 3470 states and 4979 transitions. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 5 states have internal predecessors, (152), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 04:26:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:12,248 INFO L93 Difference]: Finished difference Result 4083 states and 5804 transitions. [2025-03-04 04:26:12,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:26:12,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 5 states have internal predecessors, (152), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) Word has length 315 [2025-03-04 04:26:12,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:12,264 INFO L225 Difference]: With dead ends: 4083 [2025-03-04 04:26:12,265 INFO L226 Difference]: Without dead ends: 3472 [2025-03-04 04:26:12,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:12,271 INFO L435 NwaCegarLoop]: 2558 mSDtfsCounter, 0 mSDsluCounter, 10215 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12773 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:12,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12773 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 04:26:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2025-03-04 04:26:12,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3472. [2025-03-04 04:26:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3472 states, 2663 states have (on average 1.3766428839654525) internal successors, (3666), 2683 states have internal predecessors, (3666), 658 states have call successors, (658), 151 states have call predecessors, (658), 150 states have return successors, (657), 641 states have call predecessors, (657), 638 states have call successors, (657) [2025-03-04 04:26:12,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 4981 transitions. [2025-03-04 04:26:12,372 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 4981 transitions. Word has length 315 [2025-03-04 04:26:12,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:12,372 INFO L471 AbstractCegarLoop]: Abstraction has 3472 states and 4981 transitions. [2025-03-04 04:26:12,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 5 states have internal predecessors, (152), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 04:26:12,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 4981 transitions. [2025-03-04 04:26:12,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-04 04:26:12,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:12,377 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:12,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 04:26:12,377 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:12,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:12,377 INFO L85 PathProgramCache]: Analyzing trace with hash -662856176, now seen corresponding path program 1 times [2025-03-04 04:26:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:12,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310633142] [2025-03-04 04:26:12,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:12,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:12,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-04 04:26:12,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-04 04:26:12,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:12,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-04 04:26:12,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:12,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310633142] [2025-03-04 04:26:12,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310633142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:12,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:12,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:26:12,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192225963] [2025-03-04 04:26:12,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:12,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:26:12,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:12,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:26:12,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:12,915 INFO L87 Difference]: Start difference. First operand 3472 states and 4981 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 4 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2025-03-04 04:26:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:13,347 INFO L93 Difference]: Finished difference Result 6908 states and 9932 transitions. [2025-03-04 04:26:13,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:26:13,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 4 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 323 [2025-03-04 04:26:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:13,364 INFO L225 Difference]: With dead ends: 6908 [2025-03-04 04:26:13,364 INFO L226 Difference]: Without dead ends: 3513 [2025-03-04 04:26:13,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:13,373 INFO L435 NwaCegarLoop]: 2553 mSDtfsCounter, 20 mSDsluCounter, 10186 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 12739 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:13,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 12739 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 04:26:13,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2025-03-04 04:26:13,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3481. [2025-03-04 04:26:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3481 states, 2669 states have (on average 1.3769201948295242) internal successors, (3675), 2690 states have internal predecessors, (3675), 661 states have call successors, (661), 151 states have call predecessors, (661), 150 states have return successors, (661), 643 states have call predecessors, (661), 641 states have call successors, (661) [2025-03-04 04:26:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 3481 states and 4997 transitions. [2025-03-04 04:26:13,541 INFO L78 Accepts]: Start accepts. Automaton has 3481 states and 4997 transitions. Word has length 323 [2025-03-04 04:26:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:13,542 INFO L471 AbstractCegarLoop]: Abstraction has 3481 states and 4997 transitions. [2025-03-04 04:26:13,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 4 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2025-03-04 04:26:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 4997 transitions. [2025-03-04 04:26:13,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-04 04:26:13,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:13,548 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:13,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 04:26:13,548 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:13,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash 366174659, now seen corresponding path program 1 times [2025-03-04 04:26:13,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:13,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908892823] [2025-03-04 04:26:13,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:13,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:13,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-04 04:26:13,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-04 04:26:13,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:13,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-04 04:26:14,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:14,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908892823] [2025-03-04 04:26:14,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908892823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:14,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:14,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:26:14,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059404347] [2025-03-04 04:26:14,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:14,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:26:14,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:14,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:26:14,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:14,048 INFO L87 Difference]: Start difference. First operand 3481 states and 4997 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-04 04:26:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:14,352 INFO L93 Difference]: Finished difference Result 6607 states and 9486 transitions. [2025-03-04 04:26:14,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:26:14,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 324 [2025-03-04 04:26:14,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:14,368 INFO L225 Difference]: With dead ends: 6607 [2025-03-04 04:26:14,368 INFO L226 Difference]: Without dead ends: 3203 [2025-03-04 04:26:14,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:14,376 INFO L435 NwaCegarLoop]: 2558 mSDtfsCounter, 0 mSDsluCounter, 10215 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12773 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:14,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12773 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:26:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3203 states. [2025-03-04 04:26:14,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3203 to 3201. [2025-03-04 04:26:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 2457 states have (on average 1.3764753764753765) internal successors, (3382), 2477 states have internal predecessors, (3382), 599 states have call successors, (599), 145 states have call predecessors, (599), 144 states have return successors, (600), 582 states have call predecessors, (600), 580 states have call successors, (600) [2025-03-04 04:26:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 4581 transitions. [2025-03-04 04:26:14,472 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 4581 transitions. Word has length 324 [2025-03-04 04:26:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:14,473 INFO L471 AbstractCegarLoop]: Abstraction has 3201 states and 4581 transitions. [2025-03-04 04:26:14,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-04 04:26:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 4581 transitions. [2025-03-04 04:26:14,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-04 04:26:14,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:14,477 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:14,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 04:26:14,478 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:14,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:14,479 INFO L85 PathProgramCache]: Analyzing trace with hash -973096102, now seen corresponding path program 1 times [2025-03-04 04:26:14,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:14,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694233995] [2025-03-04 04:26:14,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:14,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:14,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-04 04:26:14,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-04 04:26:14,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:14,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-04 04:26:15,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:15,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694233995] [2025-03-04 04:26:15,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694233995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:15,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:15,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:26:15,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740240837] [2025-03-04 04:26:15,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:15,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:26:15,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:15,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:26:15,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:15,051 INFO L87 Difference]: Start difference. First operand 3201 states and 4581 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 4 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2025-03-04 04:26:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:15,334 INFO L93 Difference]: Finished difference Result 6367 states and 9134 transitions. [2025-03-04 04:26:15,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:26:15,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 4 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 322 [2025-03-04 04:26:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:15,348 INFO L225 Difference]: With dead ends: 6367 [2025-03-04 04:26:15,348 INFO L226 Difference]: Without dead ends: 3243 [2025-03-04 04:26:15,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:15,354 INFO L435 NwaCegarLoop]: 2553 mSDtfsCounter, 19 mSDsluCounter, 10186 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 12739 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:15,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 12739 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:26:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3243 states. [2025-03-04 04:26:15,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3243 to 3210. [2025-03-04 04:26:15,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3210 states, 2463 states have (on average 1.3767762890783597) internal successors, (3391), 2484 states have internal predecessors, (3391), 602 states have call successors, (602), 145 states have call predecessors, (602), 144 states have return successors, (604), 584 states have call predecessors, (604), 583 states have call successors, (604) [2025-03-04 04:26:15,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 3210 states and 4597 transitions. [2025-03-04 04:26:15,437 INFO L78 Accepts]: Start accepts. Automaton has 3210 states and 4597 transitions. Word has length 322 [2025-03-04 04:26:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:15,437 INFO L471 AbstractCegarLoop]: Abstraction has 3210 states and 4597 transitions. [2025-03-04 04:26:15,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 4 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2025-03-04 04:26:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3210 states and 4597 transitions. [2025-03-04 04:26:15,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-04 04:26:15,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:15,441 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:15,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 04:26:15,441 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:15,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:15,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1050931026, now seen corresponding path program 1 times [2025-03-04 04:26:15,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:15,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887981558] [2025-03-04 04:26:15,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:15,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:15,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-04 04:26:15,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-04 04:26:15,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:15,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-04 04:26:16,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:16,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887981558] [2025-03-04 04:26:16,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887981558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:16,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:16,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:26:16,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914252409] [2025-03-04 04:26:16,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:16,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:26:16,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:16,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:26:16,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:16,003 INFO L87 Difference]: Start difference. First operand 3210 states and 4597 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-04 04:26:16,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:16,286 INFO L93 Difference]: Finished difference Result 6057 states and 8659 transitions. [2025-03-04 04:26:16,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:26:16,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 323 [2025-03-04 04:26:16,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:16,297 INFO L225 Difference]: With dead ends: 6057 [2025-03-04 04:26:16,298 INFO L226 Difference]: Without dead ends: 2924 [2025-03-04 04:26:16,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:16,303 INFO L435 NwaCegarLoop]: 2514 mSDtfsCounter, 0 mSDsluCounter, 10039 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12553 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:16,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12553 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:26:16,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2025-03-04 04:26:16,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2922. [2025-03-04 04:26:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2234 states have (on average 1.3661593554162936) internal successors, (3052), 2252 states have internal predecessors, (3052), 549 states have call successors, (549), 138 states have call predecessors, (549), 138 states have return successors, (553), 535 states have call predecessors, (553), 533 states have call successors, (553) [2025-03-04 04:26:16,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 4154 transitions. [2025-03-04 04:26:16,382 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 4154 transitions. Word has length 323 [2025-03-04 04:26:16,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:16,383 INFO L471 AbstractCegarLoop]: Abstraction has 2922 states and 4154 transitions. [2025-03-04 04:26:16,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-04 04:26:16,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 4154 transitions. [2025-03-04 04:26:16,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-04 04:26:16,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:16,387 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:16,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 04:26:16,387 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:16,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:16,388 INFO L85 PathProgramCache]: Analyzing trace with hash -937617966, now seen corresponding path program 1 times [2025-03-04 04:26:16,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:16,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681260101] [2025-03-04 04:26:16,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:16,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:16,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-04 04:26:16,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-04 04:26:16,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:16,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-03-04 04:26:16,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:16,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681260101] [2025-03-04 04:26:16,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681260101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:16,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:16,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:26:16,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430732791] [2025-03-04 04:26:16,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:16,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:26:16,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:16,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:26:16,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:16,853 INFO L87 Difference]: Start difference. First operand 2922 states and 4154 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 5 states have internal predecessors, (160), 3 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (36), 4 states have call predecessors, (36), 3 states have call successors, (36) [2025-03-04 04:26:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:17,128 INFO L93 Difference]: Finished difference Result 3725 states and 5251 transitions. [2025-03-04 04:26:17,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:26:17,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 5 states have internal predecessors, (160), 3 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (36), 4 states have call predecessors, (36), 3 states have call successors, (36) Word has length 335 [2025-03-04 04:26:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:17,141 INFO L225 Difference]: With dead ends: 3725 [2025-03-04 04:26:17,141 INFO L226 Difference]: Without dead ends: 2922 [2025-03-04 04:26:17,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:17,143 INFO L435 NwaCegarLoop]: 2507 mSDtfsCounter, 7 mSDsluCounter, 9998 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 12505 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:17,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 12505 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:26:17,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2025-03-04 04:26:17,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2922. [2025-03-04 04:26:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2234 states have (on average 1.365711727842435) internal successors, (3051), 2252 states have internal predecessors, (3051), 549 states have call successors, (549), 138 states have call predecessors, (549), 138 states have return successors, (553), 535 states have call predecessors, (553), 533 states have call successors, (553) [2025-03-04 04:26:17,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 4153 transitions. [2025-03-04 04:26:17,220 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 4153 transitions. Word has length 335 [2025-03-04 04:26:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:17,221 INFO L471 AbstractCegarLoop]: Abstraction has 2922 states and 4153 transitions. [2025-03-04 04:26:17,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 5 states have internal predecessors, (160), 3 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (36), 4 states have call predecessors, (36), 3 states have call successors, (36) [2025-03-04 04:26:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 4153 transitions. [2025-03-04 04:26:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-04 04:26:17,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:17,225 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:17,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 04:26:17,225 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:17,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:17,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1473699630, now seen corresponding path program 1 times [2025-03-04 04:26:17,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:17,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220941910] [2025-03-04 04:26:17,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:17,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:17,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-04 04:26:17,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-04 04:26:17,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:17,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-04 04:26:17,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:17,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220941910] [2025-03-04 04:26:17,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220941910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:17,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:17,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:26:17,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744499974] [2025-03-04 04:26:17,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:17,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:26:17,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:17,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:26:17,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:17,725 INFO L87 Difference]: Start difference. First operand 2922 states and 4153 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) [2025-03-04 04:26:17,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:17,979 INFO L93 Difference]: Finished difference Result 3725 states and 5248 transitions. [2025-03-04 04:26:17,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:26:17,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) Word has length 342 [2025-03-04 04:26:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:17,992 INFO L225 Difference]: With dead ends: 3725 [2025-03-04 04:26:17,993 INFO L226 Difference]: Without dead ends: 2922 [2025-03-04 04:26:17,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:17,995 INFO L435 NwaCegarLoop]: 2507 mSDtfsCounter, 7 mSDsluCounter, 10000 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 12507 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:17,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 12507 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:26:17,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2025-03-04 04:26:18,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2922. [2025-03-04 04:26:18,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2234 states have (on average 1.3652641002685766) internal successors, (3050), 2252 states have internal predecessors, (3050), 549 states have call successors, (549), 138 states have call predecessors, (549), 138 states have return successors, (553), 535 states have call predecessors, (553), 533 states have call successors, (553) [2025-03-04 04:26:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 4152 transitions. [2025-03-04 04:26:18,073 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 4152 transitions. Word has length 342 [2025-03-04 04:26:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:18,074 INFO L471 AbstractCegarLoop]: Abstraction has 2922 states and 4152 transitions. [2025-03-04 04:26:18,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) [2025-03-04 04:26:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 4152 transitions. [2025-03-04 04:26:18,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-04 04:26:18,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:18,078 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:18,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 04:26:18,078 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:18,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:18,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1666743897, now seen corresponding path program 1 times [2025-03-04 04:26:18,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:18,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228243313] [2025-03-04 04:26:18,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:18,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:18,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-04 04:26:18,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-04 04:26:18,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:18,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-04 04:26:18,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:18,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228243313] [2025-03-04 04:26:18,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228243313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:18,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:18,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:26:18,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021847931] [2025-03-04 04:26:18,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:18,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:26:18,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:18,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:26:18,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:18,568 INFO L87 Difference]: Start difference. First operand 2922 states and 4152 transitions. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 5 states have internal predecessors, (173), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) [2025-03-04 04:26:18,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:18,911 INFO L93 Difference]: Finished difference Result 3725 states and 5247 transitions. [2025-03-04 04:26:18,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:26:18,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 5 states have internal predecessors, (173), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) Word has length 343 [2025-03-04 04:26:18,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:18,925 INFO L225 Difference]: With dead ends: 3725 [2025-03-04 04:26:18,925 INFO L226 Difference]: Without dead ends: 2922 [2025-03-04 04:26:18,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:18,928 INFO L435 NwaCegarLoop]: 2507 mSDtfsCounter, 7 mSDsluCounter, 10000 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 12507 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:18,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 12507 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:26:18,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2025-03-04 04:26:19,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2922. [2025-03-04 04:26:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2234 states have (on average 1.364816472694718) internal successors, (3049), 2252 states have internal predecessors, (3049), 549 states have call successors, (549), 138 states have call predecessors, (549), 138 states have return successors, (553), 535 states have call predecessors, (553), 533 states have call successors, (553) [2025-03-04 04:26:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 4151 transitions. [2025-03-04 04:26:19,075 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 4151 transitions. Word has length 343 [2025-03-04 04:26:19,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:19,076 INFO L471 AbstractCegarLoop]: Abstraction has 2922 states and 4151 transitions. [2025-03-04 04:26:19,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 5 states have internal predecessors, (173), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) [2025-03-04 04:26:19,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 4151 transitions. [2025-03-04 04:26:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-04 04:26:19,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:19,082 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:19,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 04:26:19,083 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:19,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:19,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1413739879, now seen corresponding path program 1 times [2025-03-04 04:26:19,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:19,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98214550] [2025-03-04 04:26:19,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:19,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:19,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-04 04:26:19,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-04 04:26:19,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:19,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-04 04:26:19,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:19,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98214550] [2025-03-04 04:26:19,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98214550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:19,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:19,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:26:19,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847938743] [2025-03-04 04:26:19,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:19,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:26:19,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:19,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:26:19,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:19,658 INFO L87 Difference]: Start difference. First operand 2922 states and 4151 transitions. Second operand has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 5 states have internal predecessors, (178), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (37), 3 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-04 04:26:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:19,896 INFO L93 Difference]: Finished difference Result 2998 states and 4226 transitions. [2025-03-04 04:26:19,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:26:19,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 5 states have internal predecessors, (178), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (37), 3 states have call predecessors, (37), 2 states have call successors, (37) Word has length 352 [2025-03-04 04:26:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:19,907 INFO L225 Difference]: With dead ends: 2998 [2025-03-04 04:26:19,907 INFO L226 Difference]: Without dead ends: 2186 [2025-03-04 04:26:19,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:19,909 INFO L435 NwaCegarLoop]: 2450 mSDtfsCounter, 0 mSDsluCounter, 9787 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12237 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:19,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12237 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:26:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2025-03-04 04:26:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 2186. [2025-03-04 04:26:19,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2186 states, 1672 states have (on average 1.3714114832535884) internal successors, (2293), 1686 states have internal predecessors, (2293), 409 states have call successors, (409), 103 states have call predecessors, (409), 104 states have return successors, (415), 400 states have call predecessors, (415), 400 states have call successors, (415) [2025-03-04 04:26:19,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 3117 transitions. [2025-03-04 04:26:19,967 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 3117 transitions. Word has length 352 [2025-03-04 04:26:19,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:19,967 INFO L471 AbstractCegarLoop]: Abstraction has 2186 states and 3117 transitions. [2025-03-04 04:26:19,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 5 states have internal predecessors, (178), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (37), 3 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-04 04:26:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 3117 transitions. [2025-03-04 04:26:19,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-04 04:26:19,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:19,972 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:19,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 04:26:19,972 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:19,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:19,972 INFO L85 PathProgramCache]: Analyzing trace with hash -830694602, now seen corresponding path program 1 times [2025-03-04 04:26:19,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:19,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166086168] [2025-03-04 04:26:19,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:19,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:20,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-04 04:26:20,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-04 04:26:20,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:20,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:20,507 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-04 04:26:20,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:20,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166086168] [2025-03-04 04:26:20,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166086168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:20,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:20,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:26:20,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271270916] [2025-03-04 04:26:20,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:20,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:26:20,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:20,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:26:20,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:26:20,509 INFO L87 Difference]: Start difference. First operand 2186 states and 3117 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 3 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2025-03-04 04:26:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:20,809 INFO L93 Difference]: Finished difference Result 4323 states and 6195 transitions. [2025-03-04 04:26:20,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:26:20,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 3 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) Word has length 408 [2025-03-04 04:26:20,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:20,820 INFO L225 Difference]: With dead ends: 4323 [2025-03-04 04:26:20,820 INFO L226 Difference]: Without dead ends: 2214 [2025-03-04 04:26:20,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:26:20,825 INFO L435 NwaCegarLoop]: 2439 mSDtfsCounter, 6 mSDsluCounter, 2420 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4859 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:20,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4859 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:26:20,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2025-03-04 04:26:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2210. [2025-03-04 04:26:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2210 states, 1694 states have (on average 1.3683589138134593) internal successors, (2318), 1709 states have internal predecessors, (2318), 411 states have call successors, (411), 103 states have call predecessors, (411), 104 states have return successors, (421), 401 states have call predecessors, (421), 402 states have call successors, (421) [2025-03-04 04:26:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 2210 states and 3150 transitions. [2025-03-04 04:26:20,887 INFO L78 Accepts]: Start accepts. Automaton has 2210 states and 3150 transitions. Word has length 408 [2025-03-04 04:26:20,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:20,887 INFO L471 AbstractCegarLoop]: Abstraction has 2210 states and 3150 transitions. [2025-03-04 04:26:20,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 3 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2025-03-04 04:26:20,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 3150 transitions. [2025-03-04 04:26:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-04 04:26:20,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:20,893 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:20,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 04:26:20,893 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:20,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:20,894 INFO L85 PathProgramCache]: Analyzing trace with hash 628992762, now seen corresponding path program 1 times [2025-03-04 04:26:20,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:20,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263914964] [2025-03-04 04:26:20,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:20,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:21,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-04 04:26:21,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-04 04:26:21,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:21,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-04 04:26:21,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:21,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263914964] [2025-03-04 04:26:21,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263914964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:21,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:21,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:26:21,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584018] [2025-03-04 04:26:21,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:21,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:26:21,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:21,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:26:21,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:26:21,532 INFO L87 Difference]: Start difference. First operand 2210 states and 3150 transitions. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 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:26:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:23,236 INFO L93 Difference]: Finished difference Result 4503 states and 6464 transitions. [2025-03-04 04:26:23,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:26:23,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 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 374 [2025-03-04 04:26:23,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:23,247 INFO L225 Difference]: With dead ends: 4503 [2025-03-04 04:26:23,248 INFO L226 Difference]: Without dead ends: 2370 [2025-03-04 04:26:23,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:26:23,252 INFO L435 NwaCegarLoop]: 2582 mSDtfsCounter, 129 mSDsluCounter, 7479 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 10061 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:23,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 10061 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 04:26:23,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2025-03-04 04:26:23,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 2214. [2025-03-04 04:26:23,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2214 states, 1698 states have (on average 1.3686690223792697) internal successors, (2324), 1713 states have internal predecessors, (2324), 411 states have call successors, (411), 103 states have call predecessors, (411), 104 states have return successors, (421), 401 states have call predecessors, (421), 402 states have call successors, (421) [2025-03-04 04:26:23,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 3156 transitions. [2025-03-04 04:26:23,313 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 3156 transitions. Word has length 374 [2025-03-04 04:26:23,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:23,314 INFO L471 AbstractCegarLoop]: Abstraction has 2214 states and 3156 transitions. [2025-03-04 04:26:23,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 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:26:23,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 3156 transitions. [2025-03-04 04:26:23,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-04 04:26:23,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:23,318 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:23,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 04:26:23,319 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:23,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:23,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1321167913, now seen corresponding path program 1 times [2025-03-04 04:26:23,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:23,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637661398] [2025-03-04 04:26:23,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:23,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:23,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-04 04:26:23,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-04 04:26:23,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:23,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-03-04 04:26:23,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:23,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637661398] [2025-03-04 04:26:23,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637661398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:23,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:23,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:26:23,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433804437] [2025-03-04 04:26:23,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:23,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:26:23,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:23,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:26:23,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:26:23,805 INFO L87 Difference]: Start difference. First operand 2214 states and 3156 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 3 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37)