./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pf.ko-main.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pf.ko-main.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 65cc93bea37c503291576929a444106bffa9d5b7b84b8d294ee7e7120b60ffa5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 03:50:14,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 03:50:14,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 03:50:14,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 03:50:14,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 03:50:14,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 03:50:14,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 03:50:14,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 03:50:14,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 03:50:14,915 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 03:50:14,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 03:50:14,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 03:50:14,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 03:50:14,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 03:50:14,916 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 03:50:14,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 03:50:14,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 03:50:14,916 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 03:50:14,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 03:50:14,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 03:50:14,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 03:50:14,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 03:50:14,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 03:50:14,916 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 03:50:14,916 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 03:50:14,916 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 03:50:14,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 03:50:14,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 03:50:14,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 03:50:14,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:50:14,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 03:50:14,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 03:50:14,918 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 03:50:14,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 03:50:14,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 03:50:14,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 03:50:14,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 03:50:14,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 03:50:14,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 03:50:14,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 03:50:14,919 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65cc93bea37c503291576929a444106bffa9d5b7b84b8d294ee7e7120b60ffa5 [2025-03-04 03:50:15,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 03:50:15,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 03:50:15,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 03:50:15,194 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 03:50:15,194 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 03:50:15,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pf.ko-main.cil.out.i [2025-03-04 03:50:16,366 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74080612/d63ea9ae11fe4c9ca0f728c8e522e0b6/FLAG7fb9e3f53 [2025-03-04 03:50:16,810 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 03:50:16,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pf.ko-main.cil.out.i [2025-03-04 03:50:16,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74080612/d63ea9ae11fe4c9ca0f728c8e522e0b6/FLAG7fb9e3f53 [2025-03-04 03:50:16,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74080612/d63ea9ae11fe4c9ca0f728c8e522e0b6 [2025-03-04 03:50:16,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 03:50:16,863 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 03:50:16,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 03:50:16,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 03:50:16,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 03:50:16,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:50:16" (1/1) ... [2025-03-04 03:50:16,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a14da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:16, skipping insertion in model container [2025-03-04 03:50:16,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:50:16" (1/1) ... [2025-03-04 03:50:16,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 03:50:17,499 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pf.ko-main.cil.out.i[138616,138629] [2025-03-04 03:50:17,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:50:17,578 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:50:17,760 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pf.ko-main.cil.out.i[138616,138629] [2025-03-04 03:50:17,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:50:17,839 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:50:17,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:17 WrapperNode [2025-03-04 03:50:17,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:50:17,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:50:17,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:50:17,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:50:17,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:17" (1/1) ... [2025-03-04 03:50:17,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:17" (1/1) ... [2025-03-04 03:50:17,971 INFO L138 Inliner]: procedures = 161, calls = 1531, calls flagged for inlining = 53, calls inlined = 28, statements flattened = 1843 [2025-03-04 03:50:17,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:50:17,972 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:50:17,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:50:17,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:50:17,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:17" (1/1) ... [2025-03-04 03:50:17,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:17" (1/1) ... [2025-03-04 03:50:17,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:17" (1/1) ... [2025-03-04 03:50:18,077 INFO L175 MemorySlicer]: Split 1089 memory accesses to 22 slices as follows [2, 2, 522, 11, 5, 3, 3, 18, 24, 5, 37, 6, 3, 8, 6, 10, 10, 1, 72, 13, 325, 3]. 48 percent of accesses are in the largest equivalence class. The 793 initializations are split as follows [2, 0, 512, 11, 5, 0, 0, 18, 0, 5, 28, 0, 0, 4, 0, 10, 10, 0, 0, 13, 172, 3]. The 195 writes are split as follows [0, 2, 0, 0, 0, 0, 0, 0, 24, 0, 0, 5, 2, 0, 6, 0, 0, 0, 72, 0, 84, 0]. [2025-03-04 03:50:18,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:17" (1/1) ... [2025-03-04 03:50:18,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:17" (1/1) ... [2025-03-04 03:50:18,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:17" (1/1) ... [2025-03-04 03:50:18,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:17" (1/1) ... [2025-03-04 03:50:18,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:17" (1/1) ... [2025-03-04 03:50:18,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:17" (1/1) ... [2025-03-04 03:50:18,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:50:18,249 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:50:18,249 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:50:18,249 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:50:18,250 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:17" (1/1) ... [2025-03-04 03:50:18,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:50:18,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:50:18,278 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 03:50:18,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 03:50:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure pi_release [2025-03-04 03:50:18,302 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_release [2025-03-04 03:50:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure pf_getgeo [2025-03-04 03:50:18,302 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_getgeo [2025-03-04 03:50:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2025-03-04 03:50:18,302 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure pi_disconnect [2025-03-04 03:50:18,303 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_disconnect [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure status_reg [2025-03-04 03:50:18,303 INFO L138 BoogieDeclarations]: Found implementation of procedure status_reg [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 03:50:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_pf_mutex [2025-03-04 03:50:18,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_pf_mutex [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure pf_reset [2025-03-04 03:50:18,304 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_reset [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-04 03:50:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 03:50:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_block [2025-03-04 03:50:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_block [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure pf_wait [2025-03-04 03:50:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_wait [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure read_reg [2025-03-04 03:50:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure read_reg [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 03:50:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_pf_mutex [2025-03-04 03:50:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_pf_mutex [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure pf_check_events [2025-03-04 03:50:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_check_events [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2025-03-04 03:50:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 03:50:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-04 03:50:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-04 03:50:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-04 03:50:18,308 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-04 03:50:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 03:50:18,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 03:50:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2025-03-04 03:50:18,308 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2025-03-04 03:50:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure pf_req_sense [2025-03-04 03:50:18,308 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_req_sense [2025-03-04 03:50:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure pf_completion [2025-03-04 03:50:18,308 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_completion [2025-03-04 03:50:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:50:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-04 03:50:18,308 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-04 03:50:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:50:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2025-03-04 03:50:18,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2025-03-04 03:50:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 03:50:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:50:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:50:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:50:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 03:50:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 03:50:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 03:50:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 03:50:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 03:50:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 03:50:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure pf_atapi [2025-03-04 03:50:18,312 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_atapi [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure pf_command [2025-03-04 03:50:18,312 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_command [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure pf_probe [2025-03-04 03:50:18,312 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_probe [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 03:50:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure pf_identify [2025-03-04 03:50:18,313 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_identify [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure pf_sleep [2025-03-04 03:50:18,313 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_sleep [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure pf_mode_sense [2025-03-04 03:50:18,313 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_mode_sense [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_block [2025-03-04 03:50:18,313 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_block [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 03:50:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-04 03:50:18,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-04 03:50:18,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-04 03:50:18,314 INFO L130 BoogieDeclarations]: Found specification of procedure pi_init [2025-03-04 03:50:18,314 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_init [2025-03-04 03:50:18,314 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_regr [2025-03-04 03:50:18,314 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_regr [2025-03-04 03:50:18,314 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 03:50:18,314 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 03:50:18,314 INFO L130 BoogieDeclarations]: Found specification of procedure pi_connect [2025-03-04 03:50:18,314 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_connect [2025-03-04 03:50:18,314 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2025-03-04 03:50:18,317 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2025-03-04 03:50:18,317 INFO L130 BoogieDeclarations]: Found specification of procedure get_capacity [2025-03-04 03:50:18,317 INFO L138 BoogieDeclarations]: Found implementation of procedure get_capacity [2025-03-04 03:50:18,317 INFO L130 BoogieDeclarations]: Found specification of procedure pf_lock [2025-03-04 03:50:18,317 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_lock [2025-03-04 03:50:18,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:50:18,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:50:18,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:50:18,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 03:50:18,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 03:50:18,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 03:50:18,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 03:50:18,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 03:50:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 03:50:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 03:50:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 03:50:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 03:50:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 03:50:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 03:50:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 03:50:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 03:50:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 03:50:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 03:50:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 03:50:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 03:50:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-04 03:50:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-04 03:50:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure xl [2025-03-04 03:50:18,318 INFO L138 BoogieDeclarations]: Found implementation of procedure xl [2025-03-04 03:50:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:50:18,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:50:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure xs [2025-03-04 03:50:18,318 INFO L138 BoogieDeclarations]: Found implementation of procedure xs [2025-03-04 03:50:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure pf_ioctl [2025-03-04 03:50:18,318 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_ioctl [2025-03-04 03:50:18,689 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:50:18,691 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:50:18,887 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5648: havoc #t~malloc355.base, #t~malloc355.offset; [2025-03-04 03:50:19,170 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4139: call ULTIMATE.dealloc(~#ms_cmd~0.base, ~#ms_cmd~0.offset);havoc ~#ms_cmd~0.base, ~#ms_cmd~0.offset;call ULTIMATE.dealloc(~#buf~1.base, ~#buf~1.offset);havoc ~#buf~1.base, ~#buf~1.offset; [2025-03-04 03:50:19,175 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5683: havoc #t~nondet359; [2025-03-04 03:50:19,178 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5690: havoc #t~nondet360; [2025-03-04 03:50:19,180 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5703: havoc #t~nondet361; [2025-03-04 03:50:19,182 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3444: havoc #t~mem24; [2025-03-04 03:50:19,273 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4065: call ULTIMATE.dealloc(~#expect~0.base, ~#expect~0.offset);havoc ~#expect~0.base, ~#expect~0.offset; [2025-03-04 03:50:19,428 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3927: call ULTIMATE.dealloc(~#rs_cmd~0.base, ~#rs_cmd~0.offset);havoc ~#rs_cmd~0.base, ~#rs_cmd~0.offset;call ULTIMATE.dealloc(~#buf~0.base, ~#buf~0.offset);havoc ~#buf~0.base, ~#buf~0.offset; [2025-03-04 03:50:19,897 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4220: call ULTIMATE.dealloc(pf_get_capacity_~#rc_cmd~0#1.base, pf_get_capacity_~#rc_cmd~0#1.offset);havoc pf_get_capacity_~#rc_cmd~0#1.base, pf_get_capacity_~#rc_cmd~0#1.offset;call ULTIMATE.dealloc(pf_get_capacity_~#buf~2#1.base, pf_get_capacity_~#buf~2#1.offset);havoc pf_get_capacity_~#buf~2#1.base, pf_get_capacity_~#buf~2#1.offset; [2025-03-04 03:50:19,897 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4262: call ULTIMATE.dealloc(~#ms~0#1.base, ~#ms~0#1.offset);havoc ~#ms~0#1.base, ~#ms~0#1.offset;call ULTIMATE.dealloc(~#mf~0#1.base, ~#mf~0#1.offset);havoc ~#mf~0#1.base, ~#mf~0#1.offset;call ULTIMATE.dealloc(~#id~0#1.base, ~#id~0#1.offset);havoc ~#id~0#1.base, ~#id~0#1.offset;call ULTIMATE.dealloc(~#id_cmd~0#1.base, ~#id_cmd~0#1.offset);havoc ~#id_cmd~0#1.base, ~#id_cmd~0#1.offset;call ULTIMATE.dealloc(~#buf~3#1.base, ~#buf~3#1.offset);havoc ~#buf~3#1.base, ~#buf~3#1.offset; [2025-03-04 03:50:19,901 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5718: havoc schedule_timeout_interruptible_#t~nondet364#1; [2025-03-04 03:50:20,044 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4010: call ULTIMATE.dealloc(~#lo_cmd~0.base, ~#lo_cmd~0.offset);havoc ~#lo_cmd~0.base, ~#lo_cmd~0.offset; [2025-03-04 03:50:24,815 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5654: havoc blk_init_queue_#t~ret357#1.base, blk_init_queue_#t~ret357#1.offset; [2025-03-04 03:50:24,815 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5710: havoc register_blkdev_#t~nondet362#1; [2025-03-04 03:50:25,051 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4035: call ULTIMATE.dealloc(pf_eject_~#ej_cmd~0#1.base, pf_eject_~#ej_cmd~0#1.offset);havoc pf_eject_~#ej_cmd~0#1.base, pf_eject_~#ej_cmd~0#1.offset; [2025-03-04 03:50:25,225 INFO L? ?]: Removed 415 outVars from TransFormulas that were not future-live. [2025-03-04 03:50:25,226 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:50:25,252 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:50:25,252 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 03:50:25,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:50:25 BoogieIcfgContainer [2025-03-04 03:50:25,252 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:50:25,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:50:25,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:50:25,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:50:25,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:50:16" (1/3) ... [2025-03-04 03:50:25,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c61a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:50:25, skipping insertion in model container [2025-03-04 03:50:25,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:50:17" (2/3) ... [2025-03-04 03:50:25,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c61a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:50:25, skipping insertion in model container [2025-03-04 03:50:25,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:50:25" (3/3) ... [2025-03-04 03:50:25,263 INFO L128 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pf.ko-main.cil.out.i [2025-03-04 03:50:25,273 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:50:25,276 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pf.ko-main.cil.out.i that has 39 procedures, 581 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 03:50:25,327 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:50:25,336 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;@5c3b8178, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:50:25,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:50:25,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 581 states, 413 states have (on average 1.3559322033898304) internal successors, (560), 429 states have internal predecessors, (560), 128 states have call successors, (128), 38 states have call predecessors, (128), 38 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-04 03:50:25,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 03:50:25,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:25,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:50:25,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:25,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:25,352 INFO L85 PathProgramCache]: Analyzing trace with hash -576588868, now seen corresponding path program 1 times [2025-03-04 03:50:25,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:25,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573056391] [2025-03-04 03:50:25,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:25,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:26,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 03:50:26,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 03:50:26,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:26,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:50:26,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:26,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573056391] [2025-03-04 03:50:26,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573056391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:26,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:50:26,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:50:26,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161120378] [2025-03-04 03:50:26,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:26,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:26,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:26,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:26,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:50:26,736 INFO L87 Difference]: Start difference. First operand has 581 states, 413 states have (on average 1.3559322033898304) internal successors, (560), 429 states have internal predecessors, (560), 128 states have call successors, (128), 38 states have call predecessors, (128), 38 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:50:27,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:27,146 INFO L93 Difference]: Finished difference Result 1610 states and 2315 transitions. [2025-03-04 03:50:27,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:27,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 03:50:27,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:27,169 INFO L225 Difference]: With dead ends: 1610 [2025-03-04 03:50:27,171 INFO L226 Difference]: Without dead ends: 1024 [2025-03-04 03:50:27,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:50:27,181 INFO L435 NwaCegarLoop]: 1107 mSDtfsCounter, 628 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:27,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 1860 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 03:50:27,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2025-03-04 03:50:27,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1010. [2025-03-04 03:50:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 724 states have (on average 1.3370165745856353) internal successors, (968), 737 states have internal predecessors, (968), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (213), 213 states have call predecessors, (213), 213 states have call successors, (213) [2025-03-04 03:50:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1400 transitions. [2025-03-04 03:50:27,305 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1400 transitions. Word has length 16 [2025-03-04 03:50:27,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:27,305 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1400 transitions. [2025-03-04 03:50:27,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:50:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1400 transitions. [2025-03-04 03:50:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 03:50:27,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:27,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:50:27,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 03:50:27,308 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:27,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:27,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1936954679, now seen corresponding path program 1 times [2025-03-04 03:50:27,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:27,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525193254] [2025-03-04 03:50:27,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:27,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:27,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 03:50:27,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 03:50:27,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:27,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:50:28,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:28,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525193254] [2025-03-04 03:50:28,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525193254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:28,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:50:28,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 03:50:28,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132403408] [2025-03-04 03:50:28,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:28,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:28,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:28,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:28,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:50:28,123 INFO L87 Difference]: Start difference. First operand 1010 states and 1400 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:50:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:28,225 INFO L93 Difference]: Finished difference Result 2017 states and 2797 transitions. [2025-03-04 03:50:28,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:28,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 03:50:28,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:28,234 INFO L225 Difference]: With dead ends: 2017 [2025-03-04 03:50:28,234 INFO L226 Difference]: Without dead ends: 1010 [2025-03-04 03:50:28,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:50:28,241 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 779 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:28,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 777 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:50:28,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-03-04 03:50:28,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2025-03-04 03:50:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 724 states have (on average 1.3342541436464088) internal successors, (966), 737 states have internal predecessors, (966), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (213), 213 states have call predecessors, (213), 213 states have call successors, (213) [2025-03-04 03:50:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1398 transitions. [2025-03-04 03:50:28,294 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1398 transitions. Word has length 18 [2025-03-04 03:50:28,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:28,295 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1398 transitions. [2025-03-04 03:50:28,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:50:28,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1398 transitions. [2025-03-04 03:50:28,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 03:50:28,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:28,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:50:28,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:50:28,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:28,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:28,297 INFO L85 PathProgramCache]: Analyzing trace with hash -163061642, now seen corresponding path program 1 times [2025-03-04 03:50:28,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:28,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100896628] [2025-03-04 03:50:28,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:28,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:28,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 03:50:28,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 03:50:28,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:28,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:50:29,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:29,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100896628] [2025-03-04 03:50:29,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100896628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:29,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:50:29,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:50:29,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480003058] [2025-03-04 03:50:29,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:29,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:29,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:29,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:29,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:50:29,149 INFO L87 Difference]: Start difference. First operand 1010 states and 1398 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:50:33,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:50:33,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:33,445 INFO L93 Difference]: Finished difference Result 2423 states and 3344 transitions. [2025-03-04 03:50:33,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:33,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-04 03:50:33,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:33,453 INFO L225 Difference]: With dead ends: 2423 [2025-03-04 03:50:33,453 INFO L226 Difference]: Without dead ends: 1416 [2025-03-04 03:50:33,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:50:33,457 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 745 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:33,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1792 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 03:50:33,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2025-03-04 03:50:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1392. [2025-03-04 03:50:33,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 993 states have (on average 1.3333333333333333) internal successors, (1324), 1010 states have internal predecessors, (1324), 300 states have call successors, (300), 99 states have call predecessors, (300), 98 states have return successors, (294), 294 states have call predecessors, (294), 294 states have call successors, (294) [2025-03-04 03:50:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1918 transitions. [2025-03-04 03:50:33,517 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1918 transitions. Word has length 22 [2025-03-04 03:50:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:33,517 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1918 transitions. [2025-03-04 03:50:33,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:50:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1918 transitions. [2025-03-04 03:50:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 03:50:33,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:33,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:50:33,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 03:50:33,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:33,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:33,519 INFO L85 PathProgramCache]: Analyzing trace with hash -611773278, now seen corresponding path program 1 times [2025-03-04 03:50:33,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:33,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603298649] [2025-03-04 03:50:33,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:33,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:34,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 03:50:34,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 03:50:34,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:34,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:50:34,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:34,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603298649] [2025-03-04 03:50:34,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603298649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:34,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:50:34,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:50:34,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674741416] [2025-03-04 03:50:34,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:34,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:34,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:34,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:34,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:50:34,315 INFO L87 Difference]: Start difference. First operand 1392 states and 1918 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:50:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:34,522 INFO L93 Difference]: Finished difference Result 2799 states and 3861 transitions. [2025-03-04 03:50:34,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:34,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 03:50:34,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:34,532 INFO L225 Difference]: With dead ends: 2799 [2025-03-04 03:50:34,533 INFO L226 Difference]: Without dead ends: 1410 [2025-03-04 03:50:34,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:50:34,538 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 12 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:34,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1543 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:50:34,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2025-03-04 03:50:34,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1394. [2025-03-04 03:50:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 995 states have (on average 1.3326633165829145) internal successors, (1326), 1012 states have internal predecessors, (1326), 300 states have call successors, (300), 99 states have call predecessors, (300), 98 states have return successors, (294), 294 states have call predecessors, (294), 294 states have call successors, (294) [2025-03-04 03:50:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1920 transitions. [2025-03-04 03:50:34,596 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1920 transitions. Word has length 30 [2025-03-04 03:50:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:34,597 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1920 transitions. [2025-03-04 03:50:34,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:50:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1920 transitions. [2025-03-04 03:50:34,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 03:50:34,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:34,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:50:34,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 03:50:34,598 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:34,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:34,599 INFO L85 PathProgramCache]: Analyzing trace with hash 129021693, now seen corresponding path program 1 times [2025-03-04 03:50:34,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:34,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971993559] [2025-03-04 03:50:34,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:34,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:35,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 03:50:35,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 03:50:35,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:35,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:50:35,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:35,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971993559] [2025-03-04 03:50:35,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971993559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:50:35,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429933643] [2025-03-04 03:50:35,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:35,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:35,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:50:35,481 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:50:35,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 03:50:36,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 03:50:36,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 03:50:36,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:36,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:36,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 2935 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 03:50:36,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:50:36,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 03:50:36,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:50:36,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429933643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:36,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:50:36,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:50:36,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895270505] [2025-03-04 03:50:36,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:36,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:36,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:36,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:36,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:36,572 INFO L87 Difference]: Start difference. First operand 1394 states and 1920 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:50:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:36,763 INFO L93 Difference]: Finished difference Result 2823 states and 3897 transitions. [2025-03-04 03:50:36,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:36,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-03-04 03:50:36,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:36,772 INFO L225 Difference]: With dead ends: 2823 [2025-03-04 03:50:36,774 INFO L226 Difference]: Without dead ends: 1432 [2025-03-04 03:50:36,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:36,781 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 16 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:36,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1542 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:50:36,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2025-03-04 03:50:36,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1398. [2025-03-04 03:50:36,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 999 states have (on average 1.3313313313313313) internal successors, (1330), 1016 states have internal predecessors, (1330), 300 states have call successors, (300), 99 states have call predecessors, (300), 98 states have return successors, (294), 294 states have call predecessors, (294), 294 states have call successors, (294) [2025-03-04 03:50:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1924 transitions. [2025-03-04 03:50:36,835 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1924 transitions. Word has length 34 [2025-03-04 03:50:36,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:36,835 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 1924 transitions. [2025-03-04 03:50:36,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:50:36,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1924 transitions. [2025-03-04 03:50:36,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 03:50:36,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:36,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:50:36,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 03:50:37,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:37,037 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:37,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:37,038 INFO L85 PathProgramCache]: Analyzing trace with hash -617309044, now seen corresponding path program 1 times [2025-03-04 03:50:37,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:37,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876697211] [2025-03-04 03:50:37,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:37,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:37,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 03:50:37,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 03:50:37,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:37,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:50:37,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:37,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876697211] [2025-03-04 03:50:37,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876697211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:50:37,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718193730] [2025-03-04 03:50:37,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:37,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:37,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:50:37,896 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:50:37,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 03:50:38,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 03:50:39,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 03:50:39,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:39,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:39,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 3006 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:50:39,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:50:39,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 03:50:39,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:50:39,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718193730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:39,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:50:39,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:50:39,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718158733] [2025-03-04 03:50:39,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:39,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:39,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:39,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:39,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:39,075 INFO L87 Difference]: Start difference. First operand 1398 states and 1924 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 03:50:39,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:39,205 INFO L93 Difference]: Finished difference Result 2825 states and 3897 transitions. [2025-03-04 03:50:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:39,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2025-03-04 03:50:39,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:39,213 INFO L225 Difference]: With dead ends: 2825 [2025-03-04 03:50:39,213 INFO L226 Difference]: Without dead ends: 1430 [2025-03-04 03:50:39,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:39,219 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 22 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:39,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1533 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:50:39,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2025-03-04 03:50:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1430. [2025-03-04 03:50:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1023 states have (on average 1.3333333333333333) internal successors, (1364), 1040 states have internal predecessors, (1364), 308 states have call successors, (308), 99 states have call predecessors, (308), 98 states have return successors, (302), 302 states have call predecessors, (302), 302 states have call successors, (302) [2025-03-04 03:50:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1974 transitions. [2025-03-04 03:50:39,269 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1974 transitions. Word has length 39 [2025-03-04 03:50:39,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:39,269 INFO L471 AbstractCegarLoop]: Abstraction has 1430 states and 1974 transitions. [2025-03-04 03:50:39,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 03:50:39,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1974 transitions. [2025-03-04 03:50:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 03:50:39,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:39,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:50:39,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 03:50:39,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 03:50:39,473 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:39,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:39,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1487668537, now seen corresponding path program 1 times [2025-03-04 03:50:39,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:39,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677651335] [2025-03-04 03:50:39,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:39,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:40,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 03:50:40,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 03:50:40,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:40,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:50:40,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:40,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677651335] [2025-03-04 03:50:40,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677651335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:50:40,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874952854] [2025-03-04 03:50:40,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:40,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:40,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:50:40,256 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:50:40,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 03:50:41,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 03:50:41,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 03:50:41,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:41,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:41,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 3097 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:50:41,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:50:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 03:50:41,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:50:41,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874952854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:41,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:50:41,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:50:41,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676902247] [2025-03-04 03:50:41,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:41,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:41,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:41,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:41,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:41,429 INFO L87 Difference]: Start difference. First operand 1430 states and 1974 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:50:41,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:41,556 INFO L93 Difference]: Finished difference Result 1452 states and 2000 transitions. [2025-03-04 03:50:41,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:41,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-03-04 03:50:41,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:41,586 INFO L225 Difference]: With dead ends: 1452 [2025-03-04 03:50:41,586 INFO L226 Difference]: Without dead ends: 1441 [2025-03-04 03:50:41,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:41,588 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 784 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:41,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 803 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:50:41,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2025-03-04 03:50:41,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1430. [2025-03-04 03:50:41,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1023 states have (on average 1.332355816226784) internal successors, (1363), 1040 states have internal predecessors, (1363), 308 states have call successors, (308), 99 states have call predecessors, (308), 98 states have return successors, (302), 302 states have call predecessors, (302), 302 states have call successors, (302) [2025-03-04 03:50:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1973 transitions. [2025-03-04 03:50:41,634 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1973 transitions. Word has length 50 [2025-03-04 03:50:41,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:41,635 INFO L471 AbstractCegarLoop]: Abstraction has 1430 states and 1973 transitions. [2025-03-04 03:50:41,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:50:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1973 transitions. [2025-03-04 03:50:41,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 03:50:41,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:41,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:50:41,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 03:50:41,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:41,838 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:41,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:41,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1459039386, now seen corresponding path program 1 times [2025-03-04 03:50:41,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:41,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759226771] [2025-03-04 03:50:41,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:41,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:42,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 03:50:42,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 03:50:42,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:42,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:50:42,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:42,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759226771] [2025-03-04 03:50:42,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759226771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:50:42,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454079510] [2025-03-04 03:50:42,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:42,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:42,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:50:42,724 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:50:42,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 03:50:43,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 03:50:43,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 03:50:43,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:43,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:43,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 3092 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:50:43,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:50:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 03:50:44,068 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:50:44,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454079510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:44,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:50:44,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:50:44,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525157095] [2025-03-04 03:50:44,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:44,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:44,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:44,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:44,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:44,069 INFO L87 Difference]: Start difference. First operand 1430 states and 1973 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:50:48,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:50:48,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:48,201 INFO L93 Difference]: Finished difference Result 1432 states and 1974 transitions. [2025-03-04 03:50:48,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:48,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-03-04 03:50:48,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:48,208 INFO L225 Difference]: With dead ends: 1432 [2025-03-04 03:50:48,209 INFO L226 Difference]: Without dead ends: 1429 [2025-03-04 03:50:48,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:48,210 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 740 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:48,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 775 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 03:50:48,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2025-03-04 03:50:48,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1429. [2025-03-04 03:50:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1023 states have (on average 1.3313782991202345) internal successors, (1362), 1039 states have internal predecessors, (1362), 307 states have call successors, (307), 99 states have call predecessors, (307), 98 states have return successors, (302), 302 states have call predecessors, (302), 302 states have call successors, (302) [2025-03-04 03:50:48,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1971 transitions. [2025-03-04 03:50:48,262 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1971 transitions. Word has length 50 [2025-03-04 03:50:48,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:48,262 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 1971 transitions. [2025-03-04 03:50:48,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:50:48,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1971 transitions. [2025-03-04 03:50:48,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 03:50:48,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:48,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:50:48,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 03:50:48,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:48,464 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:48,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:48,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2013898341, now seen corresponding path program 1 times [2025-03-04 03:50:48,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:48,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060153225] [2025-03-04 03:50:48,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:48,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:48,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 03:50:48,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 03:50:48,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:48,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:49,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:50:49,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:49,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060153225] [2025-03-04 03:50:49,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060153225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:50:49,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725330560] [2025-03-04 03:50:49,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:49,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:49,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:50:49,226 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:50:49,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 03:50:50,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 03:50:50,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 03:50:50,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:50,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:50,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 3094 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:50:50,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:50:50,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 03:50:50,457 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:50:50,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725330560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:50,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:50:50,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:50:50,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835716538] [2025-03-04 03:50:50,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:50,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:50,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:50,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:50,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:50,458 INFO L87 Difference]: Start difference. First operand 1429 states and 1971 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:50:54,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:50:54,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:50:54,620 INFO L93 Difference]: Finished difference Result 1431 states and 1972 transitions. [2025-03-04 03:50:54,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:50:54,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-03-04 03:50:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:50:54,628 INFO L225 Difference]: With dead ends: 1431 [2025-03-04 03:50:54,628 INFO L226 Difference]: Without dead ends: 1428 [2025-03-04 03:50:54,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:54,630 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 737 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:50:54,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 773 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 03:50:54,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2025-03-04 03:50:54,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2025-03-04 03:50:54,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1023 states have (on average 1.3304007820136852) internal successors, (1361), 1038 states have internal predecessors, (1361), 306 states have call successors, (306), 99 states have call predecessors, (306), 98 states have return successors, (302), 302 states have call predecessors, (302), 302 states have call successors, (302) [2025-03-04 03:50:54,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1969 transitions. [2025-03-04 03:50:54,679 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1969 transitions. Word has length 51 [2025-03-04 03:50:54,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:50:54,679 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 1969 transitions. [2025-03-04 03:50:54,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:50:54,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1969 transitions. [2025-03-04 03:50:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 03:50:54,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:50:54,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:50:54,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 03:50:54,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:54,881 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:50:54,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:50:54,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1994182841, now seen corresponding path program 1 times [2025-03-04 03:50:54,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:50:54,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518141005] [2025-03-04 03:50:54,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:54,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:50:55,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 03:50:55,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 03:50:55,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:55,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:50:55,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:50:55,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518141005] [2025-03-04 03:50:55,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518141005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:50:55,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741254364] [2025-03-04 03:50:55,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:50:55,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:50:55,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:50:55,611 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:50:55,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 03:50:56,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 03:50:56,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 03:50:56,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:50:56,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:50:56,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 3096 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:50:56,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:50:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 03:50:56,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:50:56,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741254364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:50:56,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:50:56,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:50:56,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542715958] [2025-03-04 03:50:56,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:50:56,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:50:56,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:50:56,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:50:56,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:50:56,872 INFO L87 Difference]: Start difference. First operand 1428 states and 1969 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:51:00,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:51:01,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:51:01,021 INFO L93 Difference]: Finished difference Result 1430 states and 1970 transitions. [2025-03-04 03:51:01,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:51:01,021 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2025-03-04 03:51:01,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:51:01,028 INFO L225 Difference]: With dead ends: 1430 [2025-03-04 03:51:01,028 INFO L226 Difference]: Without dead ends: 1427 [2025-03-04 03:51:01,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:51:01,029 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 734 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:51:01,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 771 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 03:51:01,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2025-03-04 03:51:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1427. [2025-03-04 03:51:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1023 states have (on average 1.3294232649071358) internal successors, (1360), 1037 states have internal predecessors, (1360), 305 states have call successors, (305), 99 states have call predecessors, (305), 98 states have return successors, (302), 302 states have call predecessors, (302), 302 states have call successors, (302) [2025-03-04 03:51:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1967 transitions. [2025-03-04 03:51:01,106 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1967 transitions. Word has length 52 [2025-03-04 03:51:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:51:01,106 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1967 transitions. [2025-03-04 03:51:01,106 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:51:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1967 transitions. [2025-03-04 03:51:01,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 03:51:01,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:51:01,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:51:01,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 03:51:01,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:51:01,309 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:51:01,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:51:01,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1690648922, now seen corresponding path program 1 times [2025-03-04 03:51:01,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:51:01,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22873653] [2025-03-04 03:51:01,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:01,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:51:01,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 03:51:01,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 03:51:01,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:01,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:02,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:51:02,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:51:02,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22873653] [2025-03-04 03:51:02,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22873653] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:51:02,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658683907] [2025-03-04 03:51:02,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:02,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:51:02,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:51:02,015 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:51:02,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 03:51:02,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 03:51:03,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 03:51:03,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:03,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:03,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 3098 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:51:03,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:51:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 03:51:03,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:51:03,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658683907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:51:03,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:51:03,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:51:03,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150146760] [2025-03-04 03:51:03,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:51:03,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:51:03,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:51:03,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:51:03,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:51:03,336 INFO L87 Difference]: Start difference. First operand 1427 states and 1967 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:51:07,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:51:07,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:51:07,540 INFO L93 Difference]: Finished difference Result 1680 states and 2301 transitions. [2025-03-04 03:51:07,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:51:07,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2025-03-04 03:51:07,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:51:07,548 INFO L225 Difference]: With dead ends: 1680 [2025-03-04 03:51:07,548 INFO L226 Difference]: Without dead ends: 1648 [2025-03-04 03:51:07,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:51:07,549 INFO L435 NwaCegarLoop]: 1079 mSDtfsCounter, 661 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:51:07,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1465 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 03:51:07,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2025-03-04 03:51:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2025-03-04 03:51:07,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1173 states have (on average 1.3205456095481671) internal successors, (1549), 1187 states have internal predecessors, (1549), 357 states have call successors, (357), 118 states have call predecessors, (357), 117 states have return successors, (356), 356 states have call predecessors, (356), 356 states have call successors, (356) [2025-03-04 03:51:07,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2262 transitions. [2025-03-04 03:51:07,664 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2262 transitions. Word has length 53 [2025-03-04 03:51:07,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:51:07,665 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2262 transitions. [2025-03-04 03:51:07,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:51:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2262 transitions. [2025-03-04 03:51:07,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 03:51:07,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:51:07,671 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:51:07,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 03:51:07,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:51:07,872 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:51:07,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:51:07,872 INFO L85 PathProgramCache]: Analyzing trace with hash -566424988, now seen corresponding path program 1 times [2025-03-04 03:51:07,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:51:07,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882621003] [2025-03-04 03:51:07,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:07,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:51:08,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 03:51:08,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 03:51:08,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:08,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:51:08,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:51:08,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882621003] [2025-03-04 03:51:08,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882621003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:51:08,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202115235] [2025-03-04 03:51:08,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:08,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:51:08,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:51:08,664 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:51:08,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 03:51:09,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 03:51:09,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 03:51:09,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:09,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:09,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 3191 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 03:51:09,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:51:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 03:51:09,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:51:09,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202115235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:51:09,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:51:09,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:51:09,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642630] [2025-03-04 03:51:09,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:51:09,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:51:09,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:51:09,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:51:09,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:51:09,875 INFO L87 Difference]: Start difference. First operand 1648 states and 2262 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 03:51:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:51:10,112 INFO L93 Difference]: Finished difference Result 4209 states and 5755 transitions. [2025-03-04 03:51:10,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:51:10,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2025-03-04 03:51:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:51:10,122 INFO L225 Difference]: With dead ends: 4209 [2025-03-04 03:51:10,122 INFO L226 Difference]: Without dead ends: 2564 [2025-03-04 03:51:10,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:51:10,127 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 701 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:51:10,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 1408 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:51:10,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2025-03-04 03:51:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2561. [2025-03-04 03:51:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 1826 states have (on average 1.3170865279299013) internal successors, (2405), 1847 states have internal predecessors, (2405), 541 states have call successors, (541), 194 states have call predecessors, (541), 193 states have return successors, (540), 540 states have call predecessors, (540), 540 states have call successors, (540) [2025-03-04 03:51:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 3486 transitions. [2025-03-04 03:51:10,225 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 3486 transitions. Word has length 71 [2025-03-04 03:51:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:51:10,225 INFO L471 AbstractCegarLoop]: Abstraction has 2561 states and 3486 transitions. [2025-03-04 03:51:10,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 03:51:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 3486 transitions. [2025-03-04 03:51:10,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 03:51:10,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:51:10,229 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:51:10,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 03:51:10,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 03:51:10,431 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:51:10,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:51:10,431 INFO L85 PathProgramCache]: Analyzing trace with hash 165976272, now seen corresponding path program 1 times [2025-03-04 03:51:10,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:51:10,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375128490] [2025-03-04 03:51:10,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:10,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:51:10,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 03:51:10,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 03:51:10,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:10,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:51:11,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:51:11,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375128490] [2025-03-04 03:51:11,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375128490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:51:11,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552163932] [2025-03-04 03:51:11,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:11,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:51:11,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:51:11,202 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:51:11,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 03:51:12,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 03:51:12,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 03:51:12,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:12,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:12,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 3740 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 03:51:12,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:51:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 03:51:12,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:51:12,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552163932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:51:12,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:51:12,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:51:12,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918054665] [2025-03-04 03:51:12,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:51:12,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:51:12,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:51:12,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:51:12,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:51:12,500 INFO L87 Difference]: Start difference. First operand 2561 states and 3486 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 03:51:12,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:51:12,638 INFO L93 Difference]: Finished difference Result 5126 states and 7119 transitions. [2025-03-04 03:51:12,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:51:12,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2025-03-04 03:51:12,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:51:12,651 INFO L225 Difference]: With dead ends: 5126 [2025-03-04 03:51:12,651 INFO L226 Difference]: Without dead ends: 2568 [2025-03-04 03:51:12,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:51:12,662 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 0 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:51:12,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1479 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:51:12,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2025-03-04 03:51:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2568. [2025-03-04 03:51:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2568 states, 1833 states have (on average 1.3158756137479541) internal successors, (2412), 1854 states have internal predecessors, (2412), 541 states have call successors, (541), 194 states have call predecessors, (541), 193 states have return successors, (540), 540 states have call predecessors, (540), 540 states have call successors, (540) [2025-03-04 03:51:12,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3493 transitions. [2025-03-04 03:51:12,766 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3493 transitions. Word has length 135 [2025-03-04 03:51:12,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:51:12,767 INFO L471 AbstractCegarLoop]: Abstraction has 2568 states and 3493 transitions. [2025-03-04 03:51:12,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 03:51:12,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3493 transitions. [2025-03-04 03:51:12,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 03:51:12,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:51:12,771 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:51:12,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 03:51:12,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 03:51:12,972 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:51:12,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:51:12,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1504455710, now seen corresponding path program 1 times [2025-03-04 03:51:12,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:51:12,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086526027] [2025-03-04 03:51:12,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:12,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:51:13,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 03:51:13,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 03:51:13,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:13,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:51:13,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:51:13,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086526027] [2025-03-04 03:51:13,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086526027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:51:13,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119856949] [2025-03-04 03:51:13,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:13,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:51:13,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:51:13,803 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:51:13,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 03:51:14,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 03:51:15,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 03:51:15,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:15,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:15,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 3745 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:51:15,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:51:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 03:51:15,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:51:15,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119856949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:51:15,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:51:15,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:51:15,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124486916] [2025-03-04 03:51:15,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:51:15,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:51:15,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:51:15,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:51:15,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:51:15,214 INFO L87 Difference]: Start difference. First operand 2568 states and 3493 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 03:51:15,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:51:15,395 INFO L93 Difference]: Finished difference Result 5147 states and 7077 transitions. [2025-03-04 03:51:15,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:51:15,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2025-03-04 03:51:15,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:51:15,408 INFO L225 Difference]: With dead ends: 5147 [2025-03-04 03:51:15,408 INFO L226 Difference]: Without dead ends: 2582 [2025-03-04 03:51:15,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:51:15,416 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 1 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:51:15,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1475 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:51:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2025-03-04 03:51:15,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 2575. [2025-03-04 03:51:15,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2575 states, 1840 states have (on average 1.3146739130434784) internal successors, (2419), 1861 states have internal predecessors, (2419), 541 states have call successors, (541), 194 states have call predecessors, (541), 193 states have return successors, (540), 540 states have call predecessors, (540), 540 states have call successors, (540) [2025-03-04 03:51:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2575 states and 3500 transitions. [2025-03-04 03:51:15,669 INFO L78 Accepts]: Start accepts. Automaton has 2575 states and 3500 transitions. Word has length 136 [2025-03-04 03:51:15,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:51:15,670 INFO L471 AbstractCegarLoop]: Abstraction has 2575 states and 3500 transitions. [2025-03-04 03:51:15,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 03:51:15,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 3500 transitions. [2025-03-04 03:51:15,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 03:51:15,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:51:15,675 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:51:15,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 03:51:15,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 03:51:15,877 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:51:15,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:51:15,877 INFO L85 PathProgramCache]: Analyzing trace with hash -592344142, now seen corresponding path program 1 times [2025-03-04 03:51:15,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:51:15,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15582596] [2025-03-04 03:51:15,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:15,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:51:16,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 03:51:16,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 03:51:16,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:16,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 03:51:16,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:51:16,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15582596] [2025-03-04 03:51:16,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15582596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:51:16,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720163509] [2025-03-04 03:51:16,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:16,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:51:16,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:51:16,779 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:51:16,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 03:51:18,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 03:51:18,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 03:51:18,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:18,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:18,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 4160 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 03:51:18,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:51:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 03:51:18,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:51:18,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720163509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:51:18,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:51:18,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 03:51:18,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929996993] [2025-03-04 03:51:18,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:51:18,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:51:18,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:51:18,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:51:18,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:51:18,527 INFO L87 Difference]: Start difference. First operand 2575 states and 3500 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 03:51:18,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:51:18,741 INFO L93 Difference]: Finished difference Result 5161 states and 7154 transitions. [2025-03-04 03:51:18,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:51:18,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 192 [2025-03-04 03:51:18,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:51:18,755 INFO L225 Difference]: With dead ends: 5161 [2025-03-04 03:51:18,755 INFO L226 Difference]: Without dead ends: 2589 [2025-03-04 03:51:18,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:51:18,767 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 0 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:51:18,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2215 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:51:18,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2025-03-04 03:51:18,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2589. [2025-03-04 03:51:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2589 states, 1854 states have (on average 1.3122977346278317) internal successors, (2433), 1875 states have internal predecessors, (2433), 541 states have call successors, (541), 194 states have call predecessors, (541), 193 states have return successors, (540), 540 states have call predecessors, (540), 540 states have call successors, (540) [2025-03-04 03:51:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 3514 transitions. [2025-03-04 03:51:18,866 INFO L78 Accepts]: Start accepts. Automaton has 2589 states and 3514 transitions. Word has length 192 [2025-03-04 03:51:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:51:18,866 INFO L471 AbstractCegarLoop]: Abstraction has 2589 states and 3514 transitions. [2025-03-04 03:51:18,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 03:51:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 3514 transitions. [2025-03-04 03:51:18,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-04 03:51:18,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:51:18,872 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:51:18,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 03:51:19,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 03:51:19,073 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:51:19,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:51:19,074 INFO L85 PathProgramCache]: Analyzing trace with hash 695070164, now seen corresponding path program 1 times [2025-03-04 03:51:19,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:51:19,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905885021] [2025-03-04 03:51:19,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:19,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:51:19,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-04 03:51:19,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-04 03:51:19,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:19,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 03:51:19,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:51:19,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905885021] [2025-03-04 03:51:19,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905885021] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:51:19,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878150670] [2025-03-04 03:51:19,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:19,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:51:19,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:51:19,943 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:51:19,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 03:51:21,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-04 03:51:21,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-04 03:51:21,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:21,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:21,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 4156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:51:21,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:51:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 03:51:21,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:51:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 03:51:22,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878150670] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:51:22,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:51:22,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 03:51:22,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360348943] [2025-03-04 03:51:22,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:51:22,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:51:22,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:51:22,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:51:22,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:51:22,401 INFO L87 Difference]: Start difference. First operand 2589 states and 3514 transitions. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-04 03:51:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:51:22,696 INFO L93 Difference]: Finished difference Result 5256 states and 7151 transitions. [2025-03-04 03:51:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:51:22,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 194 [2025-03-04 03:51:22,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:51:22,713 INFO L225 Difference]: With dead ends: 5256 [2025-03-04 03:51:22,713 INFO L226 Difference]: Without dead ends: 2670 [2025-03-04 03:51:22,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:51:22,721 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 78 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:51:22,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1497 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:51:22,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2025-03-04 03:51:22,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2670. [2025-03-04 03:51:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2670 states, 1935 states have (on average 1.317829457364341) internal successors, (2550), 1956 states have internal predecessors, (2550), 541 states have call successors, (541), 194 states have call predecessors, (541), 193 states have return successors, (540), 540 states have call predecessors, (540), 540 states have call successors, (540) [2025-03-04 03:51:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 3631 transitions. [2025-03-04 03:51:22,822 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 3631 transitions. Word has length 194 [2025-03-04 03:51:22,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:51:22,822 INFO L471 AbstractCegarLoop]: Abstraction has 2670 states and 3631 transitions. [2025-03-04 03:51:22,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-04 03:51:22,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 3631 transitions. [2025-03-04 03:51:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-04 03:51:22,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:51:22,828 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:51:22,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 03:51:23,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 03:51:23,029 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:51:23,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:51:23,029 INFO L85 PathProgramCache]: Analyzing trace with hash 357654501, now seen corresponding path program 2 times [2025-03-04 03:51:23,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:51:23,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809895943] [2025-03-04 03:51:23,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:51:23,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:51:23,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 206 statements into 2 equivalence classes. [2025-03-04 03:51:23,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 97 of 206 statements. [2025-03-04 03:51:23,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 03:51:23,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 03:51:23,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:51:23,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809895943] [2025-03-04 03:51:23,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809895943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:51:23,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:51:23,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:51:23,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528599548] [2025-03-04 03:51:23,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:51:23,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:51:23,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:51:23,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:51:23,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:51:23,832 INFO L87 Difference]: Start difference. First operand 2670 states and 3631 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 03:51:24,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:51:24,090 INFO L93 Difference]: Finished difference Result 5365 states and 7409 transitions. [2025-03-04 03:51:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:51:24,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 206 [2025-03-04 03:51:24,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:51:24,112 INFO L225 Difference]: With dead ends: 5365 [2025-03-04 03:51:24,112 INFO L226 Difference]: Without dead ends: 2698 [2025-03-04 03:51:24,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:51:24,121 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 0 mSDsluCounter, 2219 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2960 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:51:24,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2960 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:51:24,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2025-03-04 03:51:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2698. [2025-03-04 03:51:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2698 states, 1956 states have (on average 1.3144171779141105) internal successors, (2571), 1977 states have internal predecessors, (2571), 541 states have call successors, (541), 194 states have call predecessors, (541), 200 states have return successors, (568), 547 states have call predecessors, (568), 540 states have call successors, (568) [2025-03-04 03:51:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 3680 transitions. [2025-03-04 03:51:24,226 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 3680 transitions. Word has length 206 [2025-03-04 03:51:24,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:51:24,228 INFO L471 AbstractCegarLoop]: Abstraction has 2698 states and 3680 transitions. [2025-03-04 03:51:24,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 03:51:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 3680 transitions. [2025-03-04 03:51:24,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-04 03:51:24,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:51:24,233 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:51:24,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 03:51:24,234 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:51:24,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:51:24,234 INFO L85 PathProgramCache]: Analyzing trace with hash 980162691, now seen corresponding path program 1 times [2025-03-04 03:51:24,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:51:24,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266133833] [2025-03-04 03:51:24,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:24,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:51:24,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-04 03:51:24,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-04 03:51:24,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:24,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-04 03:51:25,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:51:25,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266133833] [2025-03-04 03:51:25,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266133833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:51:25,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:51:25,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:51:25,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443433052] [2025-03-04 03:51:25,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:51:25,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:51:25,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:51:25,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:51:25,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:51:25,178 INFO L87 Difference]: Start difference. First operand 2698 states and 3680 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 03:51:25,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:51:25,370 INFO L93 Difference]: Finished difference Result 5399 states and 7366 transitions. [2025-03-04 03:51:25,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:51:25,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 272 [2025-03-04 03:51:25,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:51:25,397 INFO L225 Difference]: With dead ends: 5399 [2025-03-04 03:51:25,397 INFO L226 Difference]: Without dead ends: 2704 [2025-03-04 03:51:25,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:51:25,406 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 0 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2217 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:51:25,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2217 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:51:25,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-03-04 03:51:25,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2025-03-04 03:51:25,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 1962 states have (on average 1.3134556574923548) internal successors, (2577), 1983 states have internal predecessors, (2577), 541 states have call successors, (541), 194 states have call predecessors, (541), 200 states have return successors, (568), 547 states have call predecessors, (568), 540 states have call successors, (568) [2025-03-04 03:51:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3686 transitions. [2025-03-04 03:51:25,504 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3686 transitions. Word has length 272 [2025-03-04 03:51:25,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:51:25,504 INFO L471 AbstractCegarLoop]: Abstraction has 2704 states and 3686 transitions. [2025-03-04 03:51:25,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 03:51:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3686 transitions. [2025-03-04 03:51:25,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-04 03:51:25,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:51:25,509 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:51:25,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 03:51:25,509 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:51:25,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:51:25,510 INFO L85 PathProgramCache]: Analyzing trace with hash 178449041, now seen corresponding path program 1 times [2025-03-04 03:51:25,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:51:25,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723619958] [2025-03-04 03:51:25,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:25,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:51:26,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-04 03:51:26,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-04 03:51:26,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:26,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 03:51:26,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:51:26,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723619958] [2025-03-04 03:51:26,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723619958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:51:26,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883060768] [2025-03-04 03:51:26,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:26,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:51:26,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:51:26,370 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:51:26,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 03:51:27,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-04 03:51:28,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-04 03:51:28,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:28,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:28,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 4526 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 03:51:28,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:51:28,156 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 03:51:28,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:51:28,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883060768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:51:28,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:51:28,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 03:51:28,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757966531] [2025-03-04 03:51:28,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:51:28,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:51:28,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:51:28,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:51:28,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:51:28,158 INFO L87 Difference]: Start difference. First operand 2704 states and 3686 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 3 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-03-04 03:51:28,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:51:28,350 INFO L93 Difference]: Finished difference Result 5461 states and 7596 transitions. [2025-03-04 03:51:28,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:51:28,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 3 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 275 [2025-03-04 03:51:28,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:51:28,366 INFO L225 Difference]: With dead ends: 5461 [2025-03-04 03:51:28,367 INFO L226 Difference]: Without dead ends: 2760 [2025-03-04 03:51:28,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:51:28,375 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 0 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2235 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:51:28,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2235 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:51:28,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2025-03-04 03:51:28,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2760. [2025-03-04 03:51:28,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2760 states, 1997 states have (on average 1.3114672008012018) internal successors, (2619), 2018 states have internal predecessors, (2619), 562 states have call successors, (562), 194 states have call predecessors, (562), 200 states have return successors, (589), 568 states have call predecessors, (589), 561 states have call successors, (589) [2025-03-04 03:51:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 3770 transitions. [2025-03-04 03:51:28,524 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 3770 transitions. Word has length 275 [2025-03-04 03:51:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:51:28,524 INFO L471 AbstractCegarLoop]: Abstraction has 2760 states and 3770 transitions. [2025-03-04 03:51:28,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 3 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-03-04 03:51:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 3770 transitions. [2025-03-04 03:51:28,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-04 03:51:28,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:51:28,532 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:51:28,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 03:51:28,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:51:28,733 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:51:28,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:51:28,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1609988901, now seen corresponding path program 1 times [2025-03-04 03:51:28,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:51:28,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894991288] [2025-03-04 03:51:28,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:28,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:51:29,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-04 03:51:29,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-04 03:51:29,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:29,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-03-04 03:51:29,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:51:29,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894991288] [2025-03-04 03:51:29,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894991288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:51:29,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323064772] [2025-03-04 03:51:29,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:29,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:51:29,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:51:29,593 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:51:29,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 03:51:31,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-04 03:51:31,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-04 03:51:31,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:31,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:31,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 4532 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:51:31,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:51:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-03-04 03:51:31,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:51:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-03-04 03:51:32,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323064772] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:51:32,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:51:32,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 03:51:32,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473805652] [2025-03-04 03:51:32,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:51:32,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:51:32,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:51:32,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:51:32,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:51:32,301 INFO L87 Difference]: Start difference. First operand 2760 states and 3770 transitions. Second operand has 7 states, 7 states have (on average 28.0) internal successors, (196), 7 states have internal predecessors, (196), 5 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) [2025-03-04 03:51:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:51:32,604 INFO L93 Difference]: Finished difference Result 5784 states and 7960 transitions. [2025-03-04 03:51:32,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:51:32,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 28.0) internal successors, (196), 7 states have internal predecessors, (196), 5 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) Word has length 277 [2025-03-04 03:51:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:51:32,618 INFO L225 Difference]: With dead ends: 5784 [2025-03-04 03:51:32,618 INFO L226 Difference]: Without dead ends: 3027 [2025-03-04 03:51:32,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:51:32,623 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 79 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:51:32,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 2246 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:51:32,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2025-03-04 03:51:32,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 3027. [2025-03-04 03:51:32,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3027 states, 2195 states have (on average 1.3107061503416857) internal successors, (2877), 2216 states have internal predecessors, (2877), 631 states have call successors, (631), 194 states have call predecessors, (631), 200 states have return successors, (658), 637 states have call predecessors, (658), 630 states have call successors, (658) [2025-03-04 03:51:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3027 states to 3027 states and 4166 transitions. [2025-03-04 03:51:32,736 INFO L78 Accepts]: Start accepts. Automaton has 3027 states and 4166 transitions. Word has length 277 [2025-03-04 03:51:32,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:51:32,737 INFO L471 AbstractCegarLoop]: Abstraction has 3027 states and 4166 transitions. [2025-03-04 03:51:32,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.0) internal successors, (196), 7 states have internal predecessors, (196), 5 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) [2025-03-04 03:51:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 3027 states and 4166 transitions. [2025-03-04 03:51:32,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-04 03:51:32,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:51:32,743 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:51:32,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 03:51:32,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:51:32,944 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:51:32,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:51:32,944 INFO L85 PathProgramCache]: Analyzing trace with hash 801604028, now seen corresponding path program 1 times [2025-03-04 03:51:32,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:51:32,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567049874] [2025-03-04 03:51:32,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:51:32,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:51:33,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-04 03:51:33,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-04 03:51:33,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:51:33,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-03-04 03:51:33,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:51:33,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567049874] [2025-03-04 03:51:33,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567049874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:51:33,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:51:33,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:51:33,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902662651] [2025-03-04 03:51:33,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:51:33,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:51:33,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:51:33,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:51:33,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:51:33,987 INFO L87 Difference]: Start difference. First operand 3027 states and 4166 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 03:51:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:51:34,173 INFO L93 Difference]: Finished difference Result 6066 states and 8371 transitions. [2025-03-04 03:51:34,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:51:34,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 278 [2025-03-04 03:51:34,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:51:34,190 INFO L225 Difference]: With dead ends: 6066 [2025-03-04 03:51:34,190 INFO L226 Difference]: Without dead ends: 3042 [2025-03-04 03:51:34,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:51:34,199 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 1 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2948 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:51:34,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2948 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:51:34,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2025-03-04 03:51:34,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 3042. [2025-03-04 03:51:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3042 states, 2207 states have (on average 1.3090167648391482) internal successors, (2889), 2228 states have internal predecessors, (2889), 631 states have call successors, (631), 194 states have call predecessors, (631), 203 states have return successors, (682), 640 states have call predecessors, (682), 630 states have call successors, (682) [2025-03-04 03:51:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 4202 transitions. [2025-03-04 03:51:34,317 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 4202 transitions. Word has length 278 [2025-03-04 03:51:34,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:51:34,317 INFO L471 AbstractCegarLoop]: Abstraction has 3042 states and 4202 transitions. [2025-03-04 03:51:34,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 03:51:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 4202 transitions. [2025-03-04 03:51:34,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-04 03:51:34,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:51:34,324 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:51:34,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 03:51:34,325 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:51:34,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:51:34,325 INFO L85 PathProgramCache]: Analyzing trace with hash 748963391, now seen corresponding path program 2 times [2025-03-04 03:51:34,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:51:34,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327233640] [2025-03-04 03:51:34,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:51:34,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:51:34,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 298 statements into 2 equivalence classes. [2025-03-04 03:51:34,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 92 of 298 statements. [2025-03-04 03:51:34,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 03:51:34,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:51:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 03:51:35,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:51:35,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327233640] [2025-03-04 03:51:35,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327233640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:51:35,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:51:35,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:51:35,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177554347] [2025-03-04 03:51:35,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:51:35,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:51:35,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:51:35,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:51:35,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:51:35,146 INFO L87 Difference]: Start difference. First operand 3042 states and 4202 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 3 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 03:51:39,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:51:39,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:51:39,356 INFO L93 Difference]: Finished difference Result 3042 states and 4202 transitions. [2025-03-04 03:51:39,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:51:39,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 3 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 298 [2025-03-04 03:51:39,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:51:39,364 INFO L225 Difference]: With dead ends: 3042 [2025-03-04 03:51:39,364 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 03:51:39,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:51:39,371 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 384 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:51:39,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1444 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 03:51:39,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 03:51:39,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 03:51:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:51:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 03:51:39,375 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 298 [2025-03-04 03:51:39,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:51:39,375 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 03:51:39,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 3 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 03:51:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 03:51:39,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 03:51:39,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 03:51:39,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 03:51:39,381 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:51:39,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.