./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-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-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 62515c851d4d8c80398352da8857a26e67ae776a292d33d62b0afdc92addb3ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 06:49:22,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 06:49:22,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 06:49:22,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 06:49:22,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 06:49:22,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 06:49:22,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 06:49:22,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 06:49:22,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 06:49:22,632 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 06:49:22,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 06:49:22,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 06:49:22,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 06:49:22,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 06:49:22,634 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 06:49:22,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 06:49:22,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 06:49:22,634 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 06:49:22,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 06:49:22,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 06:49:22,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 06:49:22,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 06:49:22,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 06:49:22,635 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 06:49:22,635 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 06:49:22,635 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 06:49:22,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 06:49:22,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 06:49:22,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 06:49:22,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:49:22,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 06:49:22,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 06:49:22,636 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 06:49:22,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 06:49:22,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 06:49:22,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 06:49:22,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 06:49:22,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 06:49:22,636 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 06:49:22,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 06:49:22,636 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 62515c851d4d8c80398352da8857a26e67ae776a292d33d62b0afdc92addb3ad [2025-02-06 06:49:22,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 06:49:22,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 06:49:22,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 06:49:22,869 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 06:49:22,870 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 06:49:22,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/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-02-06 06:49:24,054 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cea7dd2ff/d0daa445450c4f2eba19f85b992edafb/FLAG68f895db7 [2025-02-06 06:49:24,584 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 06:49:24,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/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-02-06 06:49:24,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cea7dd2ff/d0daa445450c4f2eba19f85b992edafb/FLAG68f895db7 [2025-02-06 06:49:25,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cea7dd2ff/d0daa445450c4f2eba19f85b992edafb [2025-02-06 06:49:25,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 06:49:25,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 06:49:25,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 06:49:25,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 06:49:25,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 06:49:25,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:49:25" (1/1) ... [2025-02-06 06:49:25,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46b07572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:25, skipping insertion in model container [2025-02-06 06:49:25,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:49:25" (1/1) ... [2025-02-06 06:49:25,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 06:49:26,243 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i[217361,217374] [2025-02-06 06:49:26,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:49:26,371 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 06:49:26,453 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-02-06 06:49:26,454 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-02-06 06:49:26,455 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bsrl %1,%0": "=r" (r): "rm" (x), "0" (-1)); [4266] [2025-02-06 06:49:26,457 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-02-06 06:49:26,509 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-02-06 06:49:26,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i[217361,217374] [2025-02-06 06:49:26,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:49:26,695 INFO L204 MainTranslator]: Completed translation [2025-02-06 06:49:26,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:26 WrapperNode [2025-02-06 06:49:26,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 06:49:26,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 06:49:26,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 06:49:26,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 06:49:26,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:26" (1/1) ... [2025-02-06 06:49:26,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:26" (1/1) ... [2025-02-06 06:49:26,886 INFO L138 Inliner]: procedures = 222, calls = 1690, calls flagged for inlining = 84, calls inlined = 76, statements flattened = 4895 [2025-02-06 06:49:26,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 06:49:26,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 06:49:26,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 06:49:26,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 06:49:26,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:26" (1/1) ... [2025-02-06 06:49:26,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:26" (1/1) ... [2025-02-06 06:49:26,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:26" (1/1) ... [2025-02-06 06:49:27,291 INFO L175 MemorySlicer]: Split 982 memory accesses to 20 slices as follows [2, 2, 2, 31, 36, 6, 33, 32, 1, 689, 5, 2, 5, 48, 16, 1, 5, 4, 55, 7]. 70 percent of accesses are in the largest equivalence class. The 283 initializations are split as follows [2, 2, 2, 0, 0, 6, 0, 0, 0, 126, 5, 0, 5, 48, 16, 0, 5, 4, 55, 7]. The 248 writes are split as follows [0, 0, 0, 14, 3, 0, 30, 1, 0, 199, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-02-06 06:49:27,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:26" (1/1) ... [2025-02-06 06:49:27,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:26" (1/1) ... [2025-02-06 06:49:27,366 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:26" (1/1) ... [2025-02-06 06:49:27,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:26" (1/1) ... [2025-02-06 06:49:27,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:26" (1/1) ... [2025-02-06 06:49:27,413 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:26" (1/1) ... [2025-02-06 06:49:27,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 06:49:27,443 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 06:49:27,443 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 06:49:27,444 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 06:49:27,445 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:26" (1/1) ... [2025-02-06 06:49:27,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:49:27,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:49:27,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 06:49:27,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 06:49:27,494 INFO L130 BoogieDeclarations]: Found specification of procedure dm_table_get_mode [2025-02-06 06:49:27,494 INFO L138 BoogieDeclarations]: Found implementation of procedure dm_table_get_mode [2025-02-06 06:49:27,494 INFO L130 BoogieDeclarations]: Found specification of procedure bdev_get_queue [2025-02-06 06:49:27,494 INFO L138 BoogieDeclarations]: Found implementation of procedure bdev_get_queue [2025-02-06 06:49:27,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 06:49:27,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 06:49:27,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 06:49:27,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 06:49:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 06:49:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 06:49:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 06:49:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 06:49:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-06 06:49:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-06 06:49:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-06 06:49:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-06 06:49:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-06 06:49:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-06 06:49:27,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-06 06:49:27,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-06 06:49:27,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-06 06:49:27,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-02-06 06:49:27,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-02-06 06:49:27,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-02-06 06:49:27,496 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 06:49:27,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 06:49:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-02-06 06:49:27,497 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-02-06 06:49:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2025-02-06 06:49:27,497 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2025-02-06 06:49:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure raid10_md_layout_to_format [2025-02-06 06:49:27,497 INFO L138 BoogieDeclarations]: Found implementation of procedure raid10_md_layout_to_format [2025-02-06 06:49:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 06:49:27,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 06:49:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure raid_io_hints [2025-02-06 06:49:27,498 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_io_hints [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure raid_message [2025-02-06 06:49:27,498 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_message [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-02-06 06:49:27,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-02-06 06:49:27,498 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure raid10_md_layout_to_copies [2025-02-06 06:49:27,498 INFO L138 BoogieDeclarations]: Found implementation of procedure raid10_md_layout_to_copies [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-02-06 06:49:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-02-06 06:49:27,499 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 06:49:27,499 INFO L130 BoogieDeclarations]: Found specification of procedure context_free [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure context_free [2025-02-06 06:49:27,499 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-02-06 06:49:27,499 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2025-02-06 06:49:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2025-02-06 06:49:27,499 INFO L130 BoogieDeclarations]: Found specification of procedure super_validate [2025-02-06 06:49:27,502 INFO L138 BoogieDeclarations]: Found implementation of procedure super_validate [2025-02-06 06:49:27,502 INFO L130 BoogieDeclarations]: Found specification of procedure do_table_event [2025-02-06 06:49:27,502 INFO L138 BoogieDeclarations]: Found implementation of procedure do_table_event [2025-02-06 06:49:27,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 06:49:27,502 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-02-06 06:49:27,502 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-02-06 06:49:27,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 06:49:27,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 06:49:27,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 06:49:27,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 06:49:27,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure sync_page_io [2025-02-06 06:49:27,504 INFO L138 BoogieDeclarations]: Found implementation of procedure sync_page_io [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-02-06 06:49:27,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure to_sector [2025-02-06 06:49:27,504 INFO L138 BoogieDeclarations]: Found implementation of procedure to_sector [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-06 06:49:27,504 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure raid_iterate_devices [2025-02-06 06:49:27,504 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_iterate_devices [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure dm_put_device [2025-02-06 06:49:27,504 INFO L138 BoogieDeclarations]: Found implementation of procedure dm_put_device [2025-02-06 06:49:27,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 06:49:27,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 06:49:27,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 06:49:27,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 06:49:27,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 06:49:27,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 06:49:27,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 06:49:27,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 06:49:27,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_reconfig_mutex_of_mddev [2025-02-06 06:49:27,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_reconfig_mutex_of_mddev [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-06 06:49:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure mddev_suspend [2025-02-06 06:49:27,507 INFO L138 BoogieDeclarations]: Found implementation of procedure mddev_suspend [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-02-06 06:49:27,507 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure super_sync [2025-02-06 06:49:27,507 INFO L138 BoogieDeclarations]: Found implementation of procedure super_sync [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure is_power_of_2 [2025-02-06 06:49:27,507 INFO L138 BoogieDeclarations]: Found implementation of procedure is_power_of_2 [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure md_wakeup_thread [2025-02-06 06:49:27,507 INFO L138 BoogieDeclarations]: Found implementation of procedure md_wakeup_thread [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-02-06 06:49:27,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure raid_merge [2025-02-06 06:49:27,507 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_merge [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-02-06 06:49:27,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure raid_map [2025-02-06 06:49:27,507 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_map [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 06:49:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 06:49:27,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 06:49:27,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 06:49:27,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 06:49:27,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 06:49:27,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 06:49:27,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 06:49:27,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 06:49:27,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 06:49:27,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 06:49:27,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 06:49:27,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 06:49:27,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 06:49:27,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 06:49:27,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-06 06:49:27,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-06 06:49:27,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-06 06:49:27,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-06 06:49:27,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-06 06:49:27,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-06 06:49:27,511 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2025-02-06 06:49:27,511 INFO L138 BoogieDeclarations]: Found implementation of procedure strcasecmp [2025-02-06 06:49:27,511 INFO L130 BoogieDeclarations]: Found specification of procedure scnprintf [2025-02-06 06:49:27,511 INFO L138 BoogieDeclarations]: Found implementation of procedure scnprintf [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure md_stop [2025-02-06 06:49:27,512 INFO L138 BoogieDeclarations]: Found implementation of procedure md_stop [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure raid_status [2025-02-06 06:49:27,512 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_status [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure kstrtoul [2025-02-06 06:49:27,512 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrtoul [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-06 06:49:27,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-02-06 06:49:27,512 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure raid_dtr [2025-02-06 06:49:27,512 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_dtr [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure dm_get_device [2025-02-06 06:49:27,512 INFO L138 BoogieDeclarations]: Found implementation of procedure dm_get_device [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 06:49:27,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 06:49:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-02-06 06:49:27,513 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-02-06 06:49:28,071 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 06:49:28,074 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 06:49:28,089 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8234: havoc #t~nondet935; [2025-02-06 06:49:28,105 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4538: havoc #t~mem69.base, #t~mem69.offset;havoc #t~mem70.base, #t~mem70.offset; [2025-02-06 06:49:28,111 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 06:49:28,527 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8344: havoc #t~nondet949; [2025-02-06 06:49:28,534 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8317: havoc #t~nondet943; [2025-02-06 06:49:28,565 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4259: havoc #t~mem1;havoc #t~bitwise2; [2025-02-06 06:49:28,794 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4282: havoc #t~bitwise3;havoc #t~short4; [2025-02-06 06:49:28,897 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6808: havoc #t~mem799#1; [2025-02-06 06:49:28,909 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8340: havoc #t~nondet948; [2025-02-06 06:49:28,911 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8336: havoc #t~nondet947; [2025-02-06 06:49:29,203 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4336: havoc atomic64_read_#t~mem26#1; [2025-02-06 06:49:29,203 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint raid_statusFINAL: assume true; [2025-02-06 06:49:29,208 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8244: havoc kstrtoull_#t~nondet936#1; [2025-02-06 06:49:29,223 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8213: havoc #t~nondet932; [2025-02-06 06:49:37,281 INFO L1309 $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-02-06 06:49:37,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4666: havoc raid10_format_to_md_layout_#t~bitwise128#1; [2025-02-06 06:49:37,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8251: havoc ldv_preresume_2_#t~nondet937#1; [2025-02-06 06:49:37,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8190: havoc __kmalloc_#t~ret929#1.base, __kmalloc_#t~ret929#1.offset; [2025-02-06 06:49:37,281 INFO L1309 $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-02-06 06:49:37,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8199: havoc alloc_pages_current_#t~ret930#1.base, alloc_pages_current_#t~ret930#1.offset; [2025-02-06 06:49:37,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8332: havoc raid5_set_cache_size_#t~nondet946#1; [2025-02-06 06:49:37,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8267: havoc md_rdev_init_#t~nondet938#1; [2025-02-06 06:49:37,282 INFO L1309 $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-02-06 06:49:37,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8203: havoc bitmap_load_#t~nondet931#1; [2025-02-06 06:49:37,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8274: havoc md_run_#t~nondet939#1; [2025-02-06 06:49:37,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8220: havoc dm_register_target_#t~nondet933#1; [2025-02-06 06:49:37,282 INFO L1309 $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-02-06 06:49:37,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8224: havoc dm_set_target_max_io_len_#t~nondet934#1; [2025-02-06 06:49:37,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4525: havoc i_size_read_#t~mem67#1; [2025-02-06 06:49:37,282 INFO L1309 $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-02-06 06:49:37,771 INFO L? ?]: Removed 1582 outVars from TransFormulas that were not future-live. [2025-02-06 06:49:37,771 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 06:49:37,848 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 06:49:37,848 INFO L337 CfgBuilder]: Removed 3 assume(true) statements. [2025-02-06 06:49:37,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:49:37 BoogieIcfgContainer [2025-02-06 06:49:37,849 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 06:49:37,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 06:49:37,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 06:49:37,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 06:49:37,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:49:25" (1/3) ... [2025-02-06 06:49:37,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569f04a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:49:37, skipping insertion in model container [2025-02-06 06:49:37,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:26" (2/3) ... [2025-02-06 06:49:37,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569f04a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:49:37, skipping insertion in model container [2025-02-06 06:49:37,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:49:37" (3/3) ... [2025-02-06 06:49:37,860 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i [2025-02-06 06:49:37,878 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 06:49:37,881 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-02-06 06:49:37,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 06:49:37,961 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;@21b89aa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 06:49:37,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 06:49:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 1394 states, 1077 states have (on average 1.4336118848653667) internal successors, (1544), 1100 states have internal predecessors, (1544), 267 states have call successors, (267), 47 states have call predecessors, (267), 45 states have return successors, (258), 254 states have call predecessors, (258), 258 states have call successors, (258) [2025-02-06 06:49:37,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-06 06:49:37,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:37,988 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-02-06 06:49:37,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:37,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:37,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2111273319, now seen corresponding path program 1 times [2025-02-06 06:49:38,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:38,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264216371] [2025-02-06 06:49:38,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:38,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:38,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-06 06:49:39,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-06 06:49:39,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:39,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:39,466 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-02-06 06:49:39,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:39,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264216371] [2025-02-06 06:49:39,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264216371] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:49:39,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133432549] [2025-02-06 06:49:39,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:39,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:49:39,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:49:39,470 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:49:39,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 06:49:40,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-06 06:49:40,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-06 06:49:40,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:40,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:40,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 3230 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 06:49:40,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:49:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2025-02-06 06:49:40,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:49:40,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133432549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:40,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:49:40,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 06:49:40,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639481534] [2025-02-06 06:49:40,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:40,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 06:49:40,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:40,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 06:49:40,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 06:49:40,855 INFO L87 Difference]: Start difference. First operand has 1394 states, 1077 states have (on average 1.4336118848653667) internal successors, (1544), 1100 states have internal predecessors, (1544), 267 states have call successors, (267), 47 states have call predecessors, (267), 45 states have return successors, (258), 254 states have call predecessors, (258), 258 states have call successors, (258) 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-02-06 06:49:41,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:41,086 INFO L93 Difference]: Finished difference Result 2773 states and 4140 transitions. [2025-02-06 06:49:41,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 06:49:41,088 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-02-06 06:49:41,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:41,101 INFO L225 Difference]: With dead ends: 2773 [2025-02-06 06:49:41,102 INFO L226 Difference]: Without dead ends: 1103 [2025-02-06 06:49:41,111 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-02-06 06:49:41,113 INFO L435 NwaCegarLoop]: 1998 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, 1998 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-02-06 06:49:41,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1998 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:49:41,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2025-02-06 06:49:41,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2025-02-06 06:49:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 845 states have (on average 1.3988165680473372) internal successors, (1182), 860 states have internal predecessors, (1182), 214 states have call successors, (214), 44 states have call predecessors, (214), 43 states have return successors, (209), 205 states have call predecessors, (209), 209 states have call successors, (209) [2025-02-06 06:49:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1605 transitions. [2025-02-06 06:49:41,258 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1605 transitions. Word has length 221 [2025-02-06 06:49:41,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:41,259 INFO L471 AbstractCegarLoop]: Abstraction has 1103 states and 1605 transitions. [2025-02-06 06:49:41,259 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-02-06 06:49:41,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1605 transitions. [2025-02-06 06:49:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-06 06:49:41,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:41,262 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-02-06 06:49:41,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 06:49:41,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 06:49:41,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:41,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:41,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2011717743, now seen corresponding path program 1 times [2025-02-06 06:49:41,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:41,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097269686] [2025-02-06 06:49:41,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:41,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:42,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-06 06:49:42,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-06 06:49:42,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:42,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-02-06 06:49:42,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:42,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097269686] [2025-02-06 06:49:42,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097269686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:42,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:42,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:42,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808116707] [2025-02-06 06:49:42,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:42,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:42,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:42,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:42,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:42,743 INFO L87 Difference]: Start difference. First operand 1103 states and 1605 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-02-06 06:49:46,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:49:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:47,238 INFO L93 Difference]: Finished difference Result 3194 states and 4664 transitions. [2025-02-06 06:49:47,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:49:47,238 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-02-06 06:49:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:47,251 INFO L225 Difference]: With dead ends: 3194 [2025-02-06 06:49:47,251 INFO L226 Difference]: Without dead ends: 2134 [2025-02-06 06:49:47,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:47,257 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 1510 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 3133 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:47,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 3133 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-02-06 06:49:47,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2025-02-06 06:49:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 2131. [2025-02-06 06:49:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2131 states, 1645 states have (on average 1.4054711246200609) internal successors, (2312), 1671 states have internal predecessors, (2312), 403 states have call successors, (403), 83 states have call predecessors, (403), 82 states have return successors, (398), 390 states have call predecessors, (398), 398 states have call successors, (398) [2025-02-06 06:49:47,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 3113 transitions. [2025-02-06 06:49:47,332 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 3113 transitions. Word has length 221 [2025-02-06 06:49:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:47,333 INFO L471 AbstractCegarLoop]: Abstraction has 2131 states and 3113 transitions. [2025-02-06 06:49:47,333 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-02-06 06:49:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 3113 transitions. [2025-02-06 06:49:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-02-06 06:49:47,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:47,336 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-02-06 06:49:47,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 06:49:47,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:47,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:47,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1308363644, now seen corresponding path program 1 times [2025-02-06 06:49:47,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:47,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992044364] [2025-02-06 06:49:47,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:47,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:47,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-06 06:49:48,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-06 06:49:48,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:48,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-02-06 06:49:48,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:48,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992044364] [2025-02-06 06:49:48,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992044364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:48,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:48,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:48,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042936244] [2025-02-06 06:49:48,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:48,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:48,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:48,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:48,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:48,287 INFO L87 Difference]: Start difference. First operand 2131 states and 3113 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-02-06 06:49:48,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:48,438 INFO L93 Difference]: Finished difference Result 2133 states and 3114 transitions. [2025-02-06 06:49:48,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:49:48,439 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-02-06 06:49:48,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:48,450 INFO L225 Difference]: With dead ends: 2133 [2025-02-06 06:49:48,450 INFO L226 Difference]: Without dead ends: 2130 [2025-02-06 06:49:48,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:48,452 INFO L435 NwaCegarLoop]: 1571 mSDtfsCounter, 1555 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:48,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 1571 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:49:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2025-02-06 06:49:48,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 2130. [2025-02-06 06:49:48,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2130 states, 1645 states have (on average 1.4048632218844985) internal successors, (2311), 1670 states have internal predecessors, (2311), 402 states have call successors, (402), 83 states have call predecessors, (402), 82 states have return successors, (398), 390 states have call predecessors, (398), 398 states have call successors, (398) [2025-02-06 06:49:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 3111 transitions. [2025-02-06 06:49:48,575 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 3111 transitions. Word has length 229 [2025-02-06 06:49:48,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:48,575 INFO L471 AbstractCegarLoop]: Abstraction has 2130 states and 3111 transitions. [2025-02-06 06:49:48,575 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-02-06 06:49:48,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 3111 transitions. [2025-02-06 06:49:48,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-06 06:49:48,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:48,578 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-02-06 06:49:48,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 06:49:48,578 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:48,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:48,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1903092672, now seen corresponding path program 1 times [2025-02-06 06:49:48,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:48,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64136284] [2025-02-06 06:49:48,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:48,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:49,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-06 06:49:49,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-06 06:49:49,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:49,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-02-06 06:49:49,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:49,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64136284] [2025-02-06 06:49:49,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64136284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:49,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:49,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:49,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363663422] [2025-02-06 06:49:49,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:49,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:49,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:49,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:49,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:49,439 INFO L87 Difference]: Start difference. First operand 2130 states and 3111 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-02-06 06:49:49,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:49,596 INFO L93 Difference]: Finished difference Result 2132 states and 3112 transitions. [2025-02-06 06:49:49,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:49:49,597 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-02-06 06:49:49,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:49,607 INFO L225 Difference]: With dead ends: 2132 [2025-02-06 06:49:49,607 INFO L226 Difference]: Without dead ends: 2129 [2025-02-06 06:49:49,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:49,608 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 1552 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:49,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 1569 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:49:49,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2025-02-06 06:49:49,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 2129. [2025-02-06 06:49:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2129 states, 1645 states have (on average 1.4042553191489362) internal successors, (2310), 1669 states have internal predecessors, (2310), 401 states have call successors, (401), 83 states have call predecessors, (401), 82 states have return successors, (398), 390 states have call predecessors, (398), 398 states have call successors, (398) [2025-02-06 06:49:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 3109 transitions. [2025-02-06 06:49:49,673 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 3109 transitions. Word has length 230 [2025-02-06 06:49:49,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:49,674 INFO L471 AbstractCegarLoop]: Abstraction has 2129 states and 3109 transitions. [2025-02-06 06:49:49,674 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-02-06 06:49:49,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 3109 transitions. [2025-02-06 06:49:49,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-02-06 06:49:49,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:49,677 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-02-06 06:49:49,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 06:49:49,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:49,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:49,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1135144963, now seen corresponding path program 1 times [2025-02-06 06:49:49,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:49,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141508300] [2025-02-06 06:49:49,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:49,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:50,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-06 06:49:50,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-06 06:49:50,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:50,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-02-06 06:49:50,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:50,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141508300] [2025-02-06 06:49:50,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141508300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:50,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:50,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:50,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34122618] [2025-02-06 06:49:50,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:50,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:50,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:50,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:50,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:50,805 INFO L87 Difference]: Start difference. First operand 2129 states and 3109 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-02-06 06:49:51,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:51,063 INFO L93 Difference]: Finished difference Result 2131 states and 3110 transitions. [2025-02-06 06:49:51,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:49:51,064 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-02-06 06:49:51,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:51,075 INFO L225 Difference]: With dead ends: 2131 [2025-02-06 06:49:51,075 INFO L226 Difference]: Without dead ends: 2128 [2025-02-06 06:49:51,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:51,079 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1549 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:51,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 1567 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:49:51,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2025-02-06 06:49:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 2128. [2025-02-06 06:49:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 1645 states have (on average 1.4036474164133739) internal successors, (2309), 1668 states have internal predecessors, (2309), 400 states have call successors, (400), 83 states have call predecessors, (400), 82 states have return successors, (398), 390 states have call predecessors, (398), 398 states have call successors, (398) [2025-02-06 06:49:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 3107 transitions. [2025-02-06 06:49:51,160 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 3107 transitions. Word has length 231 [2025-02-06 06:49:51,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:51,161 INFO L471 AbstractCegarLoop]: Abstraction has 2128 states and 3107 transitions. [2025-02-06 06:49:51,161 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-02-06 06:49:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 3107 transitions. [2025-02-06 06:49:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-06 06:49:51,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:51,167 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-02-06 06:49:51,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 06:49:51,167 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:51,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:51,168 INFO L85 PathProgramCache]: Analyzing trace with hash -831232159, now seen corresponding path program 1 times [2025-02-06 06:49:51,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:51,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386001557] [2025-02-06 06:49:51,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:51,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:51,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-06 06:49:51,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-06 06:49:51,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:51,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:52,068 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-02-06 06:49:52,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:52,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386001557] [2025-02-06 06:49:52,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386001557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:52,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:52,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:52,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328586829] [2025-02-06 06:49:52,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:52,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:52,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:52,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:52,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:52,070 INFO L87 Difference]: Start difference. First operand 2128 states and 3107 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-02-06 06:49:52,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:52,552 INFO L93 Difference]: Finished difference Result 4179 states and 6116 transitions. [2025-02-06 06:49:52,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:49:52,552 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-02-06 06:49:52,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:52,574 INFO L225 Difference]: With dead ends: 4179 [2025-02-06 06:49:52,574 INFO L226 Difference]: Without dead ends: 4168 [2025-02-06 06:49:52,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:52,577 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 1522 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 3075 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:52,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 3075 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 06:49:52,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2025-02-06 06:49:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 4168. [2025-02-06 06:49:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4168 states, 3233 states have (on average 1.4076708939065883) internal successors, (4551), 3276 states have internal predecessors, (4551), 776 states have call successors, (776), 161 states have call predecessors, (776), 158 states have return successors, (774), 756 states have call predecessors, (774), 774 states have call successors, (774) [2025-02-06 06:49:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 6101 transitions. [2025-02-06 06:49:52,739 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 6101 transitions. Word has length 232 [2025-02-06 06:49:52,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:52,739 INFO L471 AbstractCegarLoop]: Abstraction has 4168 states and 6101 transitions. [2025-02-06 06:49:52,740 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-02-06 06:49:52,740 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 6101 transitions. [2025-02-06 06:49:52,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-02-06 06:49:52,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:52,753 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-02-06 06:49:52,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 06:49:52,754 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:52,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:52,754 INFO L85 PathProgramCache]: Analyzing trace with hash 838525513, now seen corresponding path program 1 times [2025-02-06 06:49:52,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:52,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723461326] [2025-02-06 06:49:52,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:52,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:53,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-02-06 06:49:53,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-02-06 06:49:53,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:53,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2025-02-06 06:49:53,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:53,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723461326] [2025-02-06 06:49:53,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723461326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:53,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:53,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:53,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704637148] [2025-02-06 06:49:53,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:53,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:53,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:53,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:53,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:53,644 INFO L87 Difference]: Start difference. First operand 4168 states and 6101 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-02-06 06:49:54,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:54,402 INFO L93 Difference]: Finished difference Result 8354 states and 12222 transitions. [2025-02-06 06:49:54,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:49:54,403 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-02-06 06:49:54,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:54,419 INFO L225 Difference]: With dead ends: 8354 [2025-02-06 06:49:54,420 INFO L226 Difference]: Without dead ends: 4228 [2025-02-06 06:49:54,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:54,430 INFO L435 NwaCegarLoop]: 1568 mSDtfsCounter, 128 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 2972 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:54,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 2972 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 06:49:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4228 states. [2025-02-06 06:49:54,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4228 to 4228. [2025-02-06 06:49:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4228 states, 3281 states have (on average 1.4059737884791221) internal successors, (4613), 3324 states have internal predecessors, (4613), 783 states have call successors, (783), 166 states have call predecessors, (783), 163 states have return successors, (781), 763 states have call predecessors, (781), 781 states have call successors, (781) [2025-02-06 06:49:54,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4228 states to 4228 states and 6177 transitions. [2025-02-06 06:49:54,559 INFO L78 Accepts]: Start accepts. Automaton has 4228 states and 6177 transitions. Word has length 338 [2025-02-06 06:49:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:54,559 INFO L471 AbstractCegarLoop]: Abstraction has 4228 states and 6177 transitions. [2025-02-06 06:49:54,560 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-02-06 06:49:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 4228 states and 6177 transitions. [2025-02-06 06:49:54,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-02-06 06:49:54,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:54,569 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-02-06 06:49:54,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 06:49:54,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:54,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1000722816, now seen corresponding path program 1 times [2025-02-06 06:49:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:54,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719090692] [2025-02-06 06:49:54,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:54,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:55,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-02-06 06:49:55,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-02-06 06:49:55,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:55,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:55,831 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2025-02-06 06:49:55,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:55,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719090692] [2025-02-06 06:49:55,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719090692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:55,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:55,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:49:55,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10470744] [2025-02-06 06:49:55,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:55,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:49:55,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:55,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:49:55,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:49:55,835 INFO L87 Difference]: Start difference. First operand 4228 states and 6177 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-02-06 06:49:56,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:56,585 INFO L93 Difference]: Finished difference Result 8369 states and 12244 transitions. [2025-02-06 06:49:56,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:49:56,586 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-02-06 06:49:56,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:56,606 INFO L225 Difference]: With dead ends: 8369 [2025-02-06 06:49:56,606 INFO L226 Difference]: Without dead ends: 4244 [2025-02-06 06:49:56,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:49:56,617 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1 mSDsluCounter, 3092 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4659 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:56,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4659 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 06:49:56,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4244 states. [2025-02-06 06:49:56,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4244 to 4236. [2025-02-06 06:49:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4236 states, 3289 states have (on average 1.4049863180297963) internal successors, (4621), 3332 states have internal predecessors, (4621), 783 states have call successors, (783), 166 states have call predecessors, (783), 163 states have return successors, (781), 763 states have call predecessors, (781), 781 states have call successors, (781) [2025-02-06 06:49:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4236 states to 4236 states and 6185 transitions. [2025-02-06 06:49:56,757 INFO L78 Accepts]: Start accepts. Automaton has 4236 states and 6185 transitions. Word has length 363 [2025-02-06 06:49:56,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:56,758 INFO L471 AbstractCegarLoop]: Abstraction has 4236 states and 6185 transitions. [2025-02-06 06:49:56,758 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-02-06 06:49:56,758 INFO L276 IsEmpty]: Start isEmpty. Operand 4236 states and 6185 transitions. [2025-02-06 06:49:56,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-02-06 06:49:56,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:56,769 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-02-06 06:49:56,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 06:49:56,770 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:56,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:56,771 INFO L85 PathProgramCache]: Analyzing trace with hash -273214636, now seen corresponding path program 1 times [2025-02-06 06:49:56,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:56,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152306784] [2025-02-06 06:49:56,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:56,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:57,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-02-06 06:49:57,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-02-06 06:49:57,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:57,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2025-02-06 06:49:58,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:58,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152306784] [2025-02-06 06:49:58,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152306784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:58,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:58,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:49:58,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471595984] [2025-02-06 06:49:58,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:58,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:49:58,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:58,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:49:58,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:49:58,057 INFO L87 Difference]: Start difference. First operand 4236 states and 6185 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-02-06 06:49:58,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:58,658 INFO L93 Difference]: Finished difference Result 8377 states and 12248 transitions. [2025-02-06 06:49:58,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:49:58,659 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-02-06 06:49:58,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:58,688 INFO L225 Difference]: With dead ends: 8377 [2025-02-06 06:49:58,688 INFO L226 Difference]: Without dead ends: 4244 [2025-02-06 06:49:58,698 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-02-06 06:49:58,702 INFO L435 NwaCegarLoop]: 1566 mSDtfsCounter, 0 mSDsluCounter, 3123 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4689 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:58,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4689 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 06:49:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4244 states. [2025-02-06 06:49:58,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4244 to 4244. [2025-02-06 06:49:58,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4244 states, 3297 states have (on average 1.4040036396724296) internal successors, (4629), 3340 states have internal predecessors, (4629), 783 states have call successors, (783), 166 states have call predecessors, (783), 163 states have return successors, (781), 763 states have call predecessors, (781), 781 states have call successors, (781) [2025-02-06 06:49:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4244 states to 4244 states and 6193 transitions. [2025-02-06 06:49:58,881 INFO L78 Accepts]: Start accepts. Automaton has 4244 states and 6193 transitions. Word has length 382 [2025-02-06 06:49:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:58,881 INFO L471 AbstractCegarLoop]: Abstraction has 4244 states and 6193 transitions. [2025-02-06 06:49:58,881 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-02-06 06:49:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 4244 states and 6193 transitions. [2025-02-06 06:49:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-02-06 06:49:58,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:58,891 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-02-06 06:49:58,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 06:49:58,891 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:58,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:58,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2109137190, now seen corresponding path program 1 times [2025-02-06 06:49:58,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:58,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590475434] [2025-02-06 06:49:58,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:58,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:59,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-06 06:49:59,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-06 06:49:59,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:59,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:59,944 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-02-06 06:49:59,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:59,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590475434] [2025-02-06 06:49:59,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590475434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:59,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:59,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:59,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905061547] [2025-02-06 06:49:59,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:59,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:59,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:59,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:59,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:59,945 INFO L87 Difference]: Start difference. First operand 4244 states and 6193 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-02-06 06:50:00,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:50:00,278 INFO L93 Difference]: Finished difference Result 8529 states and 12472 transitions. [2025-02-06 06:50:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:50:00,278 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-02-06 06:50:00,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:50:00,301 INFO L225 Difference]: With dead ends: 8529 [2025-02-06 06:50:00,302 INFO L226 Difference]: Without dead ends: 4388 [2025-02-06 06:50:00,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:50:00,311 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 35 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3136 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:50:00,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3136 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:50:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4388 states. [2025-02-06 06:50:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4388 to 4384. [2025-02-06 06:50:00,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4384 states, 3409 states have (on average 1.4036374303314756) internal successors, (4785), 3452 states have internal predecessors, (4785), 811 states have call successors, (811), 166 states have call predecessors, (811), 163 states have return successors, (809), 791 states have call predecessors, (809), 809 states have call successors, (809) [2025-02-06 06:50:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4384 states to 4384 states and 6405 transitions. [2025-02-06 06:50:00,477 INFO L78 Accepts]: Start accepts. Automaton has 4384 states and 6405 transitions. Word has length 388 [2025-02-06 06:50:00,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:50:00,478 INFO L471 AbstractCegarLoop]: Abstraction has 4384 states and 6405 transitions. [2025-02-06 06:50:00,478 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-02-06 06:50:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 4384 states and 6405 transitions. [2025-02-06 06:50:00,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-02-06 06:50:00,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:50:00,488 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-02-06 06:50:00,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 06:50:00,488 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:50:00,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:50:00,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1927991423, now seen corresponding path program 1 times [2025-02-06 06:50:00,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:50:00,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967466041] [2025-02-06 06:50:00,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:50:00,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:50:01,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-02-06 06:50:01,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-02-06 06:50:01,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:50:01,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:50:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-02-06 06:50:01,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:50:01,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967466041] [2025-02-06 06:50:01,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967466041] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:50:01,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772370623] [2025-02-06 06:50:01,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:50:01,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:50:01,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:50:01,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:50:01,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 06:50:03,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-02-06 06:50:03,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-02-06 06:50:03,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:50:03,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:50:03,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 4555 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 06:50:03,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:50:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-02-06 06:50:03,716 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:50:03,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772370623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:50:03,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:50:03,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 06:50:03,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742332639] [2025-02-06 06:50:03,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:50:03,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:50:03,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:50:03,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:50:03,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:50:03,718 INFO L87 Difference]: Start difference. First operand 4384 states and 6405 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-02-06 06:50:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:50:04,275 INFO L93 Difference]: Finished difference Result 8961 states and 13128 transitions. [2025-02-06 06:50:04,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:50:04,276 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-02-06 06:50:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:50:04,295 INFO L225 Difference]: With dead ends: 8961 [2025-02-06 06:50:04,295 INFO L226 Difference]: Without dead ends: 4680 [2025-02-06 06:50:04,306 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-02-06 06:50:04,306 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 38 mSDsluCounter, 3124 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4691 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 06:50:04,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4691 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 06:50:04,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2025-02-06 06:50:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4672. [2025-02-06 06:50:04,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4672 states, 3641 states have (on average 1.4031859379291403) internal successors, (5109), 3684 states have internal predecessors, (5109), 867 states have call successors, (867), 166 states have call predecessors, (867), 163 states have return successors, (865), 847 states have call predecessors, (865), 865 states have call successors, (865) [2025-02-06 06:50:04,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4672 states to 4672 states and 6841 transitions. [2025-02-06 06:50:04,443 INFO L78 Accepts]: Start accepts. Automaton has 4672 states and 6841 transitions. Word has length 390 [2025-02-06 06:50:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:50:04,444 INFO L471 AbstractCegarLoop]: Abstraction has 4672 states and 6841 transitions. [2025-02-06 06:50:04,444 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-02-06 06:50:04,445 INFO L276 IsEmpty]: Start isEmpty. Operand 4672 states and 6841 transitions. [2025-02-06 06:50:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-02-06 06:50:04,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:50:04,454 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-02-06 06:50:04,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 06:50:04,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:50:04,655 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:50:04,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:50:04,656 INFO L85 PathProgramCache]: Analyzing trace with hash 192295776, now seen corresponding path program 1 times [2025-02-06 06:50:04,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:50:04,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472064617] [2025-02-06 06:50:04,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:50:04,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:50:05,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-02-06 06:50:05,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-02-06 06:50:05,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:50:05,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:50:05,632 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-02-06 06:50:05,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:50:05,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472064617] [2025-02-06 06:50:05,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472064617] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:50:05,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754139323] [2025-02-06 06:50:05,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:50:05,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:50:05,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:50:05,635 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:50:05,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 06:50:07,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-02-06 06:50:07,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-02-06 06:50:07,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:50:07,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:50:07,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 4552 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 06:50:07,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:50:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2025-02-06 06:50:08,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:50:08,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754139323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:50:08,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:50:08,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-06 06:50:08,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965362252] [2025-02-06 06:50:08,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:50:08,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:50:08,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:50:08,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:50:08,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:50:08,942 INFO L87 Difference]: Start difference. First operand 4672 states and 6841 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-02-06 06:50:12,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:50:15,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:50:15,395 INFO L93 Difference]: Finished difference Result 13816 states and 20260 transitions. [2025-02-06 06:50:15,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:50:15,396 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-02-06 06:50:15,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:50:15,439 INFO L225 Difference]: With dead ends: 13816 [2025-02-06 06:50:15,439 INFO L226 Difference]: Without dead ends: 13806 [2025-02-06 06:50:15,447 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-02-06 06:50:15,447 INFO L435 NwaCegarLoop]: 3035 mSDtfsCounter, 2988 mSDsluCounter, 2640 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2988 SdHoareTripleChecker+Valid, 5675 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:50:15,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2988 Valid, 5675 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 569 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2025-02-06 06:50:15,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13806 states. [2025-02-06 06:50:15,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13806 to 13772. [2025-02-06 06:50:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13772 states, 10745 states have (on average 1.4069799906933458) internal successors, (15118), 10888 states have internal predecessors, (15118), 2551 states have call successors, (2551), 482 states have call predecessors, (2551), 475 states have return successors, (2549), 2479 states have call predecessors, (2549), 2549 states have call successors, (2549) [2025-02-06 06:50:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13772 states to 13772 states and 20218 transitions. [2025-02-06 06:50:15,937 INFO L78 Accepts]: Start accepts. Automaton has 13772 states and 20218 transitions. Word has length 390 [2025-02-06 06:50:15,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:50:15,938 INFO L471 AbstractCegarLoop]: Abstraction has 13772 states and 20218 transitions. [2025-02-06 06:50:15,938 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-02-06 06:50:15,938 INFO L276 IsEmpty]: Start isEmpty. Operand 13772 states and 20218 transitions. [2025-02-06 06:50:15,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-02-06 06:50:15,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:50:15,962 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-02-06 06:50:15,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 06:50:16,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:50:16,166 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:50:16,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:50:16,167 INFO L85 PathProgramCache]: Analyzing trace with hash -318238401, now seen corresponding path program 1 times [2025-02-06 06:50:16,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:50:16,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935723345] [2025-02-06 06:50:16,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:50:16,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:50:16,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-02-06 06:50:16,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-02-06 06:50:16,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:50:16,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:50:17,382 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-02-06 06:50:17,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:50:17,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935723345] [2025-02-06 06:50:17,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935723345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:50:17,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:50:17,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:50:17,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51700335] [2025-02-06 06:50:17,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:50:17,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:50:17,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:50:17,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:50:17,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:50:17,385 INFO L87 Difference]: Start difference. First operand 13772 states and 20218 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-02-06 06:50:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:50:18,243 INFO L93 Difference]: Finished difference Result 34338 states and 50416 transitions. [2025-02-06 06:50:18,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:50:18,243 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-02-06 06:50:18,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:50:18,338 INFO L225 Difference]: With dead ends: 34338 [2025-02-06 06:50:18,338 INFO L226 Difference]: Without dead ends: 27447 [2025-02-06 06:50:18,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:50:18,370 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 1595 mSDsluCounter, 3078 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 4660 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 06:50:18,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 4660 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 06:50:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27447 states. [2025-02-06 06:50:19,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27447 to 13778. [2025-02-06 06:50:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13778 states, 10751 states have (on average 1.4067528601990513) internal successors, (15124), 10896 states have internal predecessors, (15124), 2551 states have call successors, (2551), 482 states have call predecessors, (2551), 475 states have return successors, (2549), 2477 states have call predecessors, (2549), 2549 states have call successors, (2549) [2025-02-06 06:50:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13778 states to 13778 states and 20224 transitions. [2025-02-06 06:50:19,057 INFO L78 Accepts]: Start accepts. Automaton has 13778 states and 20224 transitions. Word has length 390 [2025-02-06 06:50:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:50:19,059 INFO L471 AbstractCegarLoop]: Abstraction has 13778 states and 20224 transitions. [2025-02-06 06:50:19,059 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-02-06 06:50:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 13778 states and 20224 transitions. [2025-02-06 06:50:19,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-02-06 06:50:19,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:50:19,080 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-02-06 06:50:19,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 06:50:19,080 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:50:19,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:50:19,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1218689515, now seen corresponding path program 1 times [2025-02-06 06:50:19,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:50:19,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992222340] [2025-02-06 06:50:19,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:50:19,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:50:19,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-02-06 06:50:19,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-02-06 06:50:19,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:50:19,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:50:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-02-06 06:50:20,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:50:20,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992222340] [2025-02-06 06:50:20,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992222340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:50:20,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:50:20,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:50:20,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841413932] [2025-02-06 06:50:20,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:50:20,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:50:20,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:50:20,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:50:20,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:50:20,203 INFO L87 Difference]: Start difference. First operand 13778 states and 20224 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-02-06 06:50:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:50:20,731 INFO L93 Difference]: Finished difference Result 27489 states and 40374 transitions. [2025-02-06 06:50:20,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:50:20,732 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-02-06 06:50:20,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:50:20,778 INFO L225 Difference]: With dead ends: 27489 [2025-02-06 06:50:20,778 INFO L226 Difference]: Without dead ends: 13814 [2025-02-06 06:50:20,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:50:20,805 INFO L435 NwaCegarLoop]: 1564 mSDtfsCounter, 2 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3125 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:50:20,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3125 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 06:50:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13814 states. [2025-02-06 06:50:21,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13814 to 13790. [2025-02-06 06:50:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13790 states, 10763 states have (on average 1.4062993589148007) internal successors, (15136), 10908 states have internal predecessors, (15136), 2551 states have call successors, (2551), 482 states have call predecessors, (2551), 475 states have return successors, (2549), 2477 states have call predecessors, (2549), 2549 states have call successors, (2549) [2025-02-06 06:50:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13790 states to 13790 states and 20236 transitions. [2025-02-06 06:50:21,257 INFO L78 Accepts]: Start accepts. Automaton has 13790 states and 20236 transitions. Word has length 391 [2025-02-06 06:50:21,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:50:21,257 INFO L471 AbstractCegarLoop]: Abstraction has 13790 states and 20236 transitions. [2025-02-06 06:50:21,257 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-02-06 06:50:21,258 INFO L276 IsEmpty]: Start isEmpty. Operand 13790 states and 20236 transitions. [2025-02-06 06:50:21,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-02-06 06:50:21,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:50:21,276 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-02-06 06:50:21,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 06:50:21,276 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:50:21,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:50:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash -909685200, now seen corresponding path program 1 times [2025-02-06 06:50:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:50:21,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292658116] [2025-02-06 06:50:21,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:50:21,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:50:21,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-02-06 06:50:22,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-02-06 06:50:22,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:50:22,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:50:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-02-06 06:50:27,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:50:27,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292658116] [2025-02-06 06:50:27,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292658116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:50:27,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:50:27,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 06:50:27,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025451801] [2025-02-06 06:50:27,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:50:27,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 06:50:27,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:50:27,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 06:50:27,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-02-06 06:50:27,010 INFO L87 Difference]: Start difference. First operand 13790 states and 20236 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-02-06 06:50:29,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:50:29,462 INFO L93 Difference]: Finished difference Result 27525 states and 40410 transitions. [2025-02-06 06:50:29,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 06:50:29,463 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-02-06 06:50:29,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:50:29,538 INFO L225 Difference]: With dead ends: 27525 [2025-02-06 06:50:29,538 INFO L226 Difference]: Without dead ends: 13838 [2025-02-06 06:50:29,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-02-06 06:50:29,570 INFO L435 NwaCegarLoop]: 1557 mSDtfsCounter, 3 mSDsluCounter, 17086 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 18643 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 06:50:29,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 18643 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 06:50:29,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13838 states. [2025-02-06 06:50:29,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13838 to 13838. [2025-02-06 06:50:29,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13838 states, 10799 states have (on average 1.404944902305769) internal successors, (15172), 10944 states have internal predecessors, (15172), 2563 states have call successors, (2563), 482 states have call predecessors, (2563), 475 states have return successors, (2561), 2489 states have call predecessors, (2561), 2561 states have call successors, (2561) [2025-02-06 06:50:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13838 states to 13838 states and 20296 transitions. [2025-02-06 06:50:29,924 INFO L78 Accepts]: Start accepts. Automaton has 13838 states and 20296 transitions. Word has length 393 [2025-02-06 06:50:29,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:50:29,925 INFO L471 AbstractCegarLoop]: Abstraction has 13838 states and 20296 transitions. [2025-02-06 06:50:29,925 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-02-06 06:50:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 13838 states and 20296 transitions. [2025-02-06 06:50:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-02-06 06:50:29,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:50:29,938 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-02-06 06:50:29,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 06:50:29,938 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:50:29,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:50:29,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1094351136, now seen corresponding path program 1 times [2025-02-06 06:50:29,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:50:29,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591411965] [2025-02-06 06:50:29,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:50:29,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:50:30,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-06 06:50:30,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-06 06:50:30,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:50:30,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:50:32,317 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-02-06 06:50:32,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:50:32,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591411965] [2025-02-06 06:50:32,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591411965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:50:32,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:50:32,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 06:50:32,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827714741] [2025-02-06 06:50:32,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:50:32,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 06:50:32,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:50:32,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 06:50:32,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 06:50:32,318 INFO L87 Difference]: Start difference. First operand 13838 states and 20296 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) [2025-02-06 06:50:33,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:50:33,996 INFO L93 Difference]: Finished difference Result 27657 states and 40602 transitions. [2025-02-06 06:50:33,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 06:50:33,997 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 401 [2025-02-06 06:50:33,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:50:34,058 INFO L225 Difference]: With dead ends: 27657 [2025-02-06 06:50:34,058 INFO L226 Difference]: Without dead ends: 13922 [2025-02-06 06:50:34,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 06:50:34,094 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 0 mSDsluCounter, 9366 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10929 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:50:34,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10929 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 06:50:34,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13922 states. [2025-02-06 06:50:34,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13922 to 13922. [2025-02-06 06:50:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13922 states, 10871 states have (on average 1.4022629012970287) internal successors, (15244), 11016 states have internal predecessors, (15244), 2563 states have call successors, (2563), 482 states have call predecessors, (2563), 487 states have return successors, (2621), 2501 states have call predecessors, (2621), 2561 states have call successors, (2621) [2025-02-06 06:50:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13922 states to 13922 states and 20428 transitions. [2025-02-06 06:50:34,521 INFO L78 Accepts]: Start accepts. Automaton has 13922 states and 20428 transitions. Word has length 401 [2025-02-06 06:50:34,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:50:34,522 INFO L471 AbstractCegarLoop]: Abstraction has 13922 states and 20428 transitions. [2025-02-06 06:50:34,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2025-02-06 06:50:34,522 INFO L276 IsEmpty]: Start isEmpty. Operand 13922 states and 20428 transitions. [2025-02-06 06:50:34,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-02-06 06:50:34,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:50:34,539 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, 1, 1, 1, 1] [2025-02-06 06:50:34,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 06:50:34,539 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:50:34,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:50:34,539 INFO L85 PathProgramCache]: Analyzing trace with hash 307917674, now seen corresponding path program 1 times [2025-02-06 06:50:34,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:50:34,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406316441] [2025-02-06 06:50:34,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:50:34,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:50:35,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-02-06 06:50:35,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-02-06 06:50:35,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:50:35,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:50:35,741 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-02-06 06:50:35,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:50:35,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406316441] [2025-02-06 06:50:35,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406316441] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:50:35,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:50:35,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:50:35,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476949978] [2025-02-06 06:50:35,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:50:35,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:50:35,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:50:35,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:50:35,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:50:35,743 INFO L87 Difference]: Start difference. First operand 13922 states and 20428 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-06 06:50:36,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:50:36,293 INFO L93 Difference]: Finished difference Result 27741 states and 40722 transitions. [2025-02-06 06:50:36,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:50:36,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 405 [2025-02-06 06:50:36,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:50:36,398 INFO L225 Difference]: With dead ends: 27741 [2025-02-06 06:50:36,398 INFO L226 Difference]: Without dead ends: 13922 [2025-02-06 06:50:36,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:50:36,428 INFO L435 NwaCegarLoop]: 1566 mSDtfsCounter, 2 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3129 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:50:36,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3129 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 06:50:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13922 states. [2025-02-06 06:50:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13922 to 13922. [2025-02-06 06:50:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13922 states, 10871 states have (on average 1.4011590470057953) internal successors, (15232), 11016 states have internal predecessors, (15232), 2563 states have call successors, (2563), 482 states have call predecessors, (2563), 487 states have return successors, (2621), 2501 states have call predecessors, (2621), 2561 states have call successors, (2621) [2025-02-06 06:50:36,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13922 states to 13922 states and 20416 transitions. [2025-02-06 06:50:36,822 INFO L78 Accepts]: Start accepts. Automaton has 13922 states and 20416 transitions. Word has length 405 [2025-02-06 06:50:36,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:50:36,822 INFO L471 AbstractCegarLoop]: Abstraction has 13922 states and 20416 transitions. [2025-02-06 06:50:36,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-06 06:50:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand 13922 states and 20416 transitions. [2025-02-06 06:50:36,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-02-06 06:50:36,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:50:36,837 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, 1, 1, 1, 1, 1, 1] [2025-02-06 06:50:36,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 06:50:36,837 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:50:36,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:50:36,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1807077956, now seen corresponding path program 1 times [2025-02-06 06:50:36,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:50:36,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222475544] [2025-02-06 06:50:36,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:50:36,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:50:37,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-02-06 06:50:37,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-02-06 06:50:37,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:50:37,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat