./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--esd_usb2.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--esd_usb2.ko-entry_point.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 781669661afd0476205c0d0f127c7931dffbaabf4aae46244e576c29ee5a8115 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 06:21:58,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 06:21:58,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 06:21:58,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 06:21:58,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 06:21:58,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 06:21:58,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 06:21:58,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 06:21:58,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 06:21:58,881 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 06:21:58,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 06:21:58,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 06:21:58,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 06:21:58,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 06:21:58,883 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 06:21:58,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 06:21:58,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 06:21:58,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 06:21:58,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 06:21:58,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 06:21:58,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 06:21:58,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 06:21:58,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 06:21:58,883 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 06:21:58,884 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 06:21:58,884 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 06:21:58,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 06:21:58,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 06:21:58,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 06:21:58,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:21:58,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 06:21:58,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 06:21:58,885 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 06:21:58,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 06:21:58,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 06:21:58,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 06:21:58,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 06:21:58,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 06:21:58,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 06:21:58,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 06:21:58,885 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 781669661afd0476205c0d0f127c7931dffbaabf4aae46244e576c29ee5a8115 [2025-02-06 06:21:59,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 06:21:59,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 06:21:59,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 06:21:59,108 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 06:21:59,109 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 06:21:59,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--esd_usb2.ko-entry_point.cil.out.i [2025-02-06 06:22:00,256 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/051ba6041/d1cccbb69b484ba99339f564146daa10/FLAG7e5f4d9b7 [2025-02-06 06:22:00,656 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 06:22:00,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--esd_usb2.ko-entry_point.cil.out.i [2025-02-06 06:22:00,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/051ba6041/d1cccbb69b484ba99339f564146daa10/FLAG7e5f4d9b7 [2025-02-06 06:22:00,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/051ba6041/d1cccbb69b484ba99339f564146daa10 [2025-02-06 06:22:00,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 06:22:00,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 06:22:00,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 06:22:00,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 06:22:00,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 06:22:00,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:22:00" (1/1) ... [2025-02-06 06:22:00,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373f1443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:00, skipping insertion in model container [2025-02-06 06:22:00,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:22:00" (1/1) ... [2025-02-06 06:22:00,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 06:22:01,575 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--esd_usb2.ko-entry_point.cil.out.i[163937,163950] [2025-02-06 06:22:01,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:22:01,994 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 06:22:02,129 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"); [5448] [2025-02-06 06:22:02,132 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)); [5455] [2025-02-06 06:22:02,133 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"); [5463-5464] [2025-02-06 06:22:02,134 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)); [5493] [2025-02-06 06:22:02,136 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)); [5500] [2025-02-06 06:22:02,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--esd_usb2.ko-entry_point.cil.out.i[163937,163950] [2025-02-06 06:22:02,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:22:02,374 INFO L204 MainTranslator]: Completed translation [2025-02-06 06:22:02,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:02 WrapperNode [2025-02-06 06:22:02,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 06:22:02,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 06:22:02,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 06:22:02,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 06:22:02,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:02" (1/1) ... [2025-02-06 06:22:02,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:02" (1/1) ... [2025-02-06 06:22:02,523 INFO L138 Inliner]: procedures = 161, calls = 852, calls flagged for inlining = 73, calls inlined = 73, statements flattened = 2678 [2025-02-06 06:22:02,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 06:22:02,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 06:22:02,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 06:22:02,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 06:22:02,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:02" (1/1) ... [2025-02-06 06:22:02,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:02" (1/1) ... [2025-02-06 06:22:02,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:02" (1/1) ... [2025-02-06 06:22:02,772 INFO L175 MemorySlicer]: Split 518 memory accesses to 8 slices as follows [2, 9, 368, 48, 19, 19, 44, 9]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5, 0, 0, 0, 0, 0]. The 304 writes are split as follows [0, 0, 196, 48, 0, 11, 44, 5]. [2025-02-06 06:22:02,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:02" (1/1) ... [2025-02-06 06:22:02,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:02" (1/1) ... [2025-02-06 06:22:02,854 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:02" (1/1) ... [2025-02-06 06:22:02,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:02" (1/1) ... [2025-02-06 06:22:02,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:02" (1/1) ... [2025-02-06 06:22:02,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:02" (1/1) ... [2025-02-06 06:22:02,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 06:22:02,900 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 06:22:02,900 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 06:22:02,900 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 06:22:02,901 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:02" (1/1) ... [2025-02-06 06:22:02,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:22:02,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:22:02,926 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 06:22:02,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 06:22:02,946 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2025-02-06 06:22:02,947 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2025-02-06 06:22:02,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_2 [2025-02-06 06:22:02,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_2 [2025-02-06 06:22:02,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_17 [2025-02-06 06:22:02,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_17 [2025-02-06 06:22:02,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 06:22:02,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 06:22:02,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 06:22:02,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 06:22:02,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 06:22:02,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 06:22:02,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 06:22:02,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 06:22:02,948 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2025-02-06 06:22:02,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2025-02-06 06:22:02,948 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2025-02-06 06:22:02,948 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2025-02-06 06:22:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 06:22:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 06:22:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 06:22:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 06:22:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 06:22:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 06:22:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 06:22:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-02-06 06:22:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure can_free_echo_skb [2025-02-06 06:22:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure can_free_echo_skb [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_present [2025-02-06 06:22:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_present [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2025-02-06 06:22:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2025-02-06 06:22:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-02-06 06:22:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 06:22:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2025-02-06 06:22:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2025-02-06 06:22:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2025-02-06 06:22:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 06:22:02,951 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2025-02-06 06:22:02,951 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-02-06 06:22:02,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2025-02-06 06:22:02,951 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-02-06 06:22:02,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 06:22:02,951 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-02-06 06:22:02,951 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_err [2025-02-06 06:22:02,951 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_err [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2025-02-06 06:22:02,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_4 [2025-02-06 06:22:02,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_4 [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-02-06 06:22:02,951 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-02-06 06:22:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-02-06 06:22:02,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-02-06 06:22:02,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 06:22:02,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 06:22:02,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 06:22:02,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 06:22:02,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 06:22:02,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 06:22:02,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 06:22:02,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 06:22:02,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 06:22:02,952 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 06:22:02,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 06:22:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-02-06 06:22:02,955 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-02-06 06:22:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2025-02-06 06:22:02,955 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2025-02-06 06:22:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 06:22:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 06:22:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 06:22:02,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 06:22:02,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 06:22:02,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 06:22:02,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 06:22:02,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 06:22:02,956 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2025-02-06 06:22:02,956 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2025-02-06 06:22:02,956 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2025-02-06 06:22:02,956 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2025-02-06 06:22:02,956 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2025-02-06 06:22:02,956 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2025-02-06 06:22:02,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 06:22:02,956 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-02-06 06:22:02,956 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-02-06 06:22:02,956 INFO L130 BoogieDeclarations]: Found specification of procedure esd_usb2_read_bulk_callback [2025-02-06 06:22:02,956 INFO L138 BoogieDeclarations]: Found implementation of procedure esd_usb2_read_bulk_callback [2025-02-06 06:22:02,956 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-02-06 06:22:02,957 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_warn [2025-02-06 06:22:02,957 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_warn [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure esd_usb2_send_msg [2025-02-06 06:22:02,957 INFO L138 BoogieDeclarations]: Found implementation of procedure esd_usb2_send_msg [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2025-02-06 06:22:02,957 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-02-06 06:22:02,957 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-02-06 06:22:02,957 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2025-02-06 06:22:02,957 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-02-06 06:22:02,957 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2025-02-06 06:22:02,957 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2025-02-06 06:22:02,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2025-02-06 06:22:02,957 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2025-02-06 06:22:02,957 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2025-02-06 06:22:02,957 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-02-06 06:22:02,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2025-02-06 06:22:02,957 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2025-02-06 06:22:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure esd_usb2_disconnect [2025-02-06 06:22:02,957 INFO L138 BoogieDeclarations]: Found implementation of procedure esd_usb2_disconnect [2025-02-06 06:22:02,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 06:22:02,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 06:22:03,338 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 06:22:03,341 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 06:22:03,413 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7711: havoc #t~nondet528; [2025-02-06 06:22:03,415 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 06:22:03,452 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5471: havoc constant_test_bit_#t~mem1#1;havoc constant_test_bit_#t~bitwise2#1; [2025-02-06 06:22:03,496 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7686: havoc netpoll_trap_#t~nondet523#1; [2025-02-06 06:22:03,514 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5581: havoc #t~mem48;havoc #t~bitwise49; [2025-02-06 06:22:03,574 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5541: 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-02-06 06:22:03,580 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7643: havoc #t~nondet516; [2025-02-06 06:22:03,604 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7694: havoc printk_#t~nondet525#1; [2025-02-06 06:22:03,608 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7667: havoc #t~nondet519; [2025-02-06 06:22:03,609 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2025-02-06 06:22:03,655 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7704: havoc #t~ret527.base, #t~ret527.offset; [2025-02-06 06:22:03,659 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7682: havoc #t~nondet522; [2025-02-06 06:22:03,988 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5883: call ULTIMATE.dealloc(esd_usb2_rx_event_~#cf~0#1.base, esd_usb2_rx_event_~#cf~0#1.offset);havoc esd_usb2_rx_event_~#cf~0#1.base, esd_usb2_rx_event_~#cf~0#1.offset; [2025-02-06 06:22:03,988 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7603: havoc _dev_info_#t~nondet509#1; [2025-02-06 06:22:03,988 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5969: call ULTIMATE.dealloc(esd_usb2_rx_can_msg_~#cf~1#1.base, esd_usb2_rx_can_msg_~#cf~1#1.offset);havoc esd_usb2_rx_can_msg_~#cf~1#1.base, esd_usb2_rx_can_msg_~#cf~1#1.offset; [2025-02-06 06:22:03,988 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7622: havoc can_get_echo_skb_#t~nondet513#1; [2025-02-06 06:22:03,989 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7606: havoc alloc_can_err_skb_#t~ret510#1.base, alloc_can_err_skb_#t~ret510#1.offset; [2025-02-06 06:22:03,989 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7609: havoc alloc_can_skb_#t~ret511#1.base, alloc_can_skb_#t~ret511#1.offset; [2025-02-06 06:22:03,993 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7635: havoc #t~nondet514; [2025-02-06 06:22:03,999 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7675: havoc #t~nondet521; [2025-02-06 06:22:04,009 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6255: call ULTIMATE.dealloc(~#actual_length~0.base, ~#actual_length~0.offset);havoc ~#actual_length~0.base, ~#actual_length~0.offset; [2025-02-06 06:22:04,017 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5595: havoc __kmalloc_#t~ret52#1.base, __kmalloc_#t~ret52#1.offset; [2025-02-06 06:22:04,023 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5719: havoc #t~mem64.base, #t~mem64.offset; [2025-02-06 06:22:04,025 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7671: havoc #t~nondet520; [2025-02-06 06:22:04,033 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7639: havoc #t~nondet515; [2025-02-06 06:22:11,816 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7612: havoc alloc_candev_#t~ret512#1.base, alloc_candev_#t~ret512#1.offset; [2025-02-06 06:22:11,816 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6267: call ULTIMATE.dealloc(esd_usb2_wait_msg_~#actual_length~1#1.base, esd_usb2_wait_msg_~#actual_length~1#1.offset);havoc esd_usb2_wait_msg_~#actual_length~1#1.base, esd_usb2_wait_msg_~#actual_length~1#1.offset; [2025-02-06 06:22:11,816 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7690: havoc open_candev_#t~nondet524#1; [2025-02-06 06:22:11,816 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7724: havoc usb_register_driver_#t~nondet529#1; [2025-02-06 06:22:11,816 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7659: havoc ldv_ndo_init_2_#t~nondet517#1; [2025-02-06 06:22:11,816 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5480: havoc atomic_read_#t~mem8#1; [2025-02-06 06:22:11,816 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7663: havoc ldv_ndo_uninit_2_#t~nondet518#1; [2025-02-06 06:22:11,816 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7698: havoc register_candev_#t~nondet526#1; [2025-02-06 06:22:11,987 INFO L? ?]: Removed 1045 outVars from TransFormulas that were not future-live. [2025-02-06 06:22:11,987 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 06:22:12,023 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 06:22:12,023 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 06:22:12,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:22:12 BoogieIcfgContainer [2025-02-06 06:22:12,024 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 06:22:12,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 06:22:12,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 06:22:12,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 06:22:12,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:22:00" (1/3) ... [2025-02-06 06:22:12,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfe254f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:22:12, skipping insertion in model container [2025-02-06 06:22:12,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:02" (2/3) ... [2025-02-06 06:22:12,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfe254f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:22:12, skipping insertion in model container [2025-02-06 06:22:12,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:22:12" (3/3) ... [2025-02-06 06:22:12,035 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--esd_usb2.ko-entry_point.cil.out.i [2025-02-06 06:22:12,048 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 06:22:12,051 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--esd_usb2.ko-entry_point.cil.out.i that has 52 procedures, 847 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-06 06:22:12,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 06:22:12,111 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;@55b5632a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 06:22:12,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 06:22:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 852 states, 627 states have (on average 1.3572567783094098) internal successors, (851), 662 states have internal predecessors, (851), 167 states have call successors, (167), 51 states have call predecessors, (167), 49 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-02-06 06:22:12,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 06:22:12,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:12,129 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:22:12,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:12,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:12,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1653596225, now seen corresponding path program 1 times [2025-02-06 06:22:12,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:12,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61665775] [2025-02-06 06:22:12,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:12,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:14,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 06:22:14,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 06:22:14,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:14,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 06:22:15,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:15,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61665775] [2025-02-06 06:22:15,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61665775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:15,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:15,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:15,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852526315] [2025-02-06 06:22:15,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:15,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:15,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:15,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:15,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:15,154 INFO L87 Difference]: Start difference. First operand has 852 states, 627 states have (on average 1.3572567783094098) internal successors, (851), 662 states have internal predecessors, (851), 167 states have call successors, (167), 51 states have call predecessors, (167), 49 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 06:22:19,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:22:20,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:20,345 INFO L93 Difference]: Finished difference Result 2493 states and 3505 transitions. [2025-02-06 06:22:20,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:20,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 83 [2025-02-06 06:22:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:20,362 INFO L225 Difference]: With dead ends: 2493 [2025-02-06 06:22:20,362 INFO L226 Difference]: Without dead ends: 1539 [2025-02-06 06:22:20,368 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-02-06 06:22:20,370 INFO L435 NwaCegarLoop]: 1135 mSDtfsCounter, 1078 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:20,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 2243 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2025-02-06 06:22:20,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2025-02-06 06:22:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1539. [2025-02-06 06:22:20,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1144 states have (on average 1.2980769230769231) internal successors, (1485), 1174 states have internal predecessors, (1485), 298 states have call successors, (298), 97 states have call predecessors, (298), 96 states have return successors, (293), 289 states have call predecessors, (293), 293 states have call successors, (293) [2025-02-06 06:22:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2076 transitions. [2025-02-06 06:22:20,508 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2076 transitions. Word has length 83 [2025-02-06 06:22:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:20,508 INFO L471 AbstractCegarLoop]: Abstraction has 1539 states and 2076 transitions. [2025-02-06 06:22:20,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 06:22:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2076 transitions. [2025-02-06 06:22:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-06 06:22:20,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:20,515 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:22:20,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 06:22:20,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:20,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:20,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1170013553, now seen corresponding path program 1 times [2025-02-06 06:22:20,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:20,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764627191] [2025-02-06 06:22:20,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:20,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:22,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 06:22:22,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 06:22:22,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:22,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 06:22:23,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:23,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764627191] [2025-02-06 06:22:23,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764627191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:23,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:23,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:23,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987466407] [2025-02-06 06:22:23,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:23,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:23,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:23,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:23,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:23,467 INFO L87 Difference]: Start difference. First operand 1539 states and 2076 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 06:22:24,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:24,354 INFO L93 Difference]: Finished difference Result 4566 states and 6171 transitions. [2025-02-06 06:22:24,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:24,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 93 [2025-02-06 06:22:24,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:24,374 INFO L225 Difference]: With dead ends: 4566 [2025-02-06 06:22:24,375 INFO L226 Difference]: Without dead ends: 3052 [2025-02-06 06:22:24,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:24,381 INFO L435 NwaCegarLoop]: 1440 mSDtfsCounter, 1027 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:24,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 2446 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 06:22:24,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2025-02-06 06:22:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 3042. [2025-02-06 06:22:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3042 states, 2269 states have (on average 1.2979286029087704) internal successors, (2945), 2325 states have internal predecessors, (2945), 580 states have call successors, (580), 193 states have call predecessors, (580), 192 states have return successors, (585), 567 states have call predecessors, (585), 575 states have call successors, (585) [2025-02-06 06:22:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 4110 transitions. [2025-02-06 06:22:24,516 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 4110 transitions. Word has length 93 [2025-02-06 06:22:24,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:24,518 INFO L471 AbstractCegarLoop]: Abstraction has 3042 states and 4110 transitions. [2025-02-06 06:22:24,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 06:22:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 4110 transitions. [2025-02-06 06:22:24,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 06:22:24,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:24,523 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:22:24,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 06:22:24,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:24,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:24,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1911496643, now seen corresponding path program 1 times [2025-02-06 06:22:24,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:24,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333740881] [2025-02-06 06:22:24,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:24,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:26,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 06:22:26,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 06:22:26,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:26,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:27,334 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 06:22:27,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:27,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333740881] [2025-02-06 06:22:27,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333740881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:27,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:27,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:27,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185296004] [2025-02-06 06:22:27,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:27,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:27,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:27,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:27,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:27,338 INFO L87 Difference]: Start difference. First operand 3042 states and 4110 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 06:22:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:27,636 INFO L93 Difference]: Finished difference Result 3044 states and 4111 transitions. [2025-02-06 06:22:27,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:27,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 94 [2025-02-06 06:22:27,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:27,654 INFO L225 Difference]: With dead ends: 3044 [2025-02-06 06:22:27,655 INFO L226 Difference]: Without dead ends: 3041 [2025-02-06 06:22:27,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:27,660 INFO L435 NwaCegarLoop]: 1051 mSDtfsCounter, 1028 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:27,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 1051 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:22:27,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3041 states. [2025-02-06 06:22:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3041 to 3041. [2025-02-06 06:22:27,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 2269 states have (on average 1.2974878801234024) internal successors, (2944), 2324 states have internal predecessors, (2944), 579 states have call successors, (579), 193 states have call predecessors, (579), 192 states have return successors, (585), 567 states have call predecessors, (585), 575 states have call successors, (585) [2025-02-06 06:22:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4108 transitions. [2025-02-06 06:22:27,797 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4108 transitions. Word has length 94 [2025-02-06 06:22:27,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:27,798 INFO L471 AbstractCegarLoop]: Abstraction has 3041 states and 4108 transitions. [2025-02-06 06:22:27,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 06:22:27,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4108 transitions. [2025-02-06 06:22:27,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 06:22:27,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:27,802 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:22:27,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 06:22:27,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:27,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:27,802 INFO L85 PathProgramCache]: Analyzing trace with hash 872330320, now seen corresponding path program 1 times [2025-02-06 06:22:27,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:27,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646649906] [2025-02-06 06:22:27,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:27,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:29,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 06:22:29,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 06:22:29,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:29,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 06:22:30,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:30,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646649906] [2025-02-06 06:22:30,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646649906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:30,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:30,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:30,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426994398] [2025-02-06 06:22:30,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:30,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:30,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:30,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:30,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:30,060 INFO L87 Difference]: Start difference. First operand 3041 states and 4108 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 06:22:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:30,395 INFO L93 Difference]: Finished difference Result 3043 states and 4109 transitions. [2025-02-06 06:22:30,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:30,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2025-02-06 06:22:30,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:30,412 INFO L225 Difference]: With dead ends: 3043 [2025-02-06 06:22:30,412 INFO L226 Difference]: Without dead ends: 3040 [2025-02-06 06:22:30,415 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-02-06 06:22:30,417 INFO L435 NwaCegarLoop]: 1049 mSDtfsCounter, 1025 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:30,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 1049 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:22:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3040 states. [2025-02-06 06:22:30,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3040 to 3040. [2025-02-06 06:22:30,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3040 states, 2269 states have (on average 1.2970471573380344) internal successors, (2943), 2323 states have internal predecessors, (2943), 578 states have call successors, (578), 193 states have call predecessors, (578), 192 states have return successors, (585), 567 states have call predecessors, (585), 575 states have call successors, (585) [2025-02-06 06:22:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 3040 states and 4106 transitions. [2025-02-06 06:22:30,578 INFO L78 Accepts]: Start accepts. Automaton has 3040 states and 4106 transitions. Word has length 95 [2025-02-06 06:22:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:30,579 INFO L471 AbstractCegarLoop]: Abstraction has 3040 states and 4106 transitions. [2025-02-06 06:22:30,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 06:22:30,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3040 states and 4106 transitions. [2025-02-06 06:22:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 06:22:30,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:30,581 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:22:30,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 06:22:30,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:30,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1271619230, now seen corresponding path program 1 times [2025-02-06 06:22:30,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:30,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610499424] [2025-02-06 06:22:30,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:32,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 06:22:32,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 06:22:32,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:32,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 06:22:32,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:32,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610499424] [2025-02-06 06:22:32,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610499424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:32,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:32,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:32,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932378968] [2025-02-06 06:22:32,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:32,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:32,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:32,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:32,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:32,778 INFO L87 Difference]: Start difference. First operand 3040 states and 4106 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 06:22:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:33,086 INFO L93 Difference]: Finished difference Result 3042 states and 4107 transitions. [2025-02-06 06:22:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:33,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 96 [2025-02-06 06:22:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:33,101 INFO L225 Difference]: With dead ends: 3042 [2025-02-06 06:22:33,102 INFO L226 Difference]: Without dead ends: 3039 [2025-02-06 06:22:33,105 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-02-06 06:22:33,105 INFO L435 NwaCegarLoop]: 1047 mSDtfsCounter, 1022 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:33,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 1047 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:22:33,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3039 states. [2025-02-06 06:22:33,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3039 to 3039. [2025-02-06 06:22:33,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3039 states, 2269 states have (on average 1.2966064345526664) internal successors, (2942), 2322 states have internal predecessors, (2942), 577 states have call successors, (577), 193 states have call predecessors, (577), 192 states have return successors, (585), 567 states have call predecessors, (585), 575 states have call successors, (585) [2025-02-06 06:22:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3039 states to 3039 states and 4104 transitions. [2025-02-06 06:22:33,226 INFO L78 Accepts]: Start accepts. Automaton has 3039 states and 4104 transitions. Word has length 96 [2025-02-06 06:22:33,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:33,227 INFO L471 AbstractCegarLoop]: Abstraction has 3039 states and 4104 transitions. [2025-02-06 06:22:33,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 06:22:33,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 4104 transitions. [2025-02-06 06:22:33,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 06:22:33,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:33,231 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:22:33,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 06:22:33,231 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:33,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:33,232 INFO L85 PathProgramCache]: Analyzing trace with hash 764672529, now seen corresponding path program 1 times [2025-02-06 06:22:33,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:33,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177142779] [2025-02-06 06:22:33,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:33,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:35,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 06:22:35,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 06:22:35,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:35,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:35,630 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 06:22:35,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:35,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177142779] [2025-02-06 06:22:35,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177142779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:35,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:35,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:35,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051355886] [2025-02-06 06:22:35,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:35,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:35,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:35,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:35,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:35,632 INFO L87 Difference]: Start difference. First operand 3039 states and 4104 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 06:22:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:35,893 INFO L93 Difference]: Finished difference Result 3041 states and 4105 transitions. [2025-02-06 06:22:35,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:35,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 97 [2025-02-06 06:22:35,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:35,905 INFO L225 Difference]: With dead ends: 3041 [2025-02-06 06:22:35,905 INFO L226 Difference]: Without dead ends: 3029 [2025-02-06 06:22:35,906 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-02-06 06:22:35,907 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 1019 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:35,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 1046 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:22:35,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2025-02-06 06:22:36,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 3029. [2025-02-06 06:22:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3029 states, 2260 states have (on average 1.2960176991150443) internal successors, (2929), 2312 states have internal predecessors, (2929), 576 states have call successors, (576), 193 states have call predecessors, (576), 192 states have return successors, (585), 567 states have call predecessors, (585), 575 states have call successors, (585) [2025-02-06 06:22:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 4090 transitions. [2025-02-06 06:22:36,043 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 4090 transitions. Word has length 97 [2025-02-06 06:22:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:36,043 INFO L471 AbstractCegarLoop]: Abstraction has 3029 states and 4090 transitions. [2025-02-06 06:22:36,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 06:22:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 4090 transitions. [2025-02-06 06:22:36,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 06:22:36,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:36,051 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:22:36,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 06:22:36,052 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:36,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:36,052 INFO L85 PathProgramCache]: Analyzing trace with hash 576247103, now seen corresponding path program 1 times [2025-02-06 06:22:36,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:36,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628171320] [2025-02-06 06:22:36,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:36,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:37,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 06:22:37,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 06:22:37,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:37,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:38,125 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 06:22:38,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:38,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628171320] [2025-02-06 06:22:38,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628171320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:38,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:38,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:38,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340415797] [2025-02-06 06:22:38,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:38,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:38,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:38,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:38,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:38,127 INFO L87 Difference]: Start difference. First operand 3029 states and 4090 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:22:38,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:38,821 INFO L93 Difference]: Finished difference Result 6311 states and 8498 transitions. [2025-02-06 06:22:38,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:38,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-02-06 06:22:38,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:38,835 INFO L225 Difference]: With dead ends: 6311 [2025-02-06 06:22:38,836 INFO L226 Difference]: Without dead ends: 3306 [2025-02-06 06:22:38,843 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-02-06 06:22:38,845 INFO L435 NwaCegarLoop]: 1067 mSDtfsCounter, 369 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 2056 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:38,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 2056 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 06:22:38,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3306 states. [2025-02-06 06:22:38,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3306 to 3306. [2025-02-06 06:22:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3306 states, 2468 states have (on average 1.2913290113452187) internal successors, (3187), 2522 states have internal predecessors, (3187), 623 states have call successors, (623), 215 states have call predecessors, (623), 214 states have return successors, (632), 614 states have call predecessors, (632), 622 states have call successors, (632) [2025-02-06 06:22:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4442 transitions. [2025-02-06 06:22:38,960 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4442 transitions. Word has length 147 [2025-02-06 06:22:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:38,960 INFO L471 AbstractCegarLoop]: Abstraction has 3306 states and 4442 transitions. [2025-02-06 06:22:38,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:22:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4442 transitions. [2025-02-06 06:22:38,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 06:22:38,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:38,964 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:22:38,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 06:22:38,965 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:38,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:38,965 INFO L85 PathProgramCache]: Analyzing trace with hash 696048637, now seen corresponding path program 1 times [2025-02-06 06:22:38,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:38,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785296311] [2025-02-06 06:22:38,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:38,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:40,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 06:22:40,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 06:22:40,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:40,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 06:22:40,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:40,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785296311] [2025-02-06 06:22:40,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785296311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:40,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:40,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:40,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032500995] [2025-02-06 06:22:40,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:40,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:40,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:40,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:40,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:40,994 INFO L87 Difference]: Start difference. First operand 3306 states and 4442 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 06:22:45,021 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-02-06 06:22:46,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:46,302 INFO L93 Difference]: Finished difference Result 7404 states and 9931 transitions. [2025-02-06 06:22:46,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:46,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 164 [2025-02-06 06:22:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:46,330 INFO L225 Difference]: With dead ends: 7404 [2025-02-06 06:22:46,330 INFO L226 Difference]: Without dead ends: 4400 [2025-02-06 06:22:46,341 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-02-06 06:22:46,342 INFO L435 NwaCegarLoop]: 1381 mSDtfsCounter, 361 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 2398 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:46,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 2398 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-02-06 06:22:46,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4400 states. [2025-02-06 06:22:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4400 to 4392. [2025-02-06 06:22:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4392 states, 3296 states have (on average 1.2848907766990292) internal successors, (4235), 3358 states have internal predecessors, (4235), 803 states have call successors, (803), 293 states have call predecessors, (803), 292 states have return successors, (812), 794 states have call predecessors, (812), 802 states have call successors, (812) [2025-02-06 06:22:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4392 states to 4392 states and 5850 transitions. [2025-02-06 06:22:46,512 INFO L78 Accepts]: Start accepts. Automaton has 4392 states and 5850 transitions. Word has length 164 [2025-02-06 06:22:46,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:46,513 INFO L471 AbstractCegarLoop]: Abstraction has 4392 states and 5850 transitions. [2025-02-06 06:22:46,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 06:22:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 4392 states and 5850 transitions. [2025-02-06 06:22:46,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-06 06:22:46,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:46,519 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:22:46,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 06:22:46,519 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:46,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:46,519 INFO L85 PathProgramCache]: Analyzing trace with hash -322097169, now seen corresponding path program 1 times [2025-02-06 06:22:46,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:46,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524444824] [2025-02-06 06:22:46,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:46,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:48,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-06 06:22:48,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-06 06:22:48,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:48,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:48,850 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-02-06 06:22:48,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:48,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524444824] [2025-02-06 06:22:48,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524444824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:48,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:48,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:48,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456370159] [2025-02-06 06:22:48,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:48,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:48,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:48,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:48,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:48,853 INFO L87 Difference]: Start difference. First operand 4392 states and 5850 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 06:22:52,881 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-02-06 06:22:54,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:54,236 INFO L93 Difference]: Finished difference Result 10572 states and 14009 transitions. [2025-02-06 06:22:54,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:54,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 178 [2025-02-06 06:22:54,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:54,270 INFO L225 Difference]: With dead ends: 10572 [2025-02-06 06:22:54,272 INFO L226 Difference]: Without dead ends: 6482 [2025-02-06 06:22:54,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:54,281 INFO L435 NwaCegarLoop]: 1670 mSDtfsCounter, 797 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:54,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 2573 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-02-06 06:22:54,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6482 states. [2025-02-06 06:22:54,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6482 to 6474. [2025-02-06 06:22:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6474 states, 4884 states have (on average 1.2843980343980343) internal successors, (6273), 4974 states have internal predecessors, (6273), 1119 states have call successors, (1119), 471 states have call predecessors, (1119), 470 states have return successors, (1128), 1106 states have call predecessors, (1128), 1118 states have call successors, (1128) [2025-02-06 06:22:54,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6474 states to 6474 states and 8520 transitions. [2025-02-06 06:22:54,502 INFO L78 Accepts]: Start accepts. Automaton has 6474 states and 8520 transitions. Word has length 178 [2025-02-06 06:22:54,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:54,503 INFO L471 AbstractCegarLoop]: Abstraction has 6474 states and 8520 transitions. [2025-02-06 06:22:54,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 06:22:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 6474 states and 8520 transitions. [2025-02-06 06:22:54,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-06 06:22:54,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:54,509 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:22:54,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 06:22:54,509 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:54,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:54,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1125643003, now seen corresponding path program 1 times [2025-02-06 06:22:54,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:54,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002856540] [2025-02-06 06:22:54,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:54,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:56,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-06 06:22:56,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-06 06:22:56,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:56,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-02-06 06:22:57,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:57,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002856540] [2025-02-06 06:22:57,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002856540] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:22:57,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620853634] [2025-02-06 06:22:57,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:57,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:22:57,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:22:57,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:22:57,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 06:23:00,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-06 06:23:00,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-06 06:23:00,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:00,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:00,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 2934 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 06:23:00,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:23:03,416 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-02-06 06:23:03,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:23:03,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620853634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:23:03,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:23:03,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-02-06 06:23:03,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768182600] [2025-02-06 06:23:03,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:23:03,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:23:03,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:23:03,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:23:03,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:23:03,418 INFO L87 Difference]: Start difference. First operand 6474 states and 8520 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 4 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 06:23:07,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:23:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:23:14,363 INFO L93 Difference]: Finished difference Result 19352 states and 25467 transitions. [2025-02-06 06:23:14,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:23:14,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 4 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 197 [2025-02-06 06:23:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:23:14,438 INFO L225 Difference]: With dead ends: 19352 [2025-02-06 06:23:14,439 INFO L226 Difference]: Without dead ends: 19344 [2025-02-06 06:23:14,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:23:14,448 INFO L435 NwaCegarLoop]: 1370 mSDtfsCounter, 2420 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 187 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2420 SdHoareTripleChecker+Valid, 3094 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2025-02-06 06:23:14,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2420 Valid, 3094 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 389 Invalid, 1 Unknown, 0 Unchecked, 10.4s Time] [2025-02-06 06:23:14,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19344 states. [2025-02-06 06:23:15,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19344 to 19313. [2025-02-06 06:23:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19313 states, 14575 states have (on average 1.285557461406518) internal successors, (18737), 14858 states have internal predecessors, (18737), 3331 states have call successors, (3331), 1407 states have call predecessors, (3331), 1406 states have return successors, (3360), 3281 states have call predecessors, (3360), 3330 states have call successors, (3360) [2025-02-06 06:23:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19313 states to 19313 states and 25428 transitions. [2025-02-06 06:23:15,272 INFO L78 Accepts]: Start accepts. Automaton has 19313 states and 25428 transitions. Word has length 197 [2025-02-06 06:23:15,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:23:15,273 INFO L471 AbstractCegarLoop]: Abstraction has 19313 states and 25428 transitions. [2025-02-06 06:23:15,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 4 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 06:23:15,273 INFO L276 IsEmpty]: Start isEmpty. Operand 19313 states and 25428 transitions. [2025-02-06 06:23:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-06 06:23:15,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:23:15,290 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:23:15,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 06:23:15,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 06:23:15,491 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:23:15,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:23:15,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1593864107, now seen corresponding path program 1 times [2025-02-06 06:23:15,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:23:15,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507872177] [2025-02-06 06:23:15,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:15,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:23:17,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-06 06:23:17,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-06 06:23:17,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:17,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2025-02-06 06:23:18,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:23:18,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507872177] [2025-02-06 06:23:18,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507872177] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:23:18,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514519264] [2025-02-06 06:23:18,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:18,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:23:18,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:23:18,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:23:18,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 06:23:21,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-06 06:23:21,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-06 06:23:21,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:21,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:21,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 3019 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 06:23:21,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:23:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2025-02-06 06:23:24,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:23:24,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514519264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:23:24,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:23:24,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-06 06:23:24,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650694016] [2025-02-06 06:23:24,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:23:24,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:23:24,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:23:24,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:23:24,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:23:24,059 INFO L87 Difference]: Start difference. First operand 19313 states and 25428 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21)