./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash be936ec9376452d086f72aa92ac4fe7deb233a068e40e0ed8f478fbc228d19b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 03:58:44,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 03:58:44,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 03:58:44,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 03:58:44,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 03:58:44,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 03:58:44,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 03:58:44,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 03:58:44,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 03:58:44,790 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 03:58:44,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 03:58:44,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 03:58:44,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 03:58:44,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 03:58:44,790 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 03:58:44,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 03:58:44,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 03:58:44,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 03:58:44,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 03:58:44,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 03:58:44,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 03:58:44,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 03:58:44,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 03:58:44,790 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 03:58:44,791 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 03:58:44,791 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 03:58:44,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 03:58:44,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 03:58:44,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 03:58:44,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:58:44,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 03:58:44,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 03:58:44,791 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 03:58:44,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 03:58:44,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 03:58:44,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 03:58:44,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 03:58:44,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 03:58:44,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 03:58:44,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 03:58:44,792 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 -> be936ec9376452d086f72aa92ac4fe7deb233a068e40e0ed8f478fbc228d19b6 [2025-03-04 03:58:45,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 03:58:45,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 03:58:45,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 03:58:45,022 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 03:58:45,022 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 03:58:45,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i [2025-03-04 03:58:46,137 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3258eef0e/3d0f3abffb314864af6c4aed84d2648c/FLAGadc29d375 [2025-03-04 03:58:46,504 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 03:58:46,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i [2025-03-04 03:58:46,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3258eef0e/3d0f3abffb314864af6c4aed84d2648c/FLAGadc29d375 [2025-03-04 03:58:46,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3258eef0e/3d0f3abffb314864af6c4aed84d2648c [2025-03-04 03:58:46,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 03:58:46,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 03:58:46,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 03:58:46,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 03:58:46,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 03:58:46,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:58:46" (1/1) ... [2025-03-04 03:58:46,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3456e521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:46, skipping insertion in model container [2025-03-04 03:58:46,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:58:46" (1/1) ... [2025-03-04 03:58:46,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 03:58:47,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i[164250,164263] [2025-03-04 03:58:47,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:58:47,596 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:58:47,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5441] [2025-03-04 03:58:47,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [5448] [2025-03-04 03:58:47,662 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5456-5457] [2025-03-04 03:58:47,663 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)); [5485] [2025-03-04 03:58:47,663 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; decl %0": "+m" (v->counter)); [5492] [2025-03-04 03:58:47,671 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i[164250,164263] [2025-03-04 03:58:47,693 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/work/ldvuser/mutilin/launch/work/current--X--drivers--X--defaultlinux-3.12-rc1.tar.xz--X--144_2a--X--cpachecker/linux-3.12-rc1.tar.xz/csd_deg_dscv/6225/dscv_tempdir/dscv/ri/144_2a/drivers/net/can/usb/ems_usb.o.c.prepared"), "i" (546), "i" (12UL)); [6159-6160] [2025-03-04 03:58:47,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:58:47,789 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:58:47,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:47 WrapperNode [2025-03-04 03:58:47,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:58:47,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:58:47,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:58:47,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:58:47,795 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:58:47" (1/1) ... [2025-03-04 03:58:47,820 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:58:47" (1/1) ... [2025-03-04 03:58:47,886 INFO L138 Inliner]: procedures = 168, calls = 765, calls flagged for inlining = 78, calls inlined = 78, statements flattened = 2252 [2025-03-04 03:58:47,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:58:47,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:58:47,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:58:47,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:58:47,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:47" (1/1) ... [2025-03-04 03:58:47,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:47" (1/1) ... [2025-03-04 03:58:47,914 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:47" (1/1) ... [2025-03-04 03:58:48,097 INFO L175 MemorySlicer]: Split 454 memory accesses to 8 slices as follows [2, 44, 342, 20, 9, 20, 9, 8]. 75 percent of accesses are in the largest equivalence class. The 44 initializations are split as follows [2, 0, 34, 0, 0, 0, 0, 8]. The 224 writes are split as follows [0, 44, 164, 11, 5, 0, 0, 0]. [2025-03-04 03:58:48,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:47" (1/1) ... [2025-03-04 03:58:48,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:47" (1/1) ... [2025-03-04 03:58:48,163 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:47" (1/1) ... [2025-03-04 03:58:48,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:47" (1/1) ... [2025-03-04 03:58:48,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:47" (1/1) ... [2025-03-04 03:58:48,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:47" (1/1) ... [2025-03-04 03:58:48,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:58:48,214 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:58:48,214 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:58:48,214 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:58:48,215 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:47" (1/1) ... [2025-03-04 03:58:48,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:58:48,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:58:48,239 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:58:48,242 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:58:48,258 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2025-03-04 03:58:48,259 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2025-03-04 03:58:48,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 03:58:48,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 03:58:48,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 03:58:48,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 03:58:48,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 03:58:48,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 03:58:48,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 03:58:48,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 03:58:48,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_18 [2025-03-04 03:58:48,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_18 [2025-03-04 03:58:48,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2025-03-04 03:58:48,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2025-03-04 03:58:48,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_3 [2025-03-04 03:58:48,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_3 [2025-03-04 03:58:48,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_2 [2025-03-04 03:58:48,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_2 [2025-03-04 03:58:48,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 03:58:48,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 03:58:48,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 03:58:48,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 03:58:48,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 03:58:48,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 03:58:48,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 03:58:48,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 03:58:48,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-03-04 03:58:48,263 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_read_bulk_callback [2025-03-04 03:58:48,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_read_bulk_callback [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_present [2025-03-04 03:58:48,263 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_present [2025-03-04 03:58:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2025-03-04 03:58:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2025-03-04 03:58:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2025-03-04 03:58:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-04 03:58:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 03:58:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2025-03-04 03:58:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-04 03:58:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2025-03-04 03:58:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 03:58:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2025-03-04 03:58:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 03:58:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 03:58:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 03:58:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-03-04 03:58:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2025-03-04 03:58:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:58:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_err [2025-03-04 03:58:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_err [2025-03-04 03:58:48,265 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2025-03-04 03:58:48,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2025-03-04 03:58:48,265 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2025-03-04 03:58:48,265 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2025-03-04 03:58:48,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:58:48,265 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-03-04 03:58:48,265 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-03-04 03:58:48,265 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-04 03:58:48,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-04 03:58:48,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 03:58:48,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:58:48,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:58:48,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:58:48,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 03:58:48,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 03:58:48,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 03:58:48,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 03:58:48,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 03:58:48,267 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2025-03-04 03:58:48,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2025-03-04 03:58:48,267 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 03:58:48,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-03-04 03:58:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2025-03-04 03:58:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_disconnect [2025-03-04 03:58:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_disconnect [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2025-03-04 03:58:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2025-03-04 03:58:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_read_interrupt_callback [2025-03-04 03:58:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_read_interrupt_callback [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2025-03-04 03:58:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2025-03-04 03:58:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_rx_err [2025-03-04 03:58:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_rx_err [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-04 03:58:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_warn [2025-03-04 03:58:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_warn [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-04 03:58:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2025-03-04 03:58:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-03-04 03:58:48,268 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-03-04 03:58:48,268 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2025-03-04 03:58:48,269 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-03-04 03:58:48,269 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2025-03-04 03:58:48,269 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2025-03-04 03:58:48,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2025-03-04 03:58:48,269 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2025-03-04 03:58:48,269 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 03:58:48,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 03:58:48,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:58:48,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:58:48,661 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:58:48,664 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:58:48,730 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 03:58:48,961 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7370: havoc alloc_can_skb_#t~ret439#1.base, alloc_can_skb_#t~ret439#1.offset; [2025-03-04 03:58:48,962 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5935: call ULTIMATE.dealloc(ems_usb_rx_can_msg_~#cf~0#1.base, ems_usb_rx_can_msg_~#cf~0#1.offset);havoc ems_usb_rx_can_msg_~#cf~0#1.base, ems_usb_rx_can_msg_~#cf~0#1.offset; [2025-03-04 03:58:49,023 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6226: call ULTIMATE.dealloc(~#cmd~0.base, ~#cmd~0.offset);havoc ~#cmd~0.base, ~#cmd~0.offset; [2025-03-04 03:58:49,051 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7436: havoc netpoll_trap_#t~nondet449#1; [2025-03-04 03:58:49,088 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5576: havoc #t~mem42;havoc #t~bitwise43; [2025-03-04 03:58:49,118 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5464: havoc #t~mem4;havoc #t~bitwise5; [2025-03-04 03:58:49,144 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5525: call ULTIMATE.dealloc(~#__key~0#1.base, ~#__key~0#1.offset);havoc ~#__key~0#1.base, ~#__key~0#1.offset;call ULTIMATE.dealloc(~#__key___0~0#1.base, ~#__key___0~0#1.offset);havoc ~#__key___0~0#1.base, ~#__key___0~0#1.offset; [2025-03-04 03:58:49,167 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7444: havoc printk_#t~nondet451#1; [2025-03-04 03:58:49,253 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6200: call ULTIMATE.dealloc(~#actual_length~0#1.base, ~#actual_length~0#1.offset);havoc ~#actual_length~0#1.base, ~#actual_length~0#1.offset; [2025-03-04 03:58:49,253 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7461: havoc usb_bulk_msg_#t~nondet454#1; [2025-03-04 03:58:49,257 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7417: havoc #t~nondet445; [2025-03-04 03:58:49,258 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2025-03-04 03:58:49,270 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7481: havoc usb_unlink_urb_#t~nondet456#1; [2025-03-04 03:58:49,323 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7383: havoc can_get_echo_skb_#t~nondet441#1; [2025-03-04 03:58:49,329 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7454: havoc #t~ret453.base, #t~ret453.offset; [2025-03-04 03:58:49,348 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7432: havoc #t~nondet448; [2025-03-04 03:58:49,548 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978: call ULTIMATE.dealloc(~#cf~1#1.base, ~#cf~1#1.offset);havoc ~#cf~1#1.base, ~#cf~1#1.offset; [2025-03-04 03:58:49,548 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7367: havoc alloc_can_err_skb_#t~ret438#1.base, alloc_can_err_skb_#t~ret438#1.offset; [2025-03-04 03:58:49,551 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7396: havoc #t~nondet442; [2025-03-04 03:58:49,553 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7425: havoc #t~nondet447; [2025-03-04 03:58:49,565 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5591: havoc __kmalloc_#t~ret46#1.base, __kmalloc_#t~ret46#1.offset; [2025-03-04 03:58:49,572 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5712: havoc #t~mem58.base, #t~mem58.offset; [2025-03-04 03:58:49,575 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7421: havoc #t~nondet446; [2025-03-04 03:58:55,815 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7373: havoc alloc_candev_#t~ret440#1.base, alloc_candev_#t~ret440#1.offset; [2025-03-04 03:58:55,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7440: havoc open_candev_#t~nondet450#1; [2025-03-04 03:58:55,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7474: havoc usb_register_driver_#t~nondet455#1; [2025-03-04 03:58:55,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7409: havoc ldv_ndo_init_2_#t~nondet443#1; [2025-03-04 03:58:55,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7413: havoc ldv_ndo_uninit_2_#t~nondet444#1; [2025-03-04 03:58:55,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7448: havoc register_candev_#t~nondet452#1; [2025-03-04 03:58:55,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5472: havoc atomic_read_#t~mem9#1; [2025-03-04 03:58:55,991 INFO L? ?]: Removed 977 outVars from TransFormulas that were not future-live. [2025-03-04 03:58:55,991 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:58:56,032 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:58:56,033 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 03:58:56,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:58:56 BoogieIcfgContainer [2025-03-04 03:58:56,034 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:58:56,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:58:56,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:58:56,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:58:56,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:58:46" (1/3) ... [2025-03-04 03:58:56,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8f8f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:58:56, skipping insertion in model container [2025-03-04 03:58:56,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:47" (2/3) ... [2025-03-04 03:58:56,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8f8f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:58:56, skipping insertion in model container [2025-03-04 03:58:56,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:58:56" (3/3) ... [2025-03-04 03:58:56,042 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i [2025-03-04 03:58:56,054 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:58:56,057 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i that has 53 procedures, 784 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-04 03:58:56,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:58:56,133 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;@4cf15fdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:58:56,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:58:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 782 states, 573 states have (on average 1.343804537521815) internal successors, (770), 599 states have internal predecessors, (770), 157 states have call successors, (157), 52 states have call predecessors, (157), 50 states have return successors, (151), 146 states have call predecessors, (151), 151 states have call successors, (151) [2025-03-04 03:58:56,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 03:58:56,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:58:56,147 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:58:56,147 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:58:56,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:58:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash -767945464, now seen corresponding path program 1 times [2025-03-04 03:58:56,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:58:56,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466872981] [2025-03-04 03:58:56,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:58:56,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:58:57,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 03:58:57,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 03:58:57,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:58:57,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:58:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 03:58:58,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:58:58,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466872981] [2025-03-04 03:58:58,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466872981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:58:58,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:58:58,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:58:58,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840992280] [2025-03-04 03:58:58,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:58:58,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:58:58,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:58:58,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:58:58,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:58:58,088 INFO L87 Difference]: Start difference. First operand has 782 states, 573 states have (on average 1.343804537521815) internal successors, (770), 599 states have internal predecessors, (770), 157 states have call successors, (157), 52 states have call predecessors, (157), 50 states have return successors, (151), 146 states have call predecessors, (151), 151 states have call successors, (151) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 03:59:02,127 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:59:02,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:02,676 INFO L93 Difference]: Finished difference Result 2302 states and 3241 transitions. [2025-03-04 03:59:02,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:02,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-04 03:59:02,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:02,699 INFO L225 Difference]: With dead ends: 2302 [2025-03-04 03:59:02,699 INFO L226 Difference]: Without dead ends: 1501 [2025-03-04 03:59:02,707 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:59:02,710 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1010 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:02,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 2059 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-04 03:59:02,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2025-03-04 03:59:02,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1501. [2025-03-04 03:59:02,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1109 states have (on average 1.3047790802524797) internal successors, (1447), 1141 states have internal predecessors, (1447), 293 states have call successors, (293), 99 states have call predecessors, (293), 98 states have return successors, (288), 278 states have call predecessors, (288), 288 states have call successors, (288) [2025-03-04 03:59:02,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2028 transitions. [2025-03-04 03:59:02,852 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2028 transitions. Word has length 28 [2025-03-04 03:59:02,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:02,852 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 2028 transitions. [2025-03-04 03:59:02,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 03:59:02,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2028 transitions. [2025-03-04 03:59:02,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 03:59:02,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:02,857 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:59:02,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 03:59:02,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:02,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:02,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2130009988, now seen corresponding path program 1 times [2025-03-04 03:59:02,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:02,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614708894] [2025-03-04 03:59:02,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:02,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:04,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 03:59:04,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 03:59:04,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:04,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:59:04,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:04,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614708894] [2025-03-04 03:59:04,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614708894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:04,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:04,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:04,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130668940] [2025-03-04 03:59:04,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:04,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:04,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:04,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:04,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:04,580 INFO L87 Difference]: Start difference. First operand 1501 states and 2028 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:05,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:05,121 INFO L93 Difference]: Finished difference Result 4488 states and 6169 transitions. [2025-03-04 03:59:05,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:05,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2025-03-04 03:59:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:05,138 INFO L225 Difference]: With dead ends: 4488 [2025-03-04 03:59:05,138 INFO L226 Difference]: Without dead ends: 2994 [2025-03-04 03:59:05,144 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:59:05,145 INFO L435 NwaCegarLoop]: 1534 mSDtfsCounter, 1024 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 2526 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:05,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 2526 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 03:59:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2025-03-04 03:59:05,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2984. [2025-03-04 03:59:05,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2984 states, 2208 states have (on average 1.3034420289855073) internal successors, (2878), 2268 states have internal predecessors, (2878), 579 states have call successors, (579), 197 states have call predecessors, (579), 196 states have return successors, (618), 554 states have call predecessors, (618), 574 states have call successors, (618) [2025-03-04 03:59:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 4075 transitions. [2025-03-04 03:59:05,254 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 4075 transitions. Word has length 38 [2025-03-04 03:59:05,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:05,256 INFO L471 AbstractCegarLoop]: Abstraction has 2984 states and 4075 transitions. [2025-03-04 03:59:05,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:05,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 4075 transitions. [2025-03-04 03:59:05,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 03:59:05,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:05,259 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:59:05,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:59:05,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:05,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1605120249, now seen corresponding path program 1 times [2025-03-04 03:59:05,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:05,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104573392] [2025-03-04 03:59:05,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:05,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:06,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 03:59:06,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 03:59:06,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:06,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:59:06,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:06,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104573392] [2025-03-04 03:59:06,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104573392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:06,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:06,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:06,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950753164] [2025-03-04 03:59:06,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:06,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:06,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:06,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:06,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:06,770 INFO L87 Difference]: Start difference. First operand 2984 states and 4075 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:06,985 INFO L93 Difference]: Finished difference Result 2986 states and 4076 transitions. [2025-03-04 03:59:06,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:06,986 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-03-04 03:59:06,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:07,001 INFO L225 Difference]: With dead ends: 2986 [2025-03-04 03:59:07,001 INFO L226 Difference]: Without dead ends: 2983 [2025-03-04 03:59:07,003 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:59:07,004 INFO L435 NwaCegarLoop]: 1012 mSDtfsCounter, 1010 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:07,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 1012 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:59:07,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2025-03-04 03:59:07,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 2983. [2025-03-04 03:59:07,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2983 states, 2208 states have (on average 1.3029891304347827) internal successors, (2877), 2267 states have internal predecessors, (2877), 578 states have call successors, (578), 197 states have call predecessors, (578), 196 states have return successors, (618), 554 states have call predecessors, (618), 574 states have call successors, (618) [2025-03-04 03:59:07,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 4073 transitions. [2025-03-04 03:59:07,112 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 4073 transitions. Word has length 39 [2025-03-04 03:59:07,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:07,112 INFO L471 AbstractCegarLoop]: Abstraction has 2983 states and 4073 transitions. [2025-03-04 03:59:07,113 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 4073 transitions. [2025-03-04 03:59:07,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 03:59:07,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:07,114 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:59:07,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 03:59:07,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:07,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:07,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1781560795, now seen corresponding path program 1 times [2025-03-04 03:59:07,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:07,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301494664] [2025-03-04 03:59:07,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:07,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:08,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 03:59:08,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 03:59:08,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:08,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:59:08,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:08,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301494664] [2025-03-04 03:59:08,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301494664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:08,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:08,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:08,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697042362] [2025-03-04 03:59:08,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:08,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:08,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:08,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:08,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:08,309 INFO L87 Difference]: Start difference. First operand 2983 states and 4073 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:08,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:08,513 INFO L93 Difference]: Finished difference Result 2985 states and 4074 transitions. [2025-03-04 03:59:08,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:08,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-04 03:59:08,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:08,531 INFO L225 Difference]: With dead ends: 2985 [2025-03-04 03:59:08,532 INFO L226 Difference]: Without dead ends: 2982 [2025-03-04 03:59:08,535 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:59:08,536 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 1007 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:08,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 1010 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:59:08,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2025-03-04 03:59:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2982. [2025-03-04 03:59:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2982 states, 2208 states have (on average 1.3025362318840579) internal successors, (2876), 2266 states have internal predecessors, (2876), 577 states have call successors, (577), 197 states have call predecessors, (577), 196 states have return successors, (618), 554 states have call predecessors, (618), 574 states have call successors, (618) [2025-03-04 03:59:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 4071 transitions. [2025-03-04 03:59:08,719 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 4071 transitions. Word has length 40 [2025-03-04 03:59:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:08,720 INFO L471 AbstractCegarLoop]: Abstraction has 2982 states and 4071 transitions. [2025-03-04 03:59:08,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 4071 transitions. [2025-03-04 03:59:08,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 03:59:08,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:08,723 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:59:08,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 03:59:08,723 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:08,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:08,724 INFO L85 PathProgramCache]: Analyzing trace with hash 605508218, now seen corresponding path program 1 times [2025-03-04 03:59:08,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:08,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528539092] [2025-03-04 03:59:08,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:08,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:09,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 03:59:09,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 03:59:09,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:09,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:59:09,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:09,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528539092] [2025-03-04 03:59:09,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528539092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:09,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:09,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:09,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290381381] [2025-03-04 03:59:09,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:09,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:09,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:09,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:09,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:09,968 INFO L87 Difference]: Start difference. First operand 2982 states and 4071 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:10,170 INFO L93 Difference]: Finished difference Result 2984 states and 4072 transitions. [2025-03-04 03:59:10,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:10,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-03-04 03:59:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:10,187 INFO L225 Difference]: With dead ends: 2984 [2025-03-04 03:59:10,187 INFO L226 Difference]: Without dead ends: 2981 [2025-03-04 03:59:10,190 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:59:10,191 INFO L435 NwaCegarLoop]: 1008 mSDtfsCounter, 1004 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:10,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 1008 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:59:10,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2025-03-04 03:59:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2981. [2025-03-04 03:59:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2981 states, 2208 states have (on average 1.3020833333333333) internal successors, (2875), 2265 states have internal predecessors, (2875), 576 states have call successors, (576), 197 states have call predecessors, (576), 196 states have return successors, (618), 554 states have call predecessors, (618), 574 states have call successors, (618) [2025-03-04 03:59:10,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2981 states to 2981 states and 4069 transitions. [2025-03-04 03:59:10,357 INFO L78 Accepts]: Start accepts. Automaton has 2981 states and 4069 transitions. Word has length 41 [2025-03-04 03:59:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:10,357 INFO L471 AbstractCegarLoop]: Abstraction has 2981 states and 4069 transitions. [2025-03-04 03:59:10,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2981 states and 4069 transitions. [2025-03-04 03:59:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 03:59:10,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:10,362 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:59:10,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 03:59:10,363 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:10,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:10,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1590202566, now seen corresponding path program 1 times [2025-03-04 03:59:10,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:10,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262504235] [2025-03-04 03:59:10,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:10,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:11,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 03:59:11,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 03:59:11,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:11,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:59:11,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:11,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262504235] [2025-03-04 03:59:11,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262504235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:11,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:11,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:11,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283144533] [2025-03-04 03:59:11,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:11,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:11,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:11,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:11,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:11,575 INFO L87 Difference]: Start difference. First operand 2981 states and 4069 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:11,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:11,748 INFO L93 Difference]: Finished difference Result 2983 states and 4070 transitions. [2025-03-04 03:59:11,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:11,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-03-04 03:59:11,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:11,761 INFO L225 Difference]: With dead ends: 2983 [2025-03-04 03:59:11,762 INFO L226 Difference]: Without dead ends: 2971 [2025-03-04 03:59:11,763 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:59:11,764 INFO L435 NwaCegarLoop]: 1007 mSDtfsCounter, 1001 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:11,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 1007 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:59:11,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2025-03-04 03:59:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2971. [2025-03-04 03:59:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2971 states, 2199 states have (on average 1.3015006821282402) internal successors, (2862), 2255 states have internal predecessors, (2862), 575 states have call successors, (575), 197 states have call predecessors, (575), 196 states have return successors, (618), 554 states have call predecessors, (618), 574 states have call successors, (618) [2025-03-04 03:59:11,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 4055 transitions. [2025-03-04 03:59:11,909 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 4055 transitions. Word has length 42 [2025-03-04 03:59:11,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:11,910 INFO L471 AbstractCegarLoop]: Abstraction has 2971 states and 4055 transitions. [2025-03-04 03:59:11,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:11,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 4055 transitions. [2025-03-04 03:59:11,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 03:59:11,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:11,918 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:59:11,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 03:59:11,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:11,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:11,919 INFO L85 PathProgramCache]: Analyzing trace with hash -280583650, now seen corresponding path program 1 times [2025-03-04 03:59:11,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:11,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612209495] [2025-03-04 03:59:11,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:11,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:13,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 03:59:13,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 03:59:13,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:13,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:13,204 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:59:13,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:13,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612209495] [2025-03-04 03:59:13,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612209495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:13,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:13,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:13,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6077573] [2025-03-04 03:59:13,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:13,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:13,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:13,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:13,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:13,206 INFO L87 Difference]: Start difference. First operand 2971 states and 4055 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:59:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:13,666 INFO L93 Difference]: Finished difference Result 6764 states and 9132 transitions. [2025-03-04 03:59:13,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:13,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2025-03-04 03:59:13,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:13,687 INFO L225 Difference]: With dead ends: 6764 [2025-03-04 03:59:13,687 INFO L226 Difference]: Without dead ends: 3800 [2025-03-04 03:59:13,697 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:59:13,699 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 272 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 2028 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:13,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 2028 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 03:59:13,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states. [2025-03-04 03:59:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 3792. [2025-03-04 03:59:13,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3792 states, 2804 states have (on average 1.2838801711840229) internal successors, (3600), 2868 states have internal predecessors, (3600), 712 states have call successors, (712), 276 states have call predecessors, (712), 275 states have return successors, (763), 691 states have call predecessors, (763), 711 states have call successors, (763) [2025-03-04 03:59:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 5075 transitions. [2025-03-04 03:59:13,906 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 5075 transitions. Word has length 90 [2025-03-04 03:59:13,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:13,906 INFO L471 AbstractCegarLoop]: Abstraction has 3792 states and 5075 transitions. [2025-03-04 03:59:13,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:59:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 5075 transitions. [2025-03-04 03:59:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 03:59:13,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:13,913 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:59:13,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 03:59:13,914 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:13,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:13,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1541481363, now seen corresponding path program 1 times [2025-03-04 03:59:13,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:13,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504588965] [2025-03-04 03:59:13,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:13,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:14,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 03:59:14,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 03:59:14,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:14,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 03:59:15,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:15,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504588965] [2025-03-04 03:59:15,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504588965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:15,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:15,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:15,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611206418] [2025-03-04 03:59:15,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:15,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:15,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:15,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:15,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:15,155 INFO L87 Difference]: Start difference. First operand 3792 states and 5075 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 03:59:19,174 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:59:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:19,815 INFO L93 Difference]: Finished difference Result 8440 states and 11244 transitions. [2025-03-04 03:59:19,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:19,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 106 [2025-03-04 03:59:19,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:19,837 INFO L225 Difference]: With dead ends: 8440 [2025-03-04 03:59:19,837 INFO L226 Difference]: Without dead ends: 4662 [2025-03-04 03:59:19,846 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:59:19,847 INFO L435 NwaCegarLoop]: 1261 mSDtfsCounter, 280 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:19,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 2238 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-04 03:59:19,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4662 states. [2025-03-04 03:59:19,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4662 to 4654. [2025-03-04 03:59:20,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4654 states, 3452 states have (on average 1.2746234067207416) internal successors, (4400), 3524 states have internal predecessors, (4400), 848 states have call successors, (848), 354 states have call predecessors, (848), 353 states have return successors, (907), 827 states have call predecessors, (907), 847 states have call successors, (907) [2025-03-04 03:59:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4654 states to 4654 states and 6155 transitions. [2025-03-04 03:59:20,018 INFO L78 Accepts]: Start accepts. Automaton has 4654 states and 6155 transitions. Word has length 106 [2025-03-04 03:59:20,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:20,019 INFO L471 AbstractCegarLoop]: Abstraction has 4654 states and 6155 transitions. [2025-03-04 03:59:20,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 03:59:20,019 INFO L276 IsEmpty]: Start isEmpty. Operand 4654 states and 6155 transitions. [2025-03-04 03:59:20,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 03:59:20,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:20,026 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2025-03-04 03:59:20,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 03:59:20,026 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:20,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:20,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1467872403, now seen corresponding path program 1 times [2025-03-04 03:59:20,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:20,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638303002] [2025-03-04 03:59:20,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:20,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:20,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 03:59:21,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 03:59:21,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:21,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:21,188 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 03:59:21,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:21,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638303002] [2025-03-04 03:59:21,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638303002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:21,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:21,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:21,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138224068] [2025-03-04 03:59:21,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:21,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:21,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:21,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:21,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:21,190 INFO L87 Difference]: Start difference. First operand 4654 states and 6155 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 03:59:25,208 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:59:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:25,834 INFO L93 Difference]: Finished difference Result 11336 states and 14962 transitions. [2025-03-04 03:59:25,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:25,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 118 [2025-03-04 03:59:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:25,879 INFO L225 Difference]: With dead ends: 11336 [2025-03-04 03:59:25,880 INFO L226 Difference]: Without dead ends: 6696 [2025-03-04 03:59:25,895 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:59:25,897 INFO L435 NwaCegarLoop]: 1243 mSDtfsCounter, 812 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:25,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 2080 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-04 03:59:25,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6696 states. [2025-03-04 03:59:26,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6696 to 6688. [2025-03-04 03:59:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6688 states, 5000 states have (on average 1.2808) internal successors, (6404), 5120 states have internal predecessors, (6404), 1152 states have call successors, (1152), 536 states have call predecessors, (1152), 535 states have return successors, (1237), 1115 states have call predecessors, (1237), 1151 states have call successors, (1237) [2025-03-04 03:59:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6688 states to 6688 states and 8793 transitions. [2025-03-04 03:59:26,290 INFO L78 Accepts]: Start accepts. Automaton has 6688 states and 8793 transitions. Word has length 118 [2025-03-04 03:59:26,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:26,292 INFO L471 AbstractCegarLoop]: Abstraction has 6688 states and 8793 transitions. [2025-03-04 03:59:26,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 03:59:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 6688 states and 8793 transitions. [2025-03-04 03:59:26,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 03:59:26,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:26,297 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:59:26,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 03:59:26,298 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:26,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:26,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1457878184, now seen corresponding path program 1 times [2025-03-04 03:59:26,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:26,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884136080] [2025-03-04 03:59:26,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:26,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:27,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 03:59:27,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 03:59:27,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:27,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:27,378 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 03:59:27,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:27,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884136080] [2025-03-04 03:59:27,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884136080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:27,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:27,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:27,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638133677] [2025-03-04 03:59:27,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:27,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:27,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:27,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:27,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:27,379 INFO L87 Difference]: Start difference. First operand 6688 states and 8793 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 03:59:27,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:27,946 INFO L93 Difference]: Finished difference Result 17752 states and 23435 transitions. [2025-03-04 03:59:27,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:27,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2025-03-04 03:59:27,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:27,991 INFO L225 Difference]: With dead ends: 17752 [2025-03-04 03:59:27,991 INFO L226 Difference]: Without dead ends: 11078 [2025-03-04 03:59:28,012 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:59:28,013 INFO L435 NwaCegarLoop]: 1245 mSDtfsCounter, 883 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 2227 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:28,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 2227 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 03:59:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11078 states. [2025-03-04 03:59:28,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11078 to 11056. [2025-03-04 03:59:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11056 states, 8323 states have (on average 1.2955665024630543) internal successors, (10783), 8531 states have internal predecessors, (10783), 1848 states have call successors, (1848), 885 states have call predecessors, (1848), 884 states have return successors, (1991), 1775 states have call predecessors, (1991), 1847 states have call successors, (1991) [2025-03-04 03:59:28,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11056 states to 11056 states and 14622 transitions. [2025-03-04 03:59:28,456 INFO L78 Accepts]: Start accepts. Automaton has 11056 states and 14622 transitions. Word has length 123 [2025-03-04 03:59:28,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:28,456 INFO L471 AbstractCegarLoop]: Abstraction has 11056 states and 14622 transitions. [2025-03-04 03:59:28,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 03:59:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 11056 states and 14622 transitions. [2025-03-04 03:59:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 03:59:28,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:28,464 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 03:59:28,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 03:59:28,465 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:28,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:28,465 INFO L85 PathProgramCache]: Analyzing trace with hash -660847887, now seen corresponding path program 1 times [2025-03-04 03:59:28,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:28,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416393783] [2025-03-04 03:59:28,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:28,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:29,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 03:59:29,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 03:59:29,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:29,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 03:59:29,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:29,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416393783] [2025-03-04 03:59:29,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416393783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:29,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:29,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:29,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124519305] [2025-03-04 03:59:29,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:29,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:29,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:29,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:29,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:29,596 INFO L87 Difference]: Start difference. First operand 11056 states and 14622 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 03:59:30,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:30,218 INFO L93 Difference]: Finished difference Result 22126 states and 29272 transitions. [2025-03-04 03:59:30,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:30,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2025-03-04 03:59:30,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:30,264 INFO L225 Difference]: With dead ends: 22126 [2025-03-04 03:59:30,265 INFO L226 Difference]: Without dead ends: 11088 [2025-03-04 03:59:30,293 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:59:30,294 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 1 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:30,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1998 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 03:59:30,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11088 states. [2025-03-04 03:59:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11088 to 11072. [2025-03-04 03:59:30,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11072 states, 8339 states have (on average 1.2949994004077228) internal successors, (10799), 8547 states have internal predecessors, (10799), 1848 states have call successors, (1848), 885 states have call predecessors, (1848), 884 states have return successors, (1991), 1775 states have call predecessors, (1991), 1847 states have call successors, (1991) [2025-03-04 03:59:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11072 states to 11072 states and 14638 transitions. [2025-03-04 03:59:30,899 INFO L78 Accepts]: Start accepts. Automaton has 11072 states and 14638 transitions. Word has length 139 [2025-03-04 03:59:30,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:30,900 INFO L471 AbstractCegarLoop]: Abstraction has 11072 states and 14638 transitions. [2025-03-04 03:59:30,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 03:59:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 11072 states and 14638 transitions. [2025-03-04 03:59:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 03:59:30,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:30,909 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 03:59:30,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 03:59:30,910 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:30,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:30,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1285600974, now seen corresponding path program 1 times [2025-03-04 03:59:30,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:30,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964374923] [2025-03-04 03:59:30,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:30,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:31,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 03:59:31,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 03:59:31,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:31,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 03:59:32,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:32,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964374923] [2025-03-04 03:59:32,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964374923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:59:32,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986672808] [2025-03-04 03:59:32,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:32,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:59:32,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:59:32,081 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:59:32,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 03:59:33,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 03:59:33,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 03:59:33,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:33,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:33,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 2294 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:59:33,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:59:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 03:59:33,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:59:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 03:59:34,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986672808] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:59:34,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:59:34,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 03:59:34,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059574259] [2025-03-04 03:59:34,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:59:34,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:59:34,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:34,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:59:34,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:59:34,295 INFO L87 Difference]: Start difference. First operand 11072 states and 14638 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 03:59:34,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:34,976 INFO L93 Difference]: Finished difference Result 22222 states and 29400 transitions. [2025-03-04 03:59:34,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:59:34,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 141 [2025-03-04 03:59:34,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:35,032 INFO L225 Difference]: With dead ends: 22222 [2025-03-04 03:59:35,032 INFO L226 Difference]: Without dead ends: 11168 [2025-03-04 03:59:35,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:59:35,060 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 2 mSDsluCounter, 1994 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2995 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:35,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2995 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 03:59:35,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11168 states. [2025-03-04 03:59:35,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11168 to 11168. [2025-03-04 03:59:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11168 states, 8435 states have (on average 1.2916419679905158) internal successors, (10895), 8643 states have internal predecessors, (10895), 1848 states have call successors, (1848), 885 states have call predecessors, (1848), 884 states have return successors, (1991), 1775 states have call predecessors, (1991), 1847 states have call successors, (1991) [2025-03-04 03:59:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11168 states to 11168 states and 14734 transitions. [2025-03-04 03:59:35,501 INFO L78 Accepts]: Start accepts. Automaton has 11168 states and 14734 transitions. Word has length 141 [2025-03-04 03:59:35,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:35,502 INFO L471 AbstractCegarLoop]: Abstraction has 11168 states and 14734 transitions. [2025-03-04 03:59:35,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 03:59:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 11168 states and 14734 transitions. [2025-03-04 03:59:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 03:59:35,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:35,513 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2025-03-04 03:59:35,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 03:59:35,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 03:59:35,714 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:35,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:35,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2088255205, now seen corresponding path program 2 times [2025-03-04 03:59:35,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:35,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808388250] [2025-03-04 03:59:35,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:59:35,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:36,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes. [2025-03-04 03:59:37,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 03:59:37,037 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 03:59:37,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:37,441 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-04 03:59:37,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:37,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808388250] [2025-03-04 03:59:37,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808388250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:59:37,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976121238] [2025-03-04 03:59:37,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:59:37,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:59:37,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:59:37,444 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:59:37,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 03:59:39,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes.