./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 62515c851d4d8c80398352da8857a26e67ae776a292d33d62b0afdc92addb3ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 19:35:46,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:35:46,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 19:35:46,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:35:46,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:35:46,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:35:46,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:35:46,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:35:46,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:35:46,625 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:35:46,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:35:46,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:35:46,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:35:46,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:35:46,627 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:35:46,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:35:46,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:35:46,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:35:46,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:35:46,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:35:46,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:35:46,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:35:46,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:35:46,628 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:35:46,628 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:35:46,628 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:35:46,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:35:46,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:35:46,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:35:46,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:35:46,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:35:46,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:35:46,629 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:35:46,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:35:46,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:35:46,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:35:46,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:35:46,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:35:46,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:35:46,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:35:46,630 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 62515c851d4d8c80398352da8857a26e67ae776a292d33d62b0afdc92addb3ad [2025-03-08 19:35:46,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:35:46,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:35:46,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:35:46,855 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:35:46,855 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:35:46,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i [2025-03-08 19:35:48,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985113344/c125c2068b954cd1a5221c3dbd1d20ba/FLAGaa487121f [2025-03-08 19:35:48,537 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:35:48,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i [2025-03-08 19:35:48,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985113344/c125c2068b954cd1a5221c3dbd1d20ba/FLAGaa487121f [2025-03-08 19:35:48,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985113344/c125c2068b954cd1a5221c3dbd1d20ba [2025-03-08 19:35:48,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:35:48,638 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:35:48,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:35:48,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:35:48,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:35:48,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:35:48" (1/1) ... [2025-03-08 19:35:48,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b9f185d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:48, skipping insertion in model container [2025-03-08 19:35:48,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:35:48" (1/1) ... [2025-03-08 19:35:48,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:35:49,581 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i[217361,217374] [2025-03-08 19:35:49,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:35:49,740 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:35:49,860 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"); [4245] [2025-03-08 19:35:49,862 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)); [4252] [2025-03-08 19:35:49,865 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bsrl %1,%0": "=r" (r): "rm" (x), "0" (-1)); [4266] [2025-03-08 19:35:49,865 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("661:\n\tcall __sw_hweight32\n662:\n.skip -(((6651f-6641f)-(662b-661b)) > 0) * ((6651f-6641f)-(662b-661b)),0x90\n663:\n.pushsection .altinstructions,\"a\"\n .long 661b - .\n .long 6641f - .\n .word ( 4*32+23)\n .byte 663b-661b\n .byte 6651f-6641f\n .byte 663b-662b\n.popsection\n.pushsection .altinstr_replacement, \"ax\"\n6641:\n\t.byte 0xf3,0x40,0x0f,0xb8,0xc7\n6651:\n\t.popsection": "=a" (res): "D" (w)); [4275] [2025-03-08 19:35:49,918 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/work/ldvuser/mutilin/launch/work/current--X--drivers/--X--defaultlinux-4.2-rc1.tar.xz--X--32_7a--X--cpachecker/linux-4.2-rc1.tar.xz/csd_deg_dscv/988/dscv_tempdir/dscv/ri/32_7a/drivers/md/dm-raid.c"), "i" (791), "i" (12UL)); [5389-5390] [2025-03-08 19:35:50,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i[217361,217374] [2025-03-08 19:35:50,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:35:50,109 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:35:50,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:50 WrapperNode [2025-03-08 19:35:50,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:35:50,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:35:50,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:35:50,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:35:50,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:50" (1/1) ... [2025-03-08 19:35:50,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:50" (1/1) ... [2025-03-08 19:35:50,277 INFO L138 Inliner]: procedures = 222, calls = 1690, calls flagged for inlining = 84, calls inlined = 76, statements flattened = 4895 [2025-03-08 19:35:50,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:35:50,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:35:50,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:35:50,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:35:50,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:50" (1/1) ... [2025-03-08 19:35:50,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:50" (1/1) ... [2025-03-08 19:35:50,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:50" (1/1) ... [2025-03-08 19:35:50,695 INFO L175 MemorySlicer]: Split 982 memory accesses to 20 slices as follows [2, 2, 31, 2, 6, 33, 55, 2, 689, 5, 1, 32, 5, 48, 16, 5, 4, 7, 1, 36]. 70 percent of accesses are in the largest equivalence class. The 283 initializations are split as follows [2, 2, 0, 2, 6, 0, 55, 0, 126, 5, 0, 0, 5, 48, 16, 5, 4, 7, 0, 0]. The 248 writes are split as follows [0, 0, 14, 0, 0, 30, 0, 1, 199, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 3]. [2025-03-08 19:35:50,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:50" (1/1) ... [2025-03-08 19:35:50,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:50" (1/1) ... [2025-03-08 19:35:50,777 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:50" (1/1) ... [2025-03-08 19:35:50,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:50" (1/1) ... [2025-03-08 19:35:50,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:50" (1/1) ... [2025-03-08 19:35:50,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:50" (1/1) ... [2025-03-08 19:35:50,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:35:50,843 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:35:50,843 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:35:50,844 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:35:50,844 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:50" (1/1) ... [2025-03-08 19:35:50,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:35:50,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:35:50,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 19:35:50,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 19:35:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure dm_table_get_mode [2025-03-08 19:35:50,895 INFO L138 BoogieDeclarations]: Found implementation of procedure dm_table_get_mode [2025-03-08 19:35:50,896 INFO L130 BoogieDeclarations]: Found specification of procedure bdev_get_queue [2025-03-08 19:35:50,896 INFO L138 BoogieDeclarations]: Found implementation of procedure bdev_get_queue [2025-03-08 19:35:50,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 19:35:50,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 19:35:50,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 19:35:50,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 19:35:50,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 19:35:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 19:35:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 19:35:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 19:35:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 19:35:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 19:35:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-08 19:35:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-08 19:35:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-08 19:35:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-08 19:35:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-08 19:35:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-08 19:35:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-08 19:35:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-08 19:35:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-08 19:35:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-08 19:35:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 19:35:50,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 19:35:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-08 19:35:50,899 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-08 19:35:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2025-03-08 19:35:50,899 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2025-03-08 19:35:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure raid10_md_layout_to_format [2025-03-08 19:35:50,899 INFO L138 BoogieDeclarations]: Found implementation of procedure raid10_md_layout_to_format [2025-03-08 19:35:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 19:35:50,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 19:35:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure raid_io_hints [2025-03-08 19:35:50,899 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_io_hints [2025-03-08 19:35:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure raid_message [2025-03-08 19:35:50,899 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_message [2025-03-08 19:35:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:35:50,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:35:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-08 19:35:50,899 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-08 19:35:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure raid10_md_layout_to_copies [2025-03-08 19:35:50,899 INFO L138 BoogieDeclarations]: Found implementation of procedure raid10_md_layout_to_copies [2025-03-08 19:35:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 19:35:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 19:35:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 19:35:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-08 19:35:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-08 19:35:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-08 19:35:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-08 19:35:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-08 19:35:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-08 19:35:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-08 19:35:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-08 19:35:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-08 19:35:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-08 19:35:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-08 19:35:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-08 19:35:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-03-08 19:35:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-03-08 19:35:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-03-08 19:35:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-03-08 19:35:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-03-08 19:35:50,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-03-08 19:35:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 19:35:50,901 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 19:35:50,901 INFO L130 BoogieDeclarations]: Found specification of procedure context_free [2025-03-08 19:35:50,901 INFO L138 BoogieDeclarations]: Found implementation of procedure context_free [2025-03-08 19:35:50,901 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-08 19:35:50,901 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-08 19:35:50,901 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2025-03-08 19:35:50,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2025-03-08 19:35:50,901 INFO L130 BoogieDeclarations]: Found specification of procedure super_validate [2025-03-08 19:35:50,901 INFO L138 BoogieDeclarations]: Found implementation of procedure super_validate [2025-03-08 19:35:50,901 INFO L130 BoogieDeclarations]: Found specification of procedure do_table_event [2025-03-08 19:35:50,903 INFO L138 BoogieDeclarations]: Found implementation of procedure do_table_event [2025-03-08 19:35:50,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:35:50,904 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-08 19:35:50,905 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure sync_page_io [2025-03-08 19:35:50,905 INFO L138 BoogieDeclarations]: Found implementation of procedure sync_page_io [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-08 19:35:50,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure to_sector [2025-03-08 19:35:50,905 INFO L138 BoogieDeclarations]: Found implementation of procedure to_sector [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 19:35:50,905 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure raid_iterate_devices [2025-03-08 19:35:50,905 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_iterate_devices [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure dm_put_device [2025-03-08 19:35:50,905 INFO L138 BoogieDeclarations]: Found implementation of procedure dm_put_device [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 19:35:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_reconfig_mutex_of_mddev [2025-03-08 19:35:50,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_reconfig_mutex_of_mddev [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 19:35:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-08 19:35:50,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-08 19:35:50,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-08 19:35:50,908 INFO L130 BoogieDeclarations]: Found specification of procedure mddev_suspend [2025-03-08 19:35:50,908 INFO L138 BoogieDeclarations]: Found implementation of procedure mddev_suspend [2025-03-08 19:35:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-08 19:35:50,909 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-08 19:35:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure super_sync [2025-03-08 19:35:50,909 INFO L138 BoogieDeclarations]: Found implementation of procedure super_sync [2025-03-08 19:35:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:35:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:35:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:35:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:35:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:35:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:35:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 19:35:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 19:35:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 19:35:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 19:35:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 19:35:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 19:35:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 19:35:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 19:35:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure is_power_of_2 [2025-03-08 19:35:50,910 INFO L138 BoogieDeclarations]: Found implementation of procedure is_power_of_2 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure md_wakeup_thread [2025-03-08 19:35:50,910 INFO L138 BoogieDeclarations]: Found implementation of procedure md_wakeup_thread [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-08 19:35:50,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure raid_merge [2025-03-08 19:35:50,910 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_merge [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-03-08 19:35:50,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure raid_map [2025-03-08 19:35:50,910 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_map [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2025-03-08 19:35:50,910 INFO L138 BoogieDeclarations]: Found implementation of procedure strcasecmp [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure scnprintf [2025-03-08 19:35:50,910 INFO L138 BoogieDeclarations]: Found implementation of procedure scnprintf [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure md_stop [2025-03-08 19:35:50,910 INFO L138 BoogieDeclarations]: Found implementation of procedure md_stop [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure raid_status [2025-03-08 19:35:50,910 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_status [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure kstrtoul [2025-03-08 19:35:50,910 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrtoul [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-08 19:35:50,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-08 19:35:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-08 19:35:50,911 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-08 19:35:50,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:35:50,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:35:50,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:35:50,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:35:50,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:35:50,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:35:50,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 19:35:50,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 19:35:50,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 19:35:50,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 19:35:50,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 19:35:50,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 19:35:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 19:35:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 19:35:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 19:35:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 19:35:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 19:35:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 19:35:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 19:35:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 19:35:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure raid_dtr [2025-03-08 19:35:50,913 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_dtr [2025-03-08 19:35:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure dm_get_device [2025-03-08 19:35:50,913 INFO L138 BoogieDeclarations]: Found implementation of procedure dm_get_device [2025-03-08 19:35:50,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:35:50,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:35:50,914 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-08 19:35:50,914 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-08 19:35:51,459 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:35:51,463 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:35:51,481 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8234: havoc #t~nondet935; [2025-03-08 19:35:51,491 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4538: havoc #t~mem69.base, #t~mem69.offset;havoc #t~mem70.base, #t~mem70.offset; [2025-03-08 19:35:51,495 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 19:35:51,964 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8344: havoc #t~nondet949; [2025-03-08 19:35:51,970 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8317: havoc #t~nondet943; [2025-03-08 19:35:52,008 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4259: havoc #t~mem1;havoc #t~bitwise2; [2025-03-08 19:35:52,259 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4282: havoc #t~bitwise3;havoc #t~short4; [2025-03-08 19:35:52,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6808: havoc #t~mem799#1; [2025-03-08 19:35:52,396 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8340: havoc #t~nondet948; [2025-03-08 19:35:52,400 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8336: havoc #t~nondet947; [2025-03-08 19:35:52,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4336: havoc atomic64_read_#t~mem26#1; [2025-03-08 19:35:52,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8244: havoc kstrtoull_#t~nondet936#1; [2025-03-08 19:35:52,719 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8213: havoc #t~nondet932; [2025-03-08 19:36:00,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4663: havoc raid10_format_to_md_layout_#t~bitwise126#1;havoc raid10_format_to_md_layout_#t~bitwise127#1; [2025-03-08 19:36:00,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4666: havoc raid10_format_to_md_layout_#t~bitwise128#1; [2025-03-08 19:36:00,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8251: havoc ldv_preresume_2_#t~nondet937#1; [2025-03-08 19:36:00,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8190: havoc __kmalloc_#t~ret929#1.base, __kmalloc_#t~ret929#1.offset; [2025-03-08 19:36:00,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5882: call ULTIMATE.dealloc(raid_ctr_~#num_raid_params~0#1.base, raid_ctr_~#num_raid_params~0#1.offset);havoc raid_ctr_~#num_raid_params~0#1.base, raid_ctr_~#num_raid_params~0#1.offset;call ULTIMATE.dealloc(raid_ctr_~#num_raid_devs~0#1.base, raid_ctr_~#num_raid_devs~0#1.offset);havoc raid_ctr_~#num_raid_devs~0#1.base, raid_ctr_~#num_raid_devs~0#1.offset;call ULTIMATE.dealloc(raid_ctr_~#__key~0#1.base, raid_ctr_~#__key~0#1.offset);havoc raid_ctr_~#__key~0#1.base, raid_ctr_~#__key~0#1.offset;call ULTIMATE.dealloc(raid_ctr_~#__constr_expr_0~0#1.base, raid_ctr_~#__constr_expr_0~0#1.offset);havoc raid_ctr_~#__constr_expr_0~0#1.base, raid_ctr_~#__constr_expr_0~0#1.offset; [2025-03-08 19:36:00,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8199: havoc alloc_pages_current_#t~ret930#1.base, alloc_pages_current_#t~ret930#1.offset; [2025-03-08 19:36:00,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8332: havoc raid5_set_cache_size_#t~nondet946#1; [2025-03-08 19:36:00,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8267: havoc md_rdev_init_#t~nondet938#1; [2025-03-08 19:36:00,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7013: call ULTIMATE.dealloc(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset);havoc main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg12~0#1.base, main_~#ldvarg12~0#1.offset);havoc main_~#ldvarg12~0#1.base, main_~#ldvarg12~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset);havoc main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset);havoc main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset);havoc main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg14~0#1.base, main_~#ldvarg14~0#1.offset);havoc main_~#ldvarg14~0#1.base, main_~#ldvarg14~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset);havoc main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset; [2025-03-08 19:36:00,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8203: havoc bitmap_load_#t~nondet931#1; [2025-03-08 19:36:00,161 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8274: havoc md_run_#t~nondet939#1; [2025-03-08 19:36:00,161 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8220: havoc dm_register_target_#t~nondet933#1; [2025-03-08 19:36:00,161 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5049: call ULTIMATE.dealloc(parse_raid_params_~#value~0#1.base, parse_raid_params_~#value~0#1.offset);havoc parse_raid_params_~#value~0#1.base, parse_raid_params_~#value~0#1.offset; [2025-03-08 19:36:00,161 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8224: havoc dm_set_target_max_io_len_#t~nondet934#1; [2025-03-08 19:36:00,161 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4525: havoc i_size_read_#t~mem67#1; [2025-03-08 19:36:00,161 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4658: havoc raid10_format_to_md_layout_#t~bitwise123#1;havoc raid10_format_to_md_layout_#t~bitwise124#1; [2025-03-08 19:36:00,499 INFO L? ?]: Removed 1582 outVars from TransFormulas that were not future-live. [2025-03-08 19:36:00,500 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:36:00,539 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:36:00,541 INFO L336 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-08 19:36:00,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:36:00 BoogieIcfgContainer [2025-03-08 19:36:00,542 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:36:00,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:36:00,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:36:00,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:36:00,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:35:48" (1/3) ... [2025-03-08 19:36:00,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d92350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:36:00, skipping insertion in model container [2025-03-08 19:36:00,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:50" (2/3) ... [2025-03-08 19:36:00,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d92350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:36:00, skipping insertion in model container [2025-03-08 19:36:00,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:36:00" (3/3) ... [2025-03-08 19:36:00,551 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i [2025-03-08 19:36:00,562 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:36:00,564 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i that has 66 procedures, 1466 locations, 1 initial locations, 20 loop locations, and 1 error locations. [2025-03-08 19:36:00,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:36:00,678 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;@454b0a07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:36:00,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 19:36:00,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 1393 states, 1078 states have (on average 1.4332096474953617) internal successors, (1545), 1099 states have internal predecessors, (1545), 267 states have call successors, (267), 47 states have call predecessors, (267), 46 states have return successors, (263), 259 states have call predecessors, (263), 263 states have call successors, (263) [2025-03-08 19:36:00,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-08 19:36:00,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:36:00,700 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:36:00,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:36:00,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:36:00,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1084830056, now seen corresponding path program 1 times [2025-03-08 19:36:00,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:36:00,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147222467] [2025-03-08 19:36:00,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:00,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:36:01,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-08 19:36:01,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-08 19:36:01,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:01,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-03-08 19:36:01,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:36:01,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147222467] [2025-03-08 19:36:01,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147222467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:36:01,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579441612] [2025-03-08 19:36:01,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:01,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:36:01,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:36:01,882 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:36:01,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 19:36:02,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-08 19:36:03,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-08 19:36:03,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:03,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:03,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 3230 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 19:36:03,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:36:03,243 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2025-03-08 19:36:03,243 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:36:03,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579441612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:36:03,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:36:03,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 19:36:03,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58831253] [2025-03-08 19:36:03,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:36:03,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 19:36:03,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:36:03,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 19:36:03,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 19:36:03,269 INFO L87 Difference]: Start difference. First operand has 1393 states, 1078 states have (on average 1.4332096474953617) internal successors, (1545), 1099 states have internal predecessors, (1545), 267 states have call successors, (267), 47 states have call predecessors, (267), 46 states have return successors, (263), 259 states have call predecessors, (263), 263 states have call successors, (263) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 19:36:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:36:03,493 INFO L93 Difference]: Finished difference Result 2781 states and 4162 transitions. [2025-03-08 19:36:03,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 19:36:03,495 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 221 [2025-03-08 19:36:03,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:36:03,511 INFO L225 Difference]: With dead ends: 2781 [2025-03-08 19:36:03,511 INFO L226 Difference]: Without dead ends: 1381 [2025-03-08 19:36:03,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 19:36:03,520 INFO L435 NwaCegarLoop]: 2009 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:36:03,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2009 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:36:03,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-03-08 19:36:03,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2025-03-08 19:36:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1072 states have (on average 1.414179104477612) internal successors, (1516), 1087 states have internal predecessors, (1516), 263 states have call successors, (263), 46 states have call predecessors, (263), 45 states have return successors, (258), 254 states have call predecessors, (258), 258 states have call successors, (258) [2025-03-08 19:36:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2037 transitions. [2025-03-08 19:36:03,625 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2037 transitions. Word has length 221 [2025-03-08 19:36:03,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:36:03,626 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 2037 transitions. [2025-03-08 19:36:03,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 19:36:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2037 transitions. [2025-03-08 19:36:03,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-08 19:36:03,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:36:03,631 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:36:03,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 19:36:03,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 19:36:03,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:36:03,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:36:03,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1184385632, now seen corresponding path program 1 times [2025-03-08 19:36:03,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:36:03,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808557332] [2025-03-08 19:36:03,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:03,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:36:04,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-08 19:36:04,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-08 19:36:04,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:04,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-03-08 19:36:04,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:36:04,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808557332] [2025-03-08 19:36:04,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808557332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:36:04,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:36:04,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:36:04,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534034470] [2025-03-08 19:36:04,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:36:04,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:36:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:36:04,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:36:04,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:36:04,747 INFO L87 Difference]: Start difference. First operand 1381 states and 2037 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 19:36:08,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:36:09,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:36:09,437 INFO L93 Difference]: Finished difference Result 4028 states and 5960 transitions. [2025-03-08 19:36:09,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:36:09,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 221 [2025-03-08 19:36:09,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:36:09,457 INFO L225 Difference]: With dead ends: 4028 [2025-03-08 19:36:09,457 INFO L226 Difference]: Without dead ends: 2690 [2025-03-08 19:36:09,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:36:09,464 INFO L435 NwaCegarLoop]: 1995 mSDtfsCounter, 1941 mSDsluCounter, 1977 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1941 SdHoareTripleChecker+Valid, 3972 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-08 19:36:09,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1941 Valid, 3972 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-08 19:36:09,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2025-03-08 19:36:09,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2687. [2025-03-08 19:36:09,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2687 states, 2099 states have (on average 1.419247260600286) internal successors, (2979), 2125 states have internal predecessors, (2979), 501 states have call successors, (501), 87 states have call predecessors, (501), 86 states have return successors, (496), 488 states have call predecessors, (496), 496 states have call successors, (496) [2025-03-08 19:36:09,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 3976 transitions. [2025-03-08 19:36:09,571 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 3976 transitions. Word has length 221 [2025-03-08 19:36:09,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:36:09,574 INFO L471 AbstractCegarLoop]: Abstraction has 2687 states and 3976 transitions. [2025-03-08 19:36:09,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 19:36:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3976 transitions. [2025-03-08 19:36:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-08 19:36:09,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:36:09,579 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:36:09,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:36:09,580 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:36:09,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:36:09,581 INFO L85 PathProgramCache]: Analyzing trace with hash -511150261, now seen corresponding path program 1 times [2025-03-08 19:36:09,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:36:09,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483588483] [2025-03-08 19:36:09,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:09,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:36:10,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 19:36:10,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 19:36:10,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:10,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-03-08 19:36:10,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:36:10,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483588483] [2025-03-08 19:36:10,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483588483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:36:10,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:36:10,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:36:10,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552875013] [2025-03-08 19:36:10,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:36:10,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:36:10,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:36:10,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:36:10,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:36:10,524 INFO L87 Difference]: Start difference. First operand 2687 states and 3976 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 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-03-08 19:36:10,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:36:10,813 INFO L93 Difference]: Finished difference Result 2689 states and 3977 transitions. [2025-03-08 19:36:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:36:10,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 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 229 [2025-03-08 19:36:10,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:36:10,827 INFO L225 Difference]: With dead ends: 2689 [2025-03-08 19:36:10,827 INFO L226 Difference]: Without dead ends: 2686 [2025-03-08 19:36:10,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:36:10,831 INFO L435 NwaCegarLoop]: 1991 mSDtfsCounter, 1987 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1987 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:36:10,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1987 Valid, 1991 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:36:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2025-03-08 19:36:10,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2686. [2025-03-08 19:36:10,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2686 states, 2099 states have (on average 1.4187708432586945) internal successors, (2978), 2124 states have internal predecessors, (2978), 500 states have call successors, (500), 87 states have call predecessors, (500), 86 states have return successors, (496), 488 states have call predecessors, (496), 496 states have call successors, (496) [2025-03-08 19:36:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 3974 transitions. [2025-03-08 19:36:10,925 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 3974 transitions. Word has length 229 [2025-03-08 19:36:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:36:10,926 INFO L471 AbstractCegarLoop]: Abstraction has 2686 states and 3974 transitions. [2025-03-08 19:36:10,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 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-03-08 19:36:10,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 3974 transitions. [2025-03-08 19:36:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 19:36:10,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:36:10,930 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:36:10,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:36:10,930 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:36:10,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:36:10,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1332736465, now seen corresponding path program 1 times [2025-03-08 19:36:10,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:36:10,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391355064] [2025-03-08 19:36:10,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:10,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:36:11,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 19:36:11,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 19:36:11,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:11,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-03-08 19:36:11,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:36:11,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391355064] [2025-03-08 19:36:11,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391355064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:36:11,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:36:11,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:36:11,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088693228] [2025-03-08 19:36:11,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:36:11,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:36:11,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:36:11,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:36:11,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:36:11,742 INFO L87 Difference]: Start difference. First operand 2686 states and 3974 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 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-03-08 19:36:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:36:12,033 INFO L93 Difference]: Finished difference Result 2688 states and 3975 transitions. [2025-03-08 19:36:12,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:36:12,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 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 230 [2025-03-08 19:36:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:36:12,049 INFO L225 Difference]: With dead ends: 2688 [2025-03-08 19:36:12,049 INFO L226 Difference]: Without dead ends: 2685 [2025-03-08 19:36:12,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:36:12,052 INFO L435 NwaCegarLoop]: 1989 mSDtfsCounter, 1984 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1984 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:36:12,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1984 Valid, 1989 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:36:12,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2025-03-08 19:36:12,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2685. [2025-03-08 19:36:12,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2685 states, 2099 states have (on average 1.4182944259171033) internal successors, (2977), 2123 states have internal predecessors, (2977), 499 states have call successors, (499), 87 states have call predecessors, (499), 86 states have return successors, (496), 488 states have call predecessors, (496), 496 states have call successors, (496) [2025-03-08 19:36:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 3972 transitions. [2025-03-08 19:36:12,197 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 3972 transitions. Word has length 230 [2025-03-08 19:36:12,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:36:12,197 INFO L471 AbstractCegarLoop]: Abstraction has 2685 states and 3972 transitions. [2025-03-08 19:36:12,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 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-03-08 19:36:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 3972 transitions. [2025-03-08 19:36:12,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-08 19:36:12,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:36:12,202 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:36:12,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:36:12,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:36:12,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:36:12,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1636318196, now seen corresponding path program 1 times [2025-03-08 19:36:12,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:36:12,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435010418] [2025-03-08 19:36:12,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:12,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:36:12,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-08 19:36:12,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-08 19:36:12,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:12,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-03-08 19:36:12,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:36:12,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435010418] [2025-03-08 19:36:12,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435010418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:36:12,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:36:12,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:36:12,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795131064] [2025-03-08 19:36:12,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:36:12,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:36:12,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:36:12,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:36:12,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:36:12,982 INFO L87 Difference]: Start difference. First operand 2685 states and 3972 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 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-03-08 19:36:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:36:13,270 INFO L93 Difference]: Finished difference Result 2687 states and 3973 transitions. [2025-03-08 19:36:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:36:13,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 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 231 [2025-03-08 19:36:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:36:13,286 INFO L225 Difference]: With dead ends: 2687 [2025-03-08 19:36:13,286 INFO L226 Difference]: Without dead ends: 2684 [2025-03-08 19:36:13,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:36:13,291 INFO L435 NwaCegarLoop]: 1987 mSDtfsCounter, 1981 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1981 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:36:13,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1981 Valid, 1987 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:36:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2025-03-08 19:36:13,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2684. [2025-03-08 19:36:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2684 states, 2099 states have (on average 1.417818008575512) internal successors, (2976), 2122 states have internal predecessors, (2976), 498 states have call successors, (498), 87 states have call predecessors, (498), 86 states have return successors, (496), 488 states have call predecessors, (496), 496 states have call successors, (496) [2025-03-08 19:36:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 3970 transitions. [2025-03-08 19:36:13,386 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 3970 transitions. Word has length 231 [2025-03-08 19:36:13,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:36:13,389 INFO L471 AbstractCegarLoop]: Abstraction has 2684 states and 3970 transitions. [2025-03-08 19:36:13,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 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-03-08 19:36:13,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 3970 transitions. [2025-03-08 19:36:13,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-08 19:36:13,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:36:13,391 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:36:13,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 19:36:13,391 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:36:13,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:36:13,392 INFO L85 PathProgramCache]: Analyzing trace with hash 812266802, now seen corresponding path program 1 times [2025-03-08 19:36:13,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:36:13,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930362586] [2025-03-08 19:36:13,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:13,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:36:14,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-08 19:36:14,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-08 19:36:14,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:14,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-03-08 19:36:14,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:36:14,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930362586] [2025-03-08 19:36:14,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930362586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:36:14,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:36:14,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:36:14,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746013560] [2025-03-08 19:36:14,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:36:14,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:36:14,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:36:14,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:36:14,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:36:14,317 INFO L87 Difference]: Start difference. First operand 2684 states and 3970 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (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-03-08 19:36:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:36:14,952 INFO L93 Difference]: Finished difference Result 5291 states and 7842 transitions. [2025-03-08 19:36:14,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:36:14,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (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 232 [2025-03-08 19:36:14,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:36:14,980 INFO L225 Difference]: With dead ends: 5291 [2025-03-08 19:36:14,981 INFO L226 Difference]: Without dead ends: 5280 [2025-03-08 19:36:14,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:36:14,986 INFO L435 NwaCegarLoop]: 1989 mSDtfsCounter, 1954 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1954 SdHoareTripleChecker+Valid, 3915 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 19:36:14,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1954 Valid, 3915 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 19:36:15,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5280 states. [2025-03-08 19:36:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5280 to 5280. [2025-03-08 19:36:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5280 states, 4141 states have (on average 1.4211543105530065) internal successors, (5885), 4184 states have internal predecessors, (5885), 972 states have call successors, (972), 169 states have call predecessors, (972), 166 states have return successors, (970), 952 states have call predecessors, (970), 970 states have call successors, (970) [2025-03-08 19:36:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5280 states to 5280 states and 7827 transitions. [2025-03-08 19:36:15,196 INFO L78 Accepts]: Start accepts. Automaton has 5280 states and 7827 transitions. Word has length 232 [2025-03-08 19:36:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:36:15,197 INFO L471 AbstractCegarLoop]: Abstraction has 5280 states and 7827 transitions. [2025-03-08 19:36:15,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (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-03-08 19:36:15,197 INFO L276 IsEmpty]: Start isEmpty. Operand 5280 states and 7827 transitions. [2025-03-08 19:36:15,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-08 19:36:15,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:36:15,218 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:36:15,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 19:36:15,218 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:36:15,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:36:15,219 INFO L85 PathProgramCache]: Analyzing trace with hash -411118886, now seen corresponding path program 1 times [2025-03-08 19:36:15,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:36:15,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646706243] [2025-03-08 19:36:15,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:15,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:36:15,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-08 19:36:15,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-08 19:36:15,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:15,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2025-03-08 19:36:16,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:36:16,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646706243] [2025-03-08 19:36:16,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646706243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:36:16,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:36:16,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:36:16,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173685121] [2025-03-08 19:36:16,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:36:16,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:36:16,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:36:16,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:36:16,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:36:16,162 INFO L87 Difference]: Start difference. First operand 5280 states and 7827 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 19:36:17,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:36:17,411 INFO L93 Difference]: Finished difference Result 10711 states and 15868 transitions. [2025-03-08 19:36:17,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:36:17,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 338 [2025-03-08 19:36:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:36:17,440 INFO L225 Difference]: With dead ends: 10711 [2025-03-08 19:36:17,440 INFO L226 Difference]: Without dead ends: 5474 [2025-03-08 19:36:17,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:36:17,461 INFO L435 NwaCegarLoop]: 2000 mSDtfsCounter, 142 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 3813 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:36:17,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 3813 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 19:36:17,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5474 states. [2025-03-08 19:36:17,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5474 to 5464. [2025-03-08 19:36:17,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5464 states, 4296 states have (on average 1.4208566108007448) internal successors, (6104), 4339 states have internal predecessors, (6104), 992 states have call successors, (992), 178 states have call predecessors, (992), 175 states have return successors, (990), 972 states have call predecessors, (990), 990 states have call successors, (990) [2025-03-08 19:36:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5464 states to 5464 states and 8086 transitions. [2025-03-08 19:36:17,656 INFO L78 Accepts]: Start accepts. Automaton has 5464 states and 8086 transitions. Word has length 338 [2025-03-08 19:36:17,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:36:17,656 INFO L471 AbstractCegarLoop]: Abstraction has 5464 states and 8086 transitions. [2025-03-08 19:36:17,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 19:36:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand 5464 states and 8086 transitions. [2025-03-08 19:36:17,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-08 19:36:17,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:36:17,674 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:36:17,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 19:36:17,675 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:36:17,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:36:17,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2038953487, now seen corresponding path program 1 times [2025-03-08 19:36:17,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:36:17,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595002835] [2025-03-08 19:36:17,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:17,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:36:18,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-08 19:36:18,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-08 19:36:18,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:18,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2025-03-08 19:36:18,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:36:18,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595002835] [2025-03-08 19:36:18,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595002835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:36:18,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:36:18,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:36:18,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584022024] [2025-03-08 19:36:18,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:36:18,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:36:18,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:36:18,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:36:18,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:36:18,707 INFO L87 Difference]: Start difference. First operand 5464 states and 8086 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 19:36:19,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:36:19,724 INFO L93 Difference]: Finished difference Result 10887 states and 16125 transitions. [2025-03-08 19:36:19,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:36:19,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 363 [2025-03-08 19:36:19,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:36:19,757 INFO L225 Difference]: With dead ends: 10887 [2025-03-08 19:36:19,758 INFO L226 Difference]: Without dead ends: 5480 [2025-03-08 19:36:19,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:36:19,780 INFO L435 NwaCegarLoop]: 1987 mSDtfsCounter, 1 mSDsluCounter, 3932 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5919 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 19:36:19,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 5919 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 19:36:19,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5480 states. [2025-03-08 19:36:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5480 to 5472. [2025-03-08 19:36:20,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5472 states, 4304 states have (on average 1.420074349442379) internal successors, (6112), 4347 states have internal predecessors, (6112), 992 states have call successors, (992), 178 states have call predecessors, (992), 175 states have return successors, (990), 972 states have call predecessors, (990), 990 states have call successors, (990) [2025-03-08 19:36:20,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5472 states to 5472 states and 8094 transitions. [2025-03-08 19:36:20,084 INFO L78 Accepts]: Start accepts. Automaton has 5472 states and 8094 transitions. Word has length 363 [2025-03-08 19:36:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:36:20,086 INFO L471 AbstractCegarLoop]: Abstraction has 5472 states and 8094 transitions. [2025-03-08 19:36:20,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 19:36:20,086 INFO L276 IsEmpty]: Start isEmpty. Operand 5472 states and 8094 transitions. [2025-03-08 19:36:20,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-03-08 19:36:20,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:36:20,143 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:36:20,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 19:36:20,145 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:36:20,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:36:20,146 INFO L85 PathProgramCache]: Analyzing trace with hash -132043163, now seen corresponding path program 1 times [2025-03-08 19:36:20,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:36:20,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973610079] [2025-03-08 19:36:20,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:20,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:36:20,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-08 19:36:20,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-08 19:36:20,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:20,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2025-03-08 19:36:21,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:36:21,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973610079] [2025-03-08 19:36:21,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973610079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:36:21,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:36:21,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:36:21,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972489314] [2025-03-08 19:36:21,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:36:21,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:36:21,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:36:21,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:36:21,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:36:21,335 INFO L87 Difference]: Start difference. First operand 5472 states and 8094 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 19:36:22,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:36:22,194 INFO L93 Difference]: Finished difference Result 10895 states and 16129 transitions. [2025-03-08 19:36:22,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:36:22,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 382 [2025-03-08 19:36:22,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:36:22,239 INFO L225 Difference]: With dead ends: 10895 [2025-03-08 19:36:22,239 INFO L226 Difference]: Without dead ends: 5480 [2025-03-08 19:36:22,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:36:22,257 INFO L435 NwaCegarLoop]: 1986 mSDtfsCounter, 0 mSDsluCounter, 3963 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5949 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 19:36:22,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5949 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 19:36:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5480 states. [2025-03-08 19:36:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5480 to 5480. [2025-03-08 19:36:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5480 states, 4312 states have (on average 1.4192949907235621) internal successors, (6120), 4355 states have internal predecessors, (6120), 992 states have call successors, (992), 178 states have call predecessors, (992), 175 states have return successors, (990), 972 states have call predecessors, (990), 990 states have call successors, (990) [2025-03-08 19:36:22,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5480 states to 5480 states and 8102 transitions. [2025-03-08 19:36:22,498 INFO L78 Accepts]: Start accepts. Automaton has 5480 states and 8102 transitions. Word has length 382 [2025-03-08 19:36:22,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:36:22,499 INFO L471 AbstractCegarLoop]: Abstraction has 5480 states and 8102 transitions. [2025-03-08 19:36:22,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 19:36:22,499 INFO L276 IsEmpty]: Start isEmpty. Operand 5480 states and 8102 transitions. [2025-03-08 19:36:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-03-08 19:36:22,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:36:22,516 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:36:22,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 19:36:22,516 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:36:22,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:36:22,517 INFO L85 PathProgramCache]: Analyzing trace with hash -558044885, now seen corresponding path program 1 times [2025-03-08 19:36:22,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:36:22,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404456507] [2025-03-08 19:36:22,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:22,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:36:23,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-03-08 19:36:23,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-03-08 19:36:23,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:23,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:23,610 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-03-08 19:36:23,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:36:23,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404456507] [2025-03-08 19:36:23,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404456507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:36:23,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:36:23,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:36:23,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408838529] [2025-03-08 19:36:23,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:36:23,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:36:23,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:36:23,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:36:23,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:36:23,612 INFO L87 Difference]: Start difference. First operand 5480 states and 8102 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 19:36:24,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:36:24,200 INFO L93 Difference]: Finished difference Result 11047 states and 16353 transitions. [2025-03-08 19:36:24,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:36:24,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 388 [2025-03-08 19:36:24,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:36:24,226 INFO L225 Difference]: With dead ends: 11047 [2025-03-08 19:36:24,226 INFO L226 Difference]: Without dead ends: 5624 [2025-03-08 19:36:24,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:36:24,244 INFO L435 NwaCegarLoop]: 1996 mSDtfsCounter, 35 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3980 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 19:36:24,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3980 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 19:36:24,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5624 states. [2025-03-08 19:36:24,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5624 to 5620. [2025-03-08 19:36:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5620 states, 4424 states have (on average 1.418625678119349) internal successors, (6276), 4467 states have internal predecessors, (6276), 1020 states have call successors, (1020), 178 states have call predecessors, (1020), 175 states have return successors, (1018), 1000 states have call predecessors, (1018), 1018 states have call successors, (1018) [2025-03-08 19:36:24,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5620 states to 5620 states and 8314 transitions. [2025-03-08 19:36:24,482 INFO L78 Accepts]: Start accepts. Automaton has 5620 states and 8314 transitions. Word has length 388 [2025-03-08 19:36:24,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:36:24,483 INFO L471 AbstractCegarLoop]: Abstraction has 5620 states and 8314 transitions. [2025-03-08 19:36:24,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 19:36:24,483 INFO L276 IsEmpty]: Start isEmpty. Operand 5620 states and 8314 transitions. [2025-03-08 19:36:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-03-08 19:36:24,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:36:24,495 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:36:24,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 19:36:24,496 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:36:24,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:36:24,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1681938030, now seen corresponding path program 1 times [2025-03-08 19:36:24,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:36:24,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92887695] [2025-03-08 19:36:24,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:24,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:36:25,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-08 19:36:25,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-08 19:36:25,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:25,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-03-08 19:36:25,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:36:25,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92887695] [2025-03-08 19:36:25,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92887695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:36:25,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022474963] [2025-03-08 19:36:25,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:25,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:36:25,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:36:25,518 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:36:25,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 19:36:26,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-08 19:36:27,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-08 19:36:27,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:27,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:27,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 4555 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 19:36:27,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:36:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-03-08 19:36:27,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:36:27,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022474963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:36:27,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:36:27,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 19:36:27,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462495417] [2025-03-08 19:36:27,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:36:27,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:36:27,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:36:27,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:36:27,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:36:27,504 INFO L87 Difference]: Start difference. First operand 5620 states and 8314 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 19:36:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:36:28,437 INFO L93 Difference]: Finished difference Result 11479 states and 17009 transitions. [2025-03-08 19:36:28,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:36:28,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 390 [2025-03-08 19:36:28,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:36:28,463 INFO L225 Difference]: With dead ends: 11479 [2025-03-08 19:36:28,463 INFO L226 Difference]: Without dead ends: 5916 [2025-03-08 19:36:28,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:36:28,479 INFO L435 NwaCegarLoop]: 1987 mSDtfsCounter, 38 mSDsluCounter, 3964 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5951 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 19:36:28,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5951 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 19:36:28,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5916 states. [2025-03-08 19:36:28,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5916 to 5908. [2025-03-08 19:36:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5908 states, 4656 states have (on average 1.4175257731958764) internal successors, (6600), 4699 states have internal predecessors, (6600), 1076 states have call successors, (1076), 178 states have call predecessors, (1076), 175 states have return successors, (1074), 1056 states have call predecessors, (1074), 1074 states have call successors, (1074) [2025-03-08 19:36:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5908 states to 5908 states and 8750 transitions. [2025-03-08 19:36:28,653 INFO L78 Accepts]: Start accepts. Automaton has 5908 states and 8750 transitions. Word has length 390 [2025-03-08 19:36:28,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:36:28,655 INFO L471 AbstractCegarLoop]: Abstraction has 5908 states and 8750 transitions. [2025-03-08 19:36:28,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 19:36:28,655 INFO L276 IsEmpty]: Start isEmpty. Operand 5908 states and 8750 transitions. [2025-03-08 19:36:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-03-08 19:36:28,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:36:28,668 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:36:28,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 19:36:28,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 19:36:28,870 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:36:28,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:36:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash 438349169, now seen corresponding path program 1 times [2025-03-08 19:36:28,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:36:28,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236956529] [2025-03-08 19:36:28,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:28,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:36:29,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-08 19:36:29,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-08 19:36:29,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:29,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:29,901 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-03-08 19:36:29,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:36:29,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236956529] [2025-03-08 19:36:29,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236956529] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:36:29,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520771432] [2025-03-08 19:36:29,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:29,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:36:29,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:36:29,904 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:36:29,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 19:36:31,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-08 19:36:31,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-08 19:36:31,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:31,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:31,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 4552 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:36:31,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:36:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2025-03-08 19:36:32,383 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:36:32,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520771432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:36:32,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:36:32,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-08 19:36:32,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061521270] [2025-03-08 19:36:32,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:36:32,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:36:32,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:36:32,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:36:32,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:36:32,385 INFO L87 Difference]: Start difference. First operand 5908 states and 8750 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 3 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 19:36:36,413 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-03-08 19:36:39,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:36:39,397 INFO L93 Difference]: Finished difference Result 17616 states and 26113 transitions. [2025-03-08 19:36:39,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:36:39,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 3 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 390 [2025-03-08 19:36:39,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:36:39,456 INFO L225 Difference]: With dead ends: 17616 [2025-03-08 19:36:39,456 INFO L226 Difference]: Without dead ends: 17606 [2025-03-08 19:36:39,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:36:39,470 INFO L435 NwaCegarLoop]: 3897 mSDtfsCounter, 3833 mSDsluCounter, 3382 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3833 SdHoareTripleChecker+Valid, 7279 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-03-08 19:36:39,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3833 Valid, 7279 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 717 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2025-03-08 19:36:39,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17606 states. [2025-03-08 19:36:39,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17606 to 17572. [2025-03-08 19:36:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17572 states, 13868 states have (on average 1.42024805307182) internal successors, (19696), 14011 states have internal predecessors, (19696), 3188 states have call successors, (3188), 522 states have call predecessors, (3188), 515 states have return successors, (3186), 3116 states have call predecessors, (3186), 3186 states have call successors, (3186) [2025-03-08 19:36:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17572 states to 17572 states and 26070 transitions. [2025-03-08 19:36:39,895 INFO L78 Accepts]: Start accepts. Automaton has 17572 states and 26070 transitions. Word has length 390 [2025-03-08 19:36:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:36:39,896 INFO L471 AbstractCegarLoop]: Abstraction has 17572 states and 26070 transitions. [2025-03-08 19:36:39,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 3 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 19:36:39,896 INFO L276 IsEmpty]: Start isEmpty. Operand 17572 states and 26070 transitions. [2025-03-08 19:36:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-03-08 19:36:39,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:36:39,993 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:36:40,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 19:36:40,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:36:40,195 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:36:40,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:36:40,196 INFO L85 PathProgramCache]: Analyzing trace with hash -72185008, now seen corresponding path program 1 times [2025-03-08 19:36:40,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:36:40,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071982260] [2025-03-08 19:36:40,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:40,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:36:40,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-08 19:36:40,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-08 19:36:40,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:40,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:41,225 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-03-08 19:36:41,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:36:41,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071982260] [2025-03-08 19:36:41,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071982260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:36:41,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:36:41,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:36:41,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534847448] [2025-03-08 19:36:41,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:36:41,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:36:41,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:36:41,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:36:41,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:36:41,229 INFO L87 Difference]: Start difference. First operand 17572 states and 26070 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 19:36:42,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:36:42,543 INFO L93 Difference]: Finished difference Result 43907 states and 65143 transitions. [2025-03-08 19:36:42,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:36:42,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 390 [2025-03-08 19:36:42,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:36:42,685 INFO L225 Difference]: With dead ends: 43907 [2025-03-08 19:36:42,685 INFO L226 Difference]: Without dead ends: 35093 [2025-03-08 19:36:42,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:36:42,732 INFO L435 NwaCegarLoop]: 1998 mSDtfsCounter, 2027 mSDsluCounter, 3914 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2027 SdHoareTripleChecker+Valid, 5912 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 19:36:42,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2027 Valid, 5912 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 19:36:42,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35093 states. [2025-03-08 19:36:43,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35093 to 17578. [2025-03-08 19:36:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17578 states, 13874 states have (on average 1.4200663110854836) internal successors, (19702), 14019 states have internal predecessors, (19702), 3188 states have call successors, (3188), 522 states have call predecessors, (3188), 515 states have return successors, (3186), 3114 states have call predecessors, (3186), 3186 states have call successors, (3186) [2025-03-08 19:36:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17578 states to 17578 states and 26076 transitions. [2025-03-08 19:36:43,528 INFO L78 Accepts]: Start accepts. Automaton has 17578 states and 26076 transitions. Word has length 390 [2025-03-08 19:36:43,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:36:43,530 INFO L471 AbstractCegarLoop]: Abstraction has 17578 states and 26076 transitions. [2025-03-08 19:36:43,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 19:36:43,530 INFO L276 IsEmpty]: Start isEmpty. Operand 17578 states and 26076 transitions. [2025-03-08 19:36:43,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-08 19:36:43,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:36:43,554 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:36:43,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 19:36:43,554 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:36:43,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:36:43,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2113998372, now seen corresponding path program 1 times [2025-03-08 19:36:43,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:36:43,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851087635] [2025-03-08 19:36:43,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:43,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:36:44,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-08 19:36:44,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-08 19:36:44,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:44,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-03-08 19:36:44,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:36:44,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851087635] [2025-03-08 19:36:44,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851087635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:36:44,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:36:44,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:36:44,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399529285] [2025-03-08 19:36:44,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:36:44,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:36:44,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:36:44,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:36:44,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:36:44,685 INFO L87 Difference]: Start difference. First operand 17578 states and 26076 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 19:36:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:36:45,491 INFO L93 Difference]: Finished difference Result 35135 states and 52141 transitions. [2025-03-08 19:36:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:36:45,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 391 [2025-03-08 19:36:45,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:36:45,566 INFO L225 Difference]: With dead ends: 35135 [2025-03-08 19:36:45,567 INFO L226 Difference]: Without dead ends: 17614 [2025-03-08 19:36:45,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:36:45,617 INFO L435 NwaCegarLoop]: 1984 mSDtfsCounter, 2 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3965 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 19:36:45,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3965 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 19:36:45,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17614 states. [2025-03-08 19:36:46,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17614 to 17590. [2025-03-08 19:36:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17590 states, 13886 states have (on average 1.4197032982860436) internal successors, (19714), 14031 states have internal predecessors, (19714), 3188 states have call successors, (3188), 522 states have call predecessors, (3188), 515 states have return successors, (3186), 3114 states have call predecessors, (3186), 3186 states have call successors, (3186) [2025-03-08 19:36:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17590 states to 17590 states and 26088 transitions. [2025-03-08 19:36:46,242 INFO L78 Accepts]: Start accepts. Automaton has 17590 states and 26088 transitions. Word has length 391 [2025-03-08 19:36:46,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:36:46,242 INFO L471 AbstractCegarLoop]: Abstraction has 17590 states and 26088 transitions. [2025-03-08 19:36:46,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 19:36:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 17590 states and 26088 transitions. [2025-03-08 19:36:46,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-03-08 19:36:46,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:36:46,266 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:36:46,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 19:36:46,266 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:36:46,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:36:46,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2052738687, now seen corresponding path program 1 times [2025-03-08 19:36:46,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:36:46,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777977512] [2025-03-08 19:36:46,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:46,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:36:47,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-03-08 19:36:47,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-03-08 19:36:47,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:47,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-03-08 19:36:52,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:36:52,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777977512] [2025-03-08 19:36:52,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777977512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:36:52,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:36:52,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 19:36:52,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893947961] [2025-03-08 19:36:52,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:36:52,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 19:36:52,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:36:52,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 19:36:52,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-08 19:36:52,028 INFO L87 Difference]: Start difference. First operand 17590 states and 26088 transitions. Second operand has 13 states, 11 states have (on average 15.272727272727273) internal successors, (168), 10 states have internal predecessors, (168), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (31), 5 states have call predecessors, (31), 4 states have call successors, (31) [2025-03-08 19:36:55,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:36:55,206 INFO L93 Difference]: Finished difference Result 35171 states and 52177 transitions. [2025-03-08 19:36:55,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 19:36:55,207 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 15.272727272727273) internal successors, (168), 10 states have internal predecessors, (168), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (31), 5 states have call predecessors, (31), 4 states have call successors, (31) Word has length 393 [2025-03-08 19:36:55,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:36:55,287 INFO L225 Difference]: With dead ends: 35171 [2025-03-08 19:36:55,287 INFO L226 Difference]: Without dead ends: 17638 [2025-03-08 19:36:55,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-08 19:36:55,341 INFO L435 NwaCegarLoop]: 1977 mSDtfsCounter, 3 mSDsluCounter, 21706 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 23683 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 19:36:55,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 23683 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 19:36:55,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17638 states. [2025-03-08 19:36:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17638 to 17638. [2025-03-08 19:36:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17638 states, 13922 states have (on average 1.4186180146530671) internal successors, (19750), 14067 states have internal predecessors, (19750), 3200 states have call successors, (3200), 522 states have call predecessors, (3200), 515 states have return successors, (3198), 3126 states have call predecessors, (3198), 3198 states have call successors, (3198) [2025-03-08 19:36:55,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17638 states to 17638 states and 26148 transitions. [2025-03-08 19:36:55,865 INFO L78 Accepts]: Start accepts. Automaton has 17638 states and 26148 transitions. Word has length 393 [2025-03-08 19:36:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:36:55,866 INFO L471 AbstractCegarLoop]: Abstraction has 17638 states and 26148 transitions. [2025-03-08 19:36:55,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 15.272727272727273) internal successors, (168), 10 states have internal predecessors, (168), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (31), 5 states have call predecessors, (31), 4 states have call successors, (31) [2025-03-08 19:36:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 17638 states and 26148 transitions. [2025-03-08 19:36:55,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-08 19:36:55,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:36:55,890 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:36:55,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 19:36:55,890 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:36:55,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:36:55,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1877719663, now seen corresponding path program 1 times [2025-03-08 19:36:55,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:36:55,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635335949] [2025-03-08 19:36:55,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:36:55,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:36:56,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-08 19:36:56,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-08 19:36:56,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:36:56,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:36:58,296 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-03-08 19:36:58,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:36:58,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635335949] [2025-03-08 19:36:58,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635335949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:36:58,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:36:58,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 19:36:58,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273311191] [2025-03-08 19:36:58,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:36:58,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 19:36:58,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:36:58,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 19:36:58,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 19:36:58,300 INFO L87 Difference]: Start difference. First operand 17638 states and 26148 transitions. Second operand has 8 states, 8 states have (on average 22.0) internal successors, (176), 7 states have internal predecessors, (176), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31)