./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--phantom.ko-main.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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--phantom.ko-main.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 3d54ec533bcab354bf7ab20b9139a2cc0ce3cf7423a4c806e696ce4b9d5812e9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 03:53:03,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 03:53:03,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 03:53:03,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 03:53:03,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 03:53:03,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 03:53:03,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 03:53:03,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 03:53:03,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 03:53:03,995 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 03:53:03,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 03:53:03,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 03:53:03,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 03:53:03,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 03:53:03,997 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 03:53:03,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 03:53:03,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 03:53:03,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 03:53:03,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 03:53:03,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 03:53:03,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 03:53:03,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 03:53:03,997 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 03:53:03,998 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 03:53:03,998 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 03:53:03,998 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 03:53:03,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 03:53:03,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 03:53:03,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 03:53:03,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:53:03,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 03:53:03,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 03:53:03,999 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 03:53:03,999 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 03:53:03,999 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 03:53:03,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 03:53:03,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 03:53:03,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 03:53:04,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 03:53:04,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 03:53:04,000 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 -> 3d54ec533bcab354bf7ab20b9139a2cc0ce3cf7423a4c806e696ce4b9d5812e9 [2025-03-04 03:53:04,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 03:53:04,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 03:53:04,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 03:53:04,214 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 03:53:04,214 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 03:53:04,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--phantom.ko-main.cil.out.i [2025-03-04 03:53:05,337 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ccab2044/2084a2b849b04b408ca7240d88952c68/FLAG1d0801bc1 [2025-03-04 03:53:05,753 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 03:53:05,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--phantom.ko-main.cil.out.i [2025-03-04 03:53:05,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ccab2044/2084a2b849b04b408ca7240d88952c68/FLAG1d0801bc1 [2025-03-04 03:53:05,803 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ccab2044/2084a2b849b04b408ca7240d88952c68 [2025-03-04 03:53:05,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 03:53:05,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 03:53:05,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 03:53:05,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 03:53:05,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 03:53:05,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:53:05" (1/1) ... [2025-03-04 03:53:05,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fb03c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:05, skipping insertion in model container [2025-03-04 03:53:05,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:53:05" (1/1) ... [2025-03-04 03:53:05,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 03:53:06,449 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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--phantom.ko-main.cil.out.i[129019,129032] [2025-03-04 03:53:06,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:53:06,522 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:53:06,576 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; incl %0": "+m" (v->counter)); [3103] [2025-03-04 03:53:06,678 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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--phantom.ko-main.cil.out.i[129019,129032] [2025-03-04 03:53:06,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:53:06,745 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:53:06,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:06 WrapperNode [2025-03-04 03:53:06,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:53:06,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:53:06,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:53:06,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:53:06,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:06" (1/1) ... [2025-03-04 03:53:06,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:06" (1/1) ... [2025-03-04 03:53:06,855 INFO L138 Inliner]: procedures = 175, calls = 882, calls flagged for inlining = 78, calls inlined = 65, statements flattened = 1619 [2025-03-04 03:53:06,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:53:06,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:53:06,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:53:06,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:53:06,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:06" (1/1) ... [2025-03-04 03:53:06,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:06" (1/1) ... [2025-03-04 03:53:06,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:06" (1/1) ... [2025-03-04 03:53:06,970 INFO L175 MemorySlicer]: Split 410 memory accesses to 22 slices as follows [2, 18, 56, 12, 28, 8, 3, 42, 2, 4, 1, 108, 8, 2, 2, 1, 8, 49, 8, 2, 38, 8]. 26 percent of accesses are in the largest equivalence class. The 130 initializations are split as follows [2, 0, 56, 8, 0, 8, 0, 0, 1, 0, 0, 0, 8, 0, 0, 0, 8, 0, 8, 0, 23, 8]. The 190 writes are split as follows [0, 18, 0, 3, 28, 0, 1, 42, 0, 0, 0, 41, 0, 0, 0, 0, 0, 42, 0, 0, 15, 0]. [2025-03-04 03:53:06,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:06" (1/1) ... [2025-03-04 03:53:06,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:06" (1/1) ... [2025-03-04 03:53:07,056 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:06" (1/1) ... [2025-03-04 03:53:07,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:06" (1/1) ... [2025-03-04 03:53:07,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:06" (1/1) ... [2025-03-04 03:53:07,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:06" (1/1) ... [2025-03-04 03:53:07,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:53:07,108 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:53:07,108 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:53:07,108 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:53:07,110 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:06" (1/1) ... [2025-03-04 03:53:07,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:53:07,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:53:07,133 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 03:53:07,139 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 03:53:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2025-03-04 03:53:07,152 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2025-03-04 03:53:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 03:53:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 03:53:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 03:53:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 03:53:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 03:53:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 03:53:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 03:53:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-04 03:53:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#21 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-04 03:53:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-04 03:53:07,155 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2025-03-04 03:53:07,155 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2025-03-04 03:53:07,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 03:53:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 03:53:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 03:53:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 03:53:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 03:53:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 03:53:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 03:53:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 03:53:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 03:53:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 03:53:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 03:53:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 03:53:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 03:53:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 03:53:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 03:53:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 03:53:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 03:53:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 03:53:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 03:53:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 03:53:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-04 03:53:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-04 03:53:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-04 03:53:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-04 03:53:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-04 03:53:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-04 03:53:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-04 03:53:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-04 03:53:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-04 03:53:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-04 03:53:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-04 03:53:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-03-04 03:53:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-03-04 03:53:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-03-04 03:53:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-03-04 03:53:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-03-04 03:53:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-03-04 03:53:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-03-04 03:53:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#16 [2025-03-04 03:53:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#17 [2025-03-04 03:53:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#18 [2025-03-04 03:53:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#19 [2025-03-04 03:53:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#20 [2025-03-04 03:53:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#21 [2025-03-04 03:53:07,158 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-04 03:53:07,158 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-04 03:53:07,158 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-04 03:53:07,158 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-04 03:53:07,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-04 03:53:07,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-04 03:53:07,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-04 03:53:07,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-04 03:53:07,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-04 03:53:07,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-03-04 03:53:07,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-03-04 03:53:07,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-03-04 03:53:07,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-03-04 03:53:07,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-03-04 03:53:07,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-03-04 03:53:07,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-03-04 03:53:07,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#16 [2025-03-04 03:53:07,159 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#17 [2025-03-04 03:53:07,161 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#18 [2025-03-04 03:53:07,161 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#19 [2025-03-04 03:53:07,161 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#20 [2025-03-04 03:53:07,161 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#21 [2025-03-04 03:53:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 03:53:07,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 03:53:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 03:53:07,161 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 03:53:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2025-03-04 03:53:07,161 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2025-03-04 03:53:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure pci_iomap [2025-03-04 03:53:07,162 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_iomap [2025-03-04 03:53:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure class_destroy [2025-03-04 03:53:07,162 INFO L138 BoogieDeclarations]: Found implementation of procedure class_destroy [2025-03-04 03:53:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 03:53:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 03:53:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 03:53:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 03:53:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 03:53:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 03:53:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 03:53:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 03:53:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 03:53:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 03:53:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-04 03:53:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure class_remove_file [2025-03-04 03:53:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure class_remove_file [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2025-03-04 03:53:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-03-04 03:53:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 03:53:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_pr_debug [2025-03-04 03:53:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_pr_debug [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_open_lock_of_phantom_device [2025-03-04 03:53:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_open_lock_of_phantom_device [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 03:53:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2025-03-04 03:53:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32 [2025-03-04 03:53:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32 [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-04 03:53:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-04 03:53:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2025-03-04 03:53:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure phantom_status [2025-03-04 03:53:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure phantom_status [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:53:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 03:53:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure phantom_remove [2025-03-04 03:53:07,165 INFO L138 BoogieDeclarations]: Found implementation of procedure phantom_remove [2025-03-04 03:53:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure phantom_poll [2025-03-04 03:53:07,167 INFO L138 BoogieDeclarations]: Found implementation of procedure phantom_poll [2025-03-04 03:53:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 03:53:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 03:53:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 03:53:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure pci_get_drvdata [2025-03-04 03:53:07,168 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_get_drvdata [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32 [2025-03-04 03:53:07,168 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-04 03:53:07,168 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure pci_iounmap [2025-03-04 03:53:07,168 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_iounmap [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-04 03:53:07,168 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 03:53:07,168 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-04 03:53:07,168 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev_region [2025-03-04 03:53:07,168 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev_region [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-03-04 03:53:07,168 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 03:53:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 03:53:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-04 03:53:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-04 03:53:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-04 03:53:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-04 03:53:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-04 03:53:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-03-04 03:53:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-03-04 03:53:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-03-04 03:53:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#21 [2025-03-04 03:53:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-04 03:53:07,171 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-04 03:53:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:53:07,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:53:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure phantom_ioctl [2025-03-04 03:53:07,171 INFO L138 BoogieDeclarations]: Found implementation of procedure phantom_ioctl [2025-03-04 03:53:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_phantom_mutex [2025-03-04 03:53:07,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_phantom_mutex [2025-03-04 03:53:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-04 03:53:07,171 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-04 03:53:07,655 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:53:07,657 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:53:08,175 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3226: havoc ~res~0#1.base, ~res~0#1.offset; [2025-03-04 03:53:08,186 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090: havoc #t~mem13; [2025-03-04 03:53:08,188 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5086: havoc #t~nondet409; [2025-03-04 03:53:08,559 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3674: call ULTIMATE.dealloc(~#descriptor~2#1.base, ~#descriptor~2#1.offset);havoc ~#descriptor~2#1.base, ~#descriptor~2#1.offset;call ULTIMATE.dealloc(~#descriptor___0~1#1.base, ~#descriptor___0~1#1.offset);havoc ~#descriptor___0~1#1.base, ~#descriptor___0~1#1.offset; [2025-03-04 03:53:08,566 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5069: havoc dev_get_drvdata_#t~ret406#1.base, dev_get_drvdata_#t~ret406#1.offset; [2025-03-04 03:53:08,573 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5141: havoc #t~nondet417; [2025-03-04 03:53:08,575 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5066: havoc #t~nondet405; [2025-03-04 03:53:08,579 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5032: havoc #t~nondet401; [2025-03-04 03:53:08,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5021: havoc #t~nondet399; [2025-03-04 03:53:08,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3380: call ULTIMATE.dealloc(~#rs~0.base, ~#rs~0.offset);havoc ~#rs~0.base, ~#rs~0.offset;call ULTIMATE.dealloc(~#r~0.base, ~#r~0.offset);havoc ~#r~0.base, ~#r~0.offset;call ULTIMATE.dealloc(~#descriptor~1.base, ~#descriptor~1.offset);havoc ~#descriptor~1.base, ~#descriptor~1.offset;call ULTIMATE.dealloc(~#descriptor___0~0.base, ~#descriptor___0~0.offset);havoc ~#descriptor___0~0.base, ~#descriptor___0~0.offset;call ULTIMATE.dealloc(~#descriptor___1~0.base, ~#descriptor___1~0.offset);havoc ~#descriptor___1~0.base, ~#descriptor___1~0.offset; [2025-03-04 03:53:08,830 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5124: havoc #t~ret415.base, #t~ret415.offset; [2025-03-04 03:53:08,839 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5025: havoc _copy_to_user_#t~nondet400#1; [2025-03-04 03:53:08,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5001: havoc #t~nondet397; [2025-03-04 03:53:08,887 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3349: call ULTIMATE.dealloc(~#descriptor~0.base, ~#descriptor~0.offset);havoc ~#descriptor~0.base, ~#descriptor~0.offset; [2025-03-04 03:53:15,106 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4032: call ULTIMATE.dealloc(phantom_exit_~#descriptor~3#1.base, phantom_exit_~#descriptor~3#1.offset);havoc phantom_exit_~#descriptor~3#1.base, phantom_exit_~#descriptor~3#1.offset; [2025-03-04 03:53:15,106 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5056: havoc class_create_file_#t~nondet404#1; [2025-03-04 03:53:15,106 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4997: havoc __class_create_#t~ret396#1.base, __class_create_#t~ret396#1.offset; [2025-03-04 03:53:15,106 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3808: call ULTIMATE.dealloc(phantom_probe_~#__key~0#1.base, phantom_probe_~#__key~0#1.offset);havoc phantom_probe_~#__key~0#1.base, phantom_probe_~#__key~0#1.offset;call ULTIMATE.dealloc(phantom_probe_~#__key___0~0#1.base, phantom_probe_~#__key___0~0#1.offset);havoc phantom_probe_~#__key___0~0#1.base, phantom_probe_~#__key___0~0#1.offset;call ULTIMATE.dealloc(phantom_probe_~#__key___1~0#1.base, phantom_probe_~#__key___1~0#1.offset);havoc phantom_probe_~#__key___1~0#1.base, phantom_probe_~#__key___1~0#1.offset; [2025-03-04 03:53:15,106 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5099: havoc mutex_lock_interruptible_#t~nondet410#1; [2025-03-04 03:53:15,106 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5134: havoc pci_request_regions_#t~nondet416#1; [2025-03-04 03:53:15,106 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5073: havoc dev_set_drvdata_#t~nondet407#1; [2025-03-04 03:53:15,106 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3984: call ULTIMATE.dealloc(phantom_init_~#dev~7#1.base, phantom_init_~#dev~7#1.offset);havoc phantom_init_~#dev~7#1.base, phantom_init_~#dev~7#1.offset;call ULTIMATE.dealloc(phantom_init_~#__key~1#1.base, phantom_init_~#__key~1#1.offset);havoc phantom_init_~#__key~1#1.base, phantom_init_~#__key~1#1.offset; [2025-03-04 03:53:15,106 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5042: havoc alloc_chrdev_region_#t~nondet402#1; [2025-03-04 03:53:15,106 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5076: havoc device_create_#t~ret408#1.base, device_create_#t~ret408#1.offset; [2025-03-04 03:53:15,106 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5110: havoc no_llseek_#t~nondet412#1; [2025-03-04 03:53:15,107 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5011: havoc __pci_register_driver_#t~nondet398#1; [2025-03-04 03:53:15,107 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4352-1: ldv_mutex_lock_interruptible_9_#res#1 := ldv_mutex_lock_interruptible_9_~ldv_func_res~1#1; [2025-03-04 03:53:15,107 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5046: havoc cdev_add_#t~nondet403#1; [2025-03-04 03:53:15,107 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5145: havoc request_threaded_irq_#t~nondet418#1; [2025-03-04 03:53:15,107 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5114: havoc nonseekable_open_#t~nondet413#1; [2025-03-04 03:53:15,107 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5149: havoc show_class_attr_string_#t~nondet419#1; [2025-03-04 03:53:15,107 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3236: havoc __kmalloc_#t~ret91#1.base, __kmalloc_#t~ret91#1.offset; [2025-03-04 03:53:15,107 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5121: havoc pci_enable_device_#t~nondet414#1; [2025-03-04 03:53:15,327 INFO L? ?]: Removed 1082 outVars from TransFormulas that were not future-live. [2025-03-04 03:53:15,327 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:53:15,358 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:53:15,360 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 03:53:15,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:53:15 BoogieIcfgContainer [2025-03-04 03:53:15,360 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:53:15,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:53:15,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:53:15,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:53:15,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:53:05" (1/3) ... [2025-03-04 03:53:15,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4625d72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:53:15, skipping insertion in model container [2025-03-04 03:53:15,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:53:06" (2/3) ... [2025-03-04 03:53:15,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4625d72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:53:15, skipping insertion in model container [2025-03-04 03:53:15,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:53:15" (3/3) ... [2025-03-04 03:53:15,367 INFO L128 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--misc--phantom.ko-main.cil.out.i [2025-03-04 03:53:15,377 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:53:15,380 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 32_7a_cilled_linux-3.8-rc1-drivers--misc--phantom.ko-main.cil.out.i that has 59 procedures, 785 locations, 1 initial locations, 44 loop locations, and 1 error locations. [2025-03-04 03:53:15,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:53:15,470 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;@1a5e14b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:53:15,470 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:53:15,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 680 states, 487 states have (on average 1.3347022587268993) internal successors, (650), 512 states have internal predecessors, (650), 154 states have call successors, (154), 37 states have call predecessors, (154), 37 states have return successors, (154), 152 states have call predecessors, (154), 154 states have call successors, (154) [2025-03-04 03:53:15,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 03:53:15,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:15,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:53:15,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:15,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:15,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2064967605, now seen corresponding path program 1 times [2025-03-04 03:53:15,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:15,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521758208] [2025-03-04 03:53:15,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:15,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:16,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 03:53:16,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 03:53:16,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:16,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:17,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:53:17,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:17,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521758208] [2025-03-04 03:53:17,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521758208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:17,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:17,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:53:17,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30207792] [2025-03-04 03:53:17,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:17,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:53:17,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:17,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:53:17,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:17,126 INFO L87 Difference]: Start difference. First operand has 680 states, 487 states have (on average 1.3347022587268993) internal successors, (650), 512 states have internal predecessors, (650), 154 states have call successors, (154), 37 states have call predecessors, (154), 37 states have return successors, (154), 152 states have call predecessors, (154), 154 states have call successors, (154) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:53:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:17,551 INFO L93 Difference]: Finished difference Result 1602 states and 2277 transitions. [2025-03-04 03:53:17,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:53:17,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 03:53:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:17,565 INFO L225 Difference]: With dead ends: 1602 [2025-03-04 03:53:17,565 INFO L226 Difference]: Without dead ends: 917 [2025-03-04 03:53:17,570 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 03:53:17,571 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 349 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:17,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1795 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 03:53:17,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2025-03-04 03:53:17,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 890. [2025-03-04 03:53:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 637 states have (on average 1.3202511773940346) internal successors, (841), 672 states have internal predecessors, (841), 197 states have call successors, (197), 57 states have call predecessors, (197), 55 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2025-03-04 03:53:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1225 transitions. [2025-03-04 03:53:17,668 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1225 transitions. Word has length 13 [2025-03-04 03:53:17,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:17,668 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1225 transitions. [2025-03-04 03:53:17,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:53:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1225 transitions. [2025-03-04 03:53:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 03:53:17,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:17,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:53:17,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 03:53:17,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:17,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:17,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1063703336, now seen corresponding path program 1 times [2025-03-04 03:53:17,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:17,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688474281] [2025-03-04 03:53:17,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:17,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:18,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 03:53:18,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 03:53:18,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:18,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:53:18,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:18,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688474281] [2025-03-04 03:53:18,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688474281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:18,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:18,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:53:18,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142140938] [2025-03-04 03:53:18,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:18,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:53:18,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:18,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:53:18,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:18,864 INFO L87 Difference]: Start difference. First operand 890 states and 1225 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 03:53:22,890 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 03:53:23,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:23,285 INFO L93 Difference]: Finished difference Result 2561 states and 3522 transitions. [2025-03-04 03:53:23,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:53:23,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2025-03-04 03:53:23,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:23,300 INFO L225 Difference]: With dead ends: 2561 [2025-03-04 03:53:23,300 INFO L226 Difference]: Without dead ends: 1674 [2025-03-04 03:53:23,303 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 03:53:23,304 INFO L435 NwaCegarLoop]: 950 mSDtfsCounter, 892 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:23,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 1817 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 03:53:23,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2025-03-04 03:53:23,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1667. [2025-03-04 03:53:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1206 states have (on average 1.3200663349917081) internal successors, (1592), 1260 states have internal predecessors, (1592), 353 states have call successors, (353), 110 states have call predecessors, (353), 107 states have return successors, (343), 330 states have call predecessors, (343), 343 states have call successors, (343) [2025-03-04 03:53:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2288 transitions. [2025-03-04 03:53:23,372 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2288 transitions. Word has length 35 [2025-03-04 03:53:23,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:23,372 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2288 transitions. [2025-03-04 03:53:23,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 03:53:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2288 transitions. [2025-03-04 03:53:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 03:53:23,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:23,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:53:23,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:53:23,375 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:23,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:23,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2134314237, now seen corresponding path program 1 times [2025-03-04 03:53:23,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:23,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852432190] [2025-03-04 03:53:23,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:23,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:24,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 03:53:24,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 03:53:24,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:24,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:53:24,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:24,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852432190] [2025-03-04 03:53:24,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852432190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:24,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:24,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:53:24,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309771667] [2025-03-04 03:53:24,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:24,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:53:24,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:24,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:53:24,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:24,445 INFO L87 Difference]: Start difference. First operand 1667 states and 2288 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 03:53:24,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:24,632 INFO L93 Difference]: Finished difference Result 1693 states and 2320 transitions. [2025-03-04 03:53:24,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:53:24,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2025-03-04 03:53:24,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:24,640 INFO L225 Difference]: With dead ends: 1693 [2025-03-04 03:53:24,640 INFO L226 Difference]: Without dead ends: 1680 [2025-03-04 03:53:24,640 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 03:53:24,641 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 933 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:24,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 953 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:53:24,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2025-03-04 03:53:24,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1667. [2025-03-04 03:53:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1206 states have (on average 1.318407960199005) internal successors, (1590), 1260 states have internal predecessors, (1590), 353 states have call successors, (353), 110 states have call predecessors, (353), 107 states have return successors, (343), 330 states have call predecessors, (343), 343 states have call successors, (343) [2025-03-04 03:53:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2286 transitions. [2025-03-04 03:53:24,697 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2286 transitions. Word has length 42 [2025-03-04 03:53:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:24,697 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2286 transitions. [2025-03-04 03:53:24,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 03:53:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2286 transitions. [2025-03-04 03:53:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 03:53:24,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:24,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:53:24,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 03:53:24,699 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:24,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:24,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2132023908, now seen corresponding path program 1 times [2025-03-04 03:53:24,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:24,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632658612] [2025-03-04 03:53:24,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:24,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:25,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 03:53:25,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 03:53:25,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:25,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:53:25,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:25,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632658612] [2025-03-04 03:53:25,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632658612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:25,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:25,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:53:25,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348181629] [2025-03-04 03:53:25,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:25,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:53:25,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:25,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:53:25,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:25,721 INFO L87 Difference]: Start difference. First operand 1667 states and 2286 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 03:53:29,745 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 03:53:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:29,985 INFO L93 Difference]: Finished difference Result 1669 states and 2287 transitions. [2025-03-04 03:53:29,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:53:29,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2025-03-04 03:53:29,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:30,000 INFO L225 Difference]: With dead ends: 1669 [2025-03-04 03:53:30,000 INFO L226 Difference]: Without dead ends: 1666 [2025-03-04 03:53:30,002 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 03:53:30,002 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 912 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:30,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 919 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 03:53:30,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2025-03-04 03:53:30,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2025-03-04 03:53:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1206 states have (on average 1.3175787728026533) internal successors, (1589), 1259 states have internal predecessors, (1589), 352 states have call successors, (352), 110 states have call predecessors, (352), 107 states have return successors, (343), 330 states have call predecessors, (343), 343 states have call successors, (343) [2025-03-04 03:53:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2284 transitions. [2025-03-04 03:53:30,094 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2284 transitions. Word has length 42 [2025-03-04 03:53:30,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:30,094 INFO L471 AbstractCegarLoop]: Abstraction has 1666 states and 2284 transitions. [2025-03-04 03:53:30,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 03:53:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2284 transitions. [2025-03-04 03:53:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 03:53:30,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:30,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:53:30,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 03:53:30,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:30,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:30,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1668919722, now seen corresponding path program 1 times [2025-03-04 03:53:30,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:30,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596263846] [2025-03-04 03:53:30,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:30,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:30,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 03:53:30,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 03:53:30,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:30,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:31,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:53:31,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:31,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596263846] [2025-03-04 03:53:31,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596263846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:31,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:31,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:53:31,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839490719] [2025-03-04 03:53:31,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:31,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:53:31,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:31,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:53:31,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:31,157 INFO L87 Difference]: Start difference. First operand 1666 states and 2284 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 03:53:35,180 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 03:53:35,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:35,408 INFO L93 Difference]: Finished difference Result 1668 states and 2285 transitions. [2025-03-04 03:53:35,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:53:35,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2025-03-04 03:53:35,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:35,417 INFO L225 Difference]: With dead ends: 1668 [2025-03-04 03:53:35,417 INFO L226 Difference]: Without dead ends: 1665 [2025-03-04 03:53:35,418 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 03:53:35,419 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 909 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:35,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 917 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 03:53:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-03-04 03:53:35,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2025-03-04 03:53:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1206 states have (on average 1.3167495854063018) internal successors, (1588), 1258 states have internal predecessors, (1588), 351 states have call successors, (351), 110 states have call predecessors, (351), 107 states have return successors, (343), 330 states have call predecessors, (343), 343 states have call successors, (343) [2025-03-04 03:53:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2282 transitions. [2025-03-04 03:53:35,474 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2282 transitions. Word has length 43 [2025-03-04 03:53:35,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:35,474 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2282 transitions. [2025-03-04 03:53:35,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 03:53:35,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2282 transitions. [2025-03-04 03:53:35,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 03:53:35,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:35,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:53:35,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 03:53:35,476 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:35,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:35,476 INFO L85 PathProgramCache]: Analyzing trace with hash -197592867, now seen corresponding path program 1 times [2025-03-04 03:53:35,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:35,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82310903] [2025-03-04 03:53:35,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:35,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:36,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 03:53:36,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 03:53:36,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:36,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:53:36,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:36,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82310903] [2025-03-04 03:53:36,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82310903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:36,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:36,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:53:36,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771964169] [2025-03-04 03:53:36,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:36,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:53:36,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:36,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:53:36,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:36,543 INFO L87 Difference]: Start difference. First operand 1665 states and 2282 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 03:53:40,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:53:40,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:40,770 INFO L93 Difference]: Finished difference Result 1667 states and 2283 transitions. [2025-03-04 03:53:40,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:53:40,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2025-03-04 03:53:40,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:40,778 INFO L225 Difference]: With dead ends: 1667 [2025-03-04 03:53:40,778 INFO L226 Difference]: Without dead ends: 1664 [2025-03-04 03:53:40,779 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 03:53:40,779 INFO L435 NwaCegarLoop]: 915 mSDtfsCounter, 906 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:40,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 915 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 03:53:40,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2025-03-04 03:53:40,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1664. [2025-03-04 03:53:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1206 states have (on average 1.3159203980099503) internal successors, (1587), 1257 states have internal predecessors, (1587), 350 states have call successors, (350), 110 states have call predecessors, (350), 107 states have return successors, (343), 330 states have call predecessors, (343), 343 states have call successors, (343) [2025-03-04 03:53:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2280 transitions. [2025-03-04 03:53:40,841 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2280 transitions. Word has length 44 [2025-03-04 03:53:40,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:40,841 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 2280 transitions. [2025-03-04 03:53:40,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 03:53:40,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2280 transitions. [2025-03-04 03:53:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 03:53:40,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:40,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:53:40,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 03:53:40,843 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:40,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:40,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1831101641, now seen corresponding path program 1 times [2025-03-04 03:53:40,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:40,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105800383] [2025-03-04 03:53:40,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:40,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:41,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 03:53:41,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 03:53:41,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:41,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:53:41,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:41,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105800383] [2025-03-04 03:53:41,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105800383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:41,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:41,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:53:41,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011431494] [2025-03-04 03:53:41,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:41,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:53:41,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:41,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:53:41,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:41,859 INFO L87 Difference]: Start difference. First operand 1664 states and 2280 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 03:53:45,880 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 03:53:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:46,405 INFO L93 Difference]: Finished difference Result 4923 states and 6747 transitions. [2025-03-04 03:53:46,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:53:46,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2025-03-04 03:53:46,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:46,422 INFO L225 Difference]: With dead ends: 4923 [2025-03-04 03:53:46,423 INFO L226 Difference]: Without dead ends: 3262 [2025-03-04 03:53:46,429 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 03:53:46,430 INFO L435 NwaCegarLoop]: 950 mSDtfsCounter, 881 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:46,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1824 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-04 03:53:46,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2025-03-04 03:53:46,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3252. [2025-03-04 03:53:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3252 states, 2368 states have (on average 1.3163006756756757) internal successors, (3117), 2466 states have internal predecessors, (3117), 671 states have call successors, (671), 218 states have call predecessors, (671), 212 states have return successors, (662), 635 states have call predecessors, (662), 662 states have call successors, (662) [2025-03-04 03:53:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3252 states to 3252 states and 4450 transitions. [2025-03-04 03:53:46,592 INFO L78 Accepts]: Start accepts. Automaton has 3252 states and 4450 transitions. Word has length 45 [2025-03-04 03:53:46,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:46,592 INFO L471 AbstractCegarLoop]: Abstraction has 3252 states and 4450 transitions. [2025-03-04 03:53:46,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 03:53:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3252 states and 4450 transitions. [2025-03-04 03:53:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 03:53:46,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:46,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:53:46,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 03:53:46,594 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:46,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash -930267106, now seen corresponding path program 1 times [2025-03-04 03:53:46,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:46,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204446387] [2025-03-04 03:53:46,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:46,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:47,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 03:53:47,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 03:53:47,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:47,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:53:47,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:47,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204446387] [2025-03-04 03:53:47,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204446387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:47,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:47,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:53:47,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784827974] [2025-03-04 03:53:47,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:47,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:53:47,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:47,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:53:47,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:47,464 INFO L87 Difference]: Start difference. First operand 3252 states and 4450 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 03:53:51,486 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 03:53:51,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:51,862 INFO L93 Difference]: Finished difference Result 3303 states and 4487 transitions. [2025-03-04 03:53:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:53:51,863 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), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2025-03-04 03:53:51,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:51,881 INFO L225 Difference]: With dead ends: 3303 [2025-03-04 03:53:51,881 INFO L226 Difference]: Without dead ends: 3248 [2025-03-04 03:53:51,884 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 03:53:51,887 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 845 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:51,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 983 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 03:53:51,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2025-03-04 03:53:52,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 3227. [2025-03-04 03:53:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3227 states, 2354 states have (on average 1.312659303313509) internal successors, (3090), 2448 states have internal predecessors, (3090), 656 states have call successors, (656), 222 states have call predecessors, (656), 216 states have return successors, (649), 624 states have call predecessors, (649), 649 states have call successors, (649) [2025-03-04 03:53:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 4395 transitions. [2025-03-04 03:53:52,103 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 4395 transitions. Word has length 46 [2025-03-04 03:53:52,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:52,104 INFO L471 AbstractCegarLoop]: Abstraction has 3227 states and 4395 transitions. [2025-03-04 03:53:52,104 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), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 03:53:52,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 4395 transitions. [2025-03-04 03:53:52,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 03:53:52,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:52,116 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:52,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 03:53:52,117 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:52,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:52,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1314808067, now seen corresponding path program 1 times [2025-03-04 03:53:52,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:52,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216017099] [2025-03-04 03:53:52,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:52,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:52,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 03:53:52,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 03:53:52,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:52,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:53,089 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 03:53:53,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:53,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216017099] [2025-03-04 03:53:53,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216017099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:53,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:53,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:53:53,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728120028] [2025-03-04 03:53:53,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:53,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:53:53,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:53,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:53:53,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:53,090 INFO L87 Difference]: Start difference. First operand 3227 states and 4395 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 03:53:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:53,717 INFO L93 Difference]: Finished difference Result 8401 states and 11477 transitions. [2025-03-04 03:53:53,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:53:53,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 151 [2025-03-04 03:53:53,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:53,743 INFO L225 Difference]: With dead ends: 8401 [2025-03-04 03:53:53,744 INFO L226 Difference]: Without dead ends: 5177 [2025-03-04 03:53:53,755 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 03:53:53,756 INFO L435 NwaCegarLoop]: 1411 mSDtfsCounter, 666 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 2301 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:53,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 2301 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 03:53:53,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5177 states. [2025-03-04 03:53:53,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5177 to 5115. [2025-03-04 03:53:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5115 states, 3768 states have (on average 1.32776008492569) internal successors, (5003), 3891 states have internal predecessors, (5003), 1007 states have call successors, (1007), 345 states have call predecessors, (1007), 339 states have return successors, (1000), 966 states have call predecessors, (1000), 1000 states have call successors, (1000) [2025-03-04 03:53:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5115 states to 5115 states and 7010 transitions. [2025-03-04 03:53:53,991 INFO L78 Accepts]: Start accepts. Automaton has 5115 states and 7010 transitions. Word has length 151 [2025-03-04 03:53:53,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:53,991 INFO L471 AbstractCegarLoop]: Abstraction has 5115 states and 7010 transitions. [2025-03-04 03:53:53,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 03:53:53,997 INFO L276 IsEmpty]: Start isEmpty. Operand 5115 states and 7010 transitions. [2025-03-04 03:53:54,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-04 03:53:54,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:54,006 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-04 03:53:54,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 03:53:54,006 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:54,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:54,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2087202726, now seen corresponding path program 1 times [2025-03-04 03:53:54,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:54,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651938515] [2025-03-04 03:53:54,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:54,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:53:54,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 03:53:54,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 03:53:54,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:53:54,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:53:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-04 03:53:55,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:53:55,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651938515] [2025-03-04 03:53:55,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651938515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:53:55,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:53:55,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:53:55,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631117839] [2025-03-04 03:53:55,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:53:55,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:53:55,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:53:55,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:53:55,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:53:55,228 INFO L87 Difference]: Start difference. First operand 5115 states and 7010 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 03:53:59,252 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 03:53:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:53:59,704 INFO L93 Difference]: Finished difference Result 5120 states and 7013 transitions. [2025-03-04 03:53:59,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:53:59,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 186 [2025-03-04 03:53:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:53:59,731 INFO L225 Difference]: With dead ends: 5120 [2025-03-04 03:53:59,731 INFO L226 Difference]: Without dead ends: 5117 [2025-03-04 03:53:59,735 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 03:53:59,736 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 53 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:53:59,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1770 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 03:53:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5117 states. [2025-03-04 03:53:59,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5117 to 5114. [2025-03-04 03:53:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5114 states, 3768 states have (on average 1.3256369426751593) internal successors, (4995), 3890 states have internal predecessors, (4995), 1006 states have call successors, (1006), 345 states have call predecessors, (1006), 339 states have return successors, (1000), 966 states have call predecessors, (1000), 1000 states have call successors, (1000) [2025-03-04 03:53:59,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5114 states to 5114 states and 7001 transitions. [2025-03-04 03:53:59,926 INFO L78 Accepts]: Start accepts. Automaton has 5114 states and 7001 transitions. Word has length 186 [2025-03-04 03:53:59,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:53:59,926 INFO L471 AbstractCegarLoop]: Abstraction has 5114 states and 7001 transitions. [2025-03-04 03:53:59,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 03:53:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 5114 states and 7001 transitions. [2025-03-04 03:53:59,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-04 03:53:59,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:53:59,931 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-04 03:53:59,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 03:53:59,931 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:53:59,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:53:59,932 INFO L85 PathProgramCache]: Analyzing trace with hash 936685629, now seen corresponding path program 1 times [2025-03-04 03:53:59,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:53:59,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709316369] [2025-03-04 03:53:59,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:53:59,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:54:00,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 03:54:00,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 03:54:00,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:54:00,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:54:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-04 03:54:01,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:54:01,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709316369] [2025-03-04 03:54:01,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709316369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:54:01,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:54:01,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:54:01,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169956875] [2025-03-04 03:54:01,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:54:01,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:54:01,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:54:01,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:54:01,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:54:01,332 INFO L87 Difference]: Start difference. First operand 5114 states and 7001 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 03:54:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:54:02,028 INFO L93 Difference]: Finished difference Result 5117 states and 7003 transitions. [2025-03-04 03:54:02,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:54:02,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 187 [2025-03-04 03:54:02,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:54:02,049 INFO L225 Difference]: With dead ends: 5117 [2025-03-04 03:54:02,050 INFO L226 Difference]: Without dead ends: 5091 [2025-03-04 03:54:02,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:54:02,053 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 0 mSDsluCounter, 2711 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3617 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 03:54:02,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3617 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 03:54:02,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5091 states. [2025-03-04 03:54:02,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5091 to 5091. [2025-03-04 03:54:02,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5091 states, 3752 states have (on average 1.3248933901918976) internal successors, (4971), 3873 states have internal predecessors, (4971), 1001 states have call successors, (1001), 342 states have call predecessors, (1001), 337 states have return successors, (997), 963 states have call predecessors, (997), 997 states have call successors, (997) [2025-03-04 03:54:02,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 6969 transitions. [2025-03-04 03:54:02,237 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 6969 transitions. Word has length 187 [2025-03-04 03:54:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:54:02,238 INFO L471 AbstractCegarLoop]: Abstraction has 5091 states and 6969 transitions. [2025-03-04 03:54:02,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 03:54:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 6969 transitions. [2025-03-04 03:54:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-04 03:54:02,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:54:02,243 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-04 03:54:02,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 03:54:02,243 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:54:02,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:54:02,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1329712639, now seen corresponding path program 1 times [2025-03-04 03:54:02,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:54:02,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481768332] [2025-03-04 03:54:02,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:54:02,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:54:02,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 03:54:02,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 03:54:02,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:54:02,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:54:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-04 03:54:03,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:54:03,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481768332] [2025-03-04 03:54:03,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481768332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:54:03,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:54:03,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:54:03,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397021486] [2025-03-04 03:54:03,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:54:03,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:54:03,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:54:03,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:54:03,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:54:03,265 INFO L87 Difference]: Start difference. First operand 5091 states and 6969 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 03:54:07,287 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 03:54:07,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:54:07,841 INFO L93 Difference]: Finished difference Result 10178 states and 13934 transitions. [2025-03-04 03:54:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:54:07,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 187 [2025-03-04 03:54:07,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:54:07,860 INFO L225 Difference]: With dead ends: 10178 [2025-03-04 03:54:07,860 INFO L226 Difference]: Without dead ends: 5090 [2025-03-04 03:54:07,873 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 03:54:07,873 INFO L435 NwaCegarLoop]: 1668 mSDtfsCounter, 883 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:54:07,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 2500 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-04 03:54:07,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5090 states. [2025-03-04 03:54:08,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5090 to 5054. [2025-03-04 03:54:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5054 states, 3722 states have (on average 1.3232133261687264) internal successors, (4925), 3842 states have internal predecessors, (4925), 997 states have call successors, (997), 339 states have call predecessors, (997), 334 states have return successors, (994), 960 states have call predecessors, (994), 994 states have call successors, (994) [2025-03-04 03:54:08,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5054 states to 5054 states and 6916 transitions. [2025-03-04 03:54:08,125 INFO L78 Accepts]: Start accepts. Automaton has 5054 states and 6916 transitions. Word has length 187 [2025-03-04 03:54:08,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:54:08,126 INFO L471 AbstractCegarLoop]: Abstraction has 5054 states and 6916 transitions. [2025-03-04 03:54:08,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 03:54:08,126 INFO L276 IsEmpty]: Start isEmpty. Operand 5054 states and 6916 transitions. [2025-03-04 03:54:08,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-04 03:54:08,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:54:08,133 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 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] [2025-03-04 03:54:08,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 03:54:08,133 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:54:08,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:54:08,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1865549694, now seen corresponding path program 1 times [2025-03-04 03:54:08,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:54:08,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653275442] [2025-03-04 03:54:08,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:54:08,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:54:08,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-04 03:54:08,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-04 03:54:08,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:54:08,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:54:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-04 03:54:09,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:54:09,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653275442] [2025-03-04 03:54:09,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653275442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:54:09,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:54:09,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:54:09,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754363811] [2025-03-04 03:54:09,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:54:09,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:54:09,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:54:09,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:54:09,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:54:09,312 INFO L87 Difference]: Start difference. First operand 5054 states and 6916 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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 03:54:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:54:09,854 INFO L93 Difference]: Finished difference Result 5210 states and 7092 transitions. [2025-03-04 03:54:09,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:54:09,855 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), 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 204 [2025-03-04 03:54:09,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:54:09,858 INFO L225 Difference]: With dead ends: 5210 [2025-03-04 03:54:09,858 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 03:54:09,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:54:09,866 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 0 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3489 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 03:54:09,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3489 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 03:54:09,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 03:54:09,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 03:54:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:54:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 03:54:09,868 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2025-03-04 03:54:09,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:54:09,868 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 03:54:09,868 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), 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 03:54:09,868 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 03:54:09,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 03:54:09,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 03:54:09,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 03:54:09,874 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:54:09,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.