./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-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-?-e2fb8be-m [2025-03-08 19:01:40,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:01:41,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 19:01:41,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:01:41,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:01:41,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:01:41,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:01:41,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:01:41,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:01:41,045 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:01:41,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:01:41,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:01:41,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:01:41,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:01:41,046 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:01:41,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:01:41,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:01:41,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:01:41,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:01:41,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:01:41,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:01:41,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:01:41,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:01:41,047 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:01:41,047 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:01:41,047 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:01:41,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:01:41,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:01:41,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:01:41,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:01:41,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:01:41,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:01:41,048 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:01:41,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:01:41,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:01:41,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:01:41,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:01:41,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:01:41,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:01:41,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:01:41,049 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-08 19:01:41,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:01:41,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:01:41,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:01:41,305 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:01:41,305 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:01:41,306 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-08 19:01:42,484 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de008d04/bfae7c073289461980ffe4f27365d6c6/FLAG95861d419 [2025-03-08 19:01:42,911 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:01:42,912 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-08 19:01:42,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de008d04/bfae7c073289461980ffe4f27365d6c6/FLAG95861d419 [2025-03-08 19:01:42,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de008d04/bfae7c073289461980ffe4f27365d6c6 [2025-03-08 19:01:42,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:01:42,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:01:42,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:01:42,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:01:42,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:01:42,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:01:42" (1/1) ... [2025-03-08 19:01:42,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e1efd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:42, skipping insertion in model container [2025-03-08 19:01:42,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:01:42" (1/1) ... [2025-03-08 19:01:43,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:01:43,889 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-08 19:01:43,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:01:43,984 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:01:44,167 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-08 19:01:44,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:01:44,235 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:01:44,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44 WrapperNode [2025-03-08 19:01:44,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:01:44,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:01:44,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:01:44,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:01:44,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,350 INFO L138 Inliner]: procedures = 161, calls = 1531, calls flagged for inlining = 53, calls inlined = 28, statements flattened = 1843 [2025-03-08 19:01:44,351 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:01:44,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:01:44,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:01:44,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:01:44,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,505 INFO L175 MemorySlicer]: Split 1089 memory accesses to 22 slices as follows [2, 2, 11, 1, 5, 3, 3, 6, 522, 5, 6, 37, 3, 8, 72, 10, 10, 24, 18, 13, 325, 3]. 48 percent of accesses are in the largest equivalence class. The 793 initializations are split as follows [2, 0, 11, 0, 5, 0, 0, 0, 512, 5, 0, 28, 3, 4, 0, 10, 10, 0, 18, 13, 172, 0]. The 195 writes are split as follows [0, 2, 0, 0, 0, 0, 0, 6, 0, 0, 5, 0, 0, 0, 72, 0, 0, 24, 0, 0, 84, 2]. [2025-03-08 19:01:44,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,558 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:01:44,612 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:01:44,612 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:01:44,612 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:01:44,613 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (1/1) ... [2025-03-08 19:01:44,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:01:44,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:01:44,641 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 19:01:44,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 19:01:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure pi_release [2025-03-08 19:01:44,663 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_release [2025-03-08 19:01:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure pf_getgeo [2025-03-08 19:01:44,663 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_getgeo [2025-03-08 19:01:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2025-03-08 19:01:44,663 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2025-03-08 19:01:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure pi_disconnect [2025-03-08 19:01:44,663 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_disconnect [2025-03-08 19:01:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure status_reg [2025-03-08 19:01:44,663 INFO L138 BoogieDeclarations]: Found implementation of procedure status_reg [2025-03-08 19:01:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 19:01:44,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 19:01:44,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 19:01:44,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 19:01:44,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 19:01:44,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 19:01:44,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 19:01:44,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 19:01:44,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 19:01:44,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 19:01:44,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-08 19:01:44,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-08 19:01:44,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-08 19:01:44,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-08 19:01:44,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-08 19:01:44,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-08 19:01:44,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-08 19:01:44,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-08 19:01:44,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-08 19:01:44,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-08 19:01:44,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_pf_mutex [2025-03-08 19:01:44,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_pf_mutex [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure pf_reset [2025-03-08 19:01:44,667 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_reset [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-08 19:01:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_block [2025-03-08 19:01:44,668 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_block [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure pf_wait [2025-03-08 19:01:44,668 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_wait [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read_reg [2025-03-08 19:01:44,668 INFO L138 BoogieDeclarations]: Found implementation of procedure read_reg [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 19:01:44,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_pf_mutex [2025-03-08 19:01:44,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_pf_mutex [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure pf_check_events [2025-03-08 19:01:44,668 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_check_events [2025-03-08 19:01:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2025-03-08 19:01:44,668 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2025-03-08 19:01:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:01:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:01:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:01:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:01:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:01:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:01:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 19:01:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 19:01:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-08 19:01:44,672 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:01:44,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2025-03-08 19:01:44,672 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure pf_req_sense [2025-03-08 19:01:44,672 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_req_sense [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure pf_completion [2025-03-08 19:01:44,672 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_completion [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-08 19:01:44,672 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:01:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2025-03-08 19:01:44,673 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure pf_atapi [2025-03-08 19:01:44,673 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_atapi [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure pf_command [2025-03-08 19:01:44,673 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_command [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure pf_probe [2025-03-08 19:01:44,673 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_probe [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 19:01:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 19:01:44,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 19:01:44,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 19:01:44,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 19:01:44,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 19:01:44,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 19:01:44,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-08 19:01:44,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-08 19:01:44,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure pf_identify [2025-03-08 19:01:44,677 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_identify [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure pf_sleep [2025-03-08 19:01:44,677 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_sleep [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure pf_mode_sense [2025-03-08 19:01:44,677 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_mode_sense [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_block [2025-03-08 19:01:44,677 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_block [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-08 19:01:44,677 INFO L130 BoogieDeclarations]: Found specification of procedure pi_init [2025-03-08 19:01:44,677 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_init [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_regr [2025-03-08 19:01:44,678 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_regr [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 19:01:44,678 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure pi_connect [2025-03-08 19:01:44,678 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_connect [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2025-03-08 19:01:44,678 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure get_capacity [2025-03-08 19:01:44,678 INFO L138 BoogieDeclarations]: Found implementation of procedure get_capacity [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure pf_lock [2025-03-08 19:01:44,678 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_lock [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure xl [2025-03-08 19:01:44,678 INFO L138 BoogieDeclarations]: Found implementation of procedure xl [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:01:44,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:01:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure xs [2025-03-08 19:01:44,681 INFO L138 BoogieDeclarations]: Found implementation of procedure xs [2025-03-08 19:01:44,681 INFO L130 BoogieDeclarations]: Found specification of procedure pf_ioctl [2025-03-08 19:01:44,681 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_ioctl [2025-03-08 19:01:45,051 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:01:45,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:01:45,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5648: havoc #t~malloc355.base, #t~malloc355.offset; [2025-03-08 19:01:45,579 INFO L1307 $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-08 19:01:45,588 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5683: havoc #t~nondet359; [2025-03-08 19:01:45,590 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5690: havoc #t~nondet360; [2025-03-08 19:01:45,592 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5703: havoc #t~nondet361; [2025-03-08 19:01:45,594 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3444: havoc #t~mem24; [2025-03-08 19:01:45,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4065: call ULTIMATE.dealloc(~#expect~0.base, ~#expect~0.offset);havoc ~#expect~0.base, ~#expect~0.offset; [2025-03-08 19:01:45,895 INFO L1307 $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-08 19:01:46,396 INFO L1307 $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-08 19:01:46,397 INFO L1307 $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-08 19:01:46,401 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5718: havoc schedule_timeout_interruptible_#t~nondet364#1; [2025-03-08 19:01:46,579 INFO L1307 $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-08 19:01:51,499 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5654: havoc blk_init_queue_#t~ret357#1.base, blk_init_queue_#t~ret357#1.offset; [2025-03-08 19:01:51,499 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5710: havoc register_blkdev_#t~nondet362#1; [2025-03-08 19:01:51,814 INFO L1307 $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-08 19:01:52,012 INFO L? ?]: Removed 415 outVars from TransFormulas that were not future-live. [2025-03-08 19:01:52,013 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:01:52,055 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:01:52,055 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 19:01:52,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:01:52 BoogieIcfgContainer [2025-03-08 19:01:52,056 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:01:52,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:01:52,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:01:52,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:01:52,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:01:42" (1/3) ... [2025-03-08 19:01:52,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ef0760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:01:52, skipping insertion in model container [2025-03-08 19:01:52,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:01:44" (2/3) ... [2025-03-08 19:01:52,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ef0760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:01:52, skipping insertion in model container [2025-03-08 19:01:52,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:01:52" (3/3) ... [2025-03-08 19:01:52,069 INFO L128 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pf.ko-main.cil.out.i [2025-03-08 19:01:52,082 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:01:52,086 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-08 19:01:52,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:01:52,158 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;@3babd34f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:01:52,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 19:01:52,164 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-08 19:01:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 19:01:52,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:01:52,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:01:52,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:01:52,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:01:52,173 INFO L85 PathProgramCache]: Analyzing trace with hash -576588868, now seen corresponding path program 1 times [2025-03-08 19:01:52,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:01:52,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033752196] [2025-03-08 19:01:52,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:01:52,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:01:52,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 19:01:53,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 19:01:53,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:01:53,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:01:53,462 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-08 19:01:53,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:01:53,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033752196] [2025-03-08 19:01:53,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033752196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:01:53,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:01:53,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:01:53,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450443504] [2025-03-08 19:01:53,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:01:53,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:01:53,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:01:53,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:01:53,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:01:53,485 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-08 19:01:53,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:01:53,865 INFO L93 Difference]: Finished difference Result 1610 states and 2315 transitions. [2025-03-08 19:01:53,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:01:53,868 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-08 19:01:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:01:53,885 INFO L225 Difference]: With dead ends: 1610 [2025-03-08 19:01:53,887 INFO L226 Difference]: Without dead ends: 1024 [2025-03-08 19:01:53,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:01:53,901 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:01:53,903 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.2s Time] [2025-03-08 19:01:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2025-03-08 19:01:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1010. [2025-03-08 19:01:54,014 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-08 19:01:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1400 transitions. [2025-03-08 19:01:54,030 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1400 transitions. Word has length 16 [2025-03-08 19:01:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:01:54,031 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1400 transitions. [2025-03-08 19:01:54,031 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-08 19:01:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1400 transitions. [2025-03-08 19:01:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 19:01:54,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:01:54,032 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-08 19:01:54,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 19:01:54,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:01:54,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:01:54,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1936954679, now seen corresponding path program 1 times [2025-03-08 19:01:54,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:01:54,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910763690] [2025-03-08 19:01:54,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:01:54,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:01:54,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 19:01:54,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 19:01:54,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:01:54,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:01:54,932 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-08 19:01:54,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:01:54,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910763690] [2025-03-08 19:01:54,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910763690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:01:54,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:01:54,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 19:01:54,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96033609] [2025-03-08 19:01:54,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:01:54,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:01:54,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:01:54,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:01:54,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:01:54,935 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-08 19:01:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:01:55,029 INFO L93 Difference]: Finished difference Result 2017 states and 2797 transitions. [2025-03-08 19:01:55,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:01:55,030 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-08 19:01:55,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:01:55,039 INFO L225 Difference]: With dead ends: 2017 [2025-03-08 19:01:55,039 INFO L226 Difference]: Without dead ends: 1010 [2025-03-08 19:01:55,042 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-08 19:01:55,043 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-08 19:01:55,043 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-08 19:01:55,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-03-08 19:01:55,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2025-03-08 19:01:55,090 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-08 19:01:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1398 transitions. [2025-03-08 19:01:55,099 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1398 transitions. Word has length 18 [2025-03-08 19:01:55,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:01:55,099 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1398 transitions. [2025-03-08 19:01:55,099 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-08 19:01:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1398 transitions. [2025-03-08 19:01:55,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 19:01:55,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:01:55,101 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-08 19:01:55,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:01:55,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:01:55,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:01:55,101 INFO L85 PathProgramCache]: Analyzing trace with hash -163061642, now seen corresponding path program 1 times [2025-03-08 19:01:55,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:01:55,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777479343] [2025-03-08 19:01:55,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:01:55,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:01:55,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 19:01:55,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 19:01:55,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:01:55,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:01:55,896 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-08 19:01:55,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:01:55,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777479343] [2025-03-08 19:01:55,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777479343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:01:55,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:01:55,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:01:55,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554598977] [2025-03-08 19:01:55,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:01:55,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:01:55,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:01:55,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:01:55,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:01:55,898 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-08 19:01:59,939 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-08 19:02:00,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:00,131 INFO L93 Difference]: Finished difference Result 2423 states and 3344 transitions. [2025-03-08 19:02:00,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:00,132 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-08 19:02:00,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:00,140 INFO L225 Difference]: With dead ends: 2423 [2025-03-08 19:02:00,140 INFO L226 Difference]: Without dead ends: 1416 [2025-03-08 19:02:00,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:02:00,144 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 745 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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-08 19:02:00,144 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-08 19:02:00,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2025-03-08 19:02:00,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1392. [2025-03-08 19:02:00,247 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-08 19:02:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1918 transitions. [2025-03-08 19:02:00,255 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1918 transitions. Word has length 22 [2025-03-08 19:02:00,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:00,256 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1918 transitions. [2025-03-08 19:02:00,256 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-08 19:02:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1918 transitions. [2025-03-08 19:02:00,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 19:02:00,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:00,257 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-08 19:02:00,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:02:00,257 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:00,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:00,258 INFO L85 PathProgramCache]: Analyzing trace with hash -611773278, now seen corresponding path program 1 times [2025-03-08 19:02:00,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:00,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328210206] [2025-03-08 19:02:00,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:00,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:00,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 19:02:00,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 19:02:00,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:00,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:01,103 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-08 19:02:01,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:01,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328210206] [2025-03-08 19:02:01,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328210206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:01,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:02:01,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:02:01,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321961004] [2025-03-08 19:02:01,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:01,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:01,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:01,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:01,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:02:01,105 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-08 19:02:01,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:01,301 INFO L93 Difference]: Finished difference Result 2799 states and 3861 transitions. [2025-03-08 19:02:01,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:01,302 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-08 19:02:01,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:01,315 INFO L225 Difference]: With dead ends: 2799 [2025-03-08 19:02:01,315 INFO L226 Difference]: Without dead ends: 1410 [2025-03-08 19:02:01,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:02:01,323 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-08 19:02:01,327 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-08 19:02:01,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2025-03-08 19:02:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1394. [2025-03-08 19:02:01,382 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-08 19:02:01,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1920 transitions. [2025-03-08 19:02:01,390 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1920 transitions. Word has length 30 [2025-03-08 19:02:01,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:01,390 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1920 transitions. [2025-03-08 19:02:01,390 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-08 19:02:01,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1920 transitions. [2025-03-08 19:02:01,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 19:02:01,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:01,392 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-08 19:02:01,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:02:01,392 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:01,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:01,392 INFO L85 PathProgramCache]: Analyzing trace with hash 129021693, now seen corresponding path program 1 times [2025-03-08 19:02:01,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:01,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635530866] [2025-03-08 19:02:01,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:01,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:01,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 19:02:01,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 19:02:01,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:01,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:02,243 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-08 19:02:02,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:02,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635530866] [2025-03-08 19:02:02,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635530866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:02,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112048649] [2025-03-08 19:02:02,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:02,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:02,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:02,246 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:02:02,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 19:02:03,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 19:02:03,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 19:02:03,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:03,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:03,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 2935 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 19:02:03,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:03,455 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-08 19:02:03,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:03,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112048649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:03,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:03,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:03,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588857896] [2025-03-08 19:02:03,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:03,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:03,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:03,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:03,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:03,457 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-08 19:02:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:03,639 INFO L93 Difference]: Finished difference Result 2823 states and 3897 transitions. [2025-03-08 19:02:03,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:03,639 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-08 19:02:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:03,649 INFO L225 Difference]: With dead ends: 2823 [2025-03-08 19:02:03,649 INFO L226 Difference]: Without dead ends: 1432 [2025-03-08 19:02:03,655 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-08 19:02:03,656 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-08 19:02:03,656 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-08 19:02:03,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2025-03-08 19:02:03,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1398. [2025-03-08 19:02:03,697 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-08 19:02:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1924 transitions. [2025-03-08 19:02:03,704 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1924 transitions. Word has length 34 [2025-03-08 19:02:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:03,705 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 1924 transitions. [2025-03-08 19:02:03,705 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-08 19:02:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1924 transitions. [2025-03-08 19:02:03,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 19:02:03,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:03,706 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-08 19:02:03,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 19:02:03,906 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-08 19:02:03,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:03,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:03,907 INFO L85 PathProgramCache]: Analyzing trace with hash -617309044, now seen corresponding path program 1 times [2025-03-08 19:02:03,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:03,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922244247] [2025-03-08 19:02:03,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:03,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:04,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 19:02:04,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 19:02:04,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:04,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:04,751 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-08 19:02:04,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:04,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922244247] [2025-03-08 19:02:04,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922244247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:04,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747081626] [2025-03-08 19:02:04,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:04,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:04,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:04,754 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:02:04,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 19:02:05,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 19:02:05,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 19:02:05,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:05,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:05,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 3006 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:05,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:05,940 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-08 19:02:05,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:05,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747081626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:05,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:05,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:05,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879887398] [2025-03-08 19:02:05,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:05,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:05,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:05,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:05,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:05,941 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-08 19:02:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:06,084 INFO L93 Difference]: Finished difference Result 2825 states and 3897 transitions. [2025-03-08 19:02:06,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:06,085 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-08 19:02:06,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:06,093 INFO L225 Difference]: With dead ends: 2825 [2025-03-08 19:02:06,093 INFO L226 Difference]: Without dead ends: 1430 [2025-03-08 19:02:06,099 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-08 19:02:06,100 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-08 19:02:06,100 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-08 19:02:06,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2025-03-08 19:02:06,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1430. [2025-03-08 19:02:06,147 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-08 19:02:06,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1974 transitions. [2025-03-08 19:02:06,153 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1974 transitions. Word has length 39 [2025-03-08 19:02:06,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:06,153 INFO L471 AbstractCegarLoop]: Abstraction has 1430 states and 1974 transitions. [2025-03-08 19:02:06,153 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-08 19:02:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1974 transitions. [2025-03-08 19:02:06,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 19:02:06,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:06,155 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-08 19:02:06,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 19:02:06,355 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-08 19:02:06,356 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:06,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:06,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1487668537, now seen corresponding path program 1 times [2025-03-08 19:02:06,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:06,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035294284] [2025-03-08 19:02:06,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:06,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:06,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 19:02:07,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 19:02:07,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:07,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:07,254 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-08 19:02:07,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:07,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035294284] [2025-03-08 19:02:07,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035294284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:07,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331113141] [2025-03-08 19:02:07,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:07,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:07,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:07,259 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:02:07,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 19:02:08,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 19:02:08,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 19:02:08,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:08,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:08,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 3097 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:08,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:08,381 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-08 19:02:08,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:08,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331113141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:08,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:08,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:08,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98452030] [2025-03-08 19:02:08,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:08,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:08,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:08,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:08,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:08,383 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-08 19:02:08,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:08,492 INFO L93 Difference]: Finished difference Result 1452 states and 2000 transitions. [2025-03-08 19:02:08,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:08,492 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-08 19:02:08,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:08,499 INFO L225 Difference]: With dead ends: 1452 [2025-03-08 19:02:08,499 INFO L226 Difference]: Without dead ends: 1441 [2025-03-08 19:02:08,500 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-08 19:02:08,500 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-08 19:02:08,500 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-08 19:02:08,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2025-03-08 19:02:08,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1430. [2025-03-08 19:02:08,540 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-08 19:02:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1973 transitions. [2025-03-08 19:02:08,547 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1973 transitions. Word has length 50 [2025-03-08 19:02:08,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:08,548 INFO L471 AbstractCegarLoop]: Abstraction has 1430 states and 1973 transitions. [2025-03-08 19:02:08,548 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-08 19:02:08,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1973 transitions. [2025-03-08 19:02:08,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 19:02:08,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:08,550 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-08 19:02:08,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 19:02:08,750 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-08 19:02:08,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:08,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:08,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1459039386, now seen corresponding path program 1 times [2025-03-08 19:02:08,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:08,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447993434] [2025-03-08 19:02:08,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:08,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:09,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 19:02:09,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 19:02:09,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:09,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:09,516 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-08 19:02:09,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:09,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447993434] [2025-03-08 19:02:09,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447993434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:09,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320403629] [2025-03-08 19:02:09,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:09,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:09,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:09,519 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-08 19:02:09,520 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-08 19:02:10,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 19:02:10,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 19:02:10,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:10,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:10,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 3092 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:10,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:10,741 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-08 19:02:10,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:10,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320403629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:10,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:10,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:10,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919858431] [2025-03-08 19:02:10,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:10,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:10,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:10,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:10,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:10,743 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-08 19:02:14,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:02:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:14,904 INFO L93 Difference]: Finished difference Result 1432 states and 1974 transitions. [2025-03-08 19:02:14,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:14,905 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-08 19:02:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:14,913 INFO L225 Difference]: With dead ends: 1432 [2025-03-08 19:02:14,913 INFO L226 Difference]: Without dead ends: 1429 [2025-03-08 19:02:14,914 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-08 19:02:14,914 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-08 19:02:14,915 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-08 19:02:14,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2025-03-08 19:02:14,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1429. [2025-03-08 19:02:14,985 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-08 19:02:14,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1971 transitions. [2025-03-08 19:02:14,992 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1971 transitions. Word has length 50 [2025-03-08 19:02:14,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:14,992 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 1971 transitions. [2025-03-08 19:02:14,992 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-08 19:02:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1971 transitions. [2025-03-08 19:02:14,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 19:02:14,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:14,994 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-08 19:02:15,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 19:02:15,195 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-08 19:02:15,195 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:15,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:15,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2013898341, now seen corresponding path program 1 times [2025-03-08 19:02:15,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:15,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821766659] [2025-03-08 19:02:15,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:15,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:15,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 19:02:15,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 19:02:15,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:15,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:16,023 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-08 19:02:16,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:16,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821766659] [2025-03-08 19:02:16,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821766659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:16,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165179579] [2025-03-08 19:02:16,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:16,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:16,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:16,026 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-08 19:02:16,028 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-08 19:02:16,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 19:02:17,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 19:02:17,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:17,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:17,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 3094 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:17,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:17,337 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-08 19:02:17,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:17,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165179579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:17,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:17,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:17,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610629948] [2025-03-08 19:02:17,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:17,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:17,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:17,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:17,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:17,338 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-08 19:02:21,377 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-08 19:02:21,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:21,494 INFO L93 Difference]: Finished difference Result 1431 states and 1972 transitions. [2025-03-08 19:02:21,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:21,494 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-08 19:02:21,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:21,502 INFO L225 Difference]: With dead ends: 1431 [2025-03-08 19:02:21,502 INFO L226 Difference]: Without dead ends: 1428 [2025-03-08 19:02:21,502 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-08 19:02:21,503 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-08 19:02:21,503 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-08 19:02:21,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2025-03-08 19:02:21,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2025-03-08 19:02:21,545 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-08 19:02:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1969 transitions. [2025-03-08 19:02:21,551 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1969 transitions. Word has length 51 [2025-03-08 19:02:21,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:21,551 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 1969 transitions. [2025-03-08 19:02:21,551 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-08 19:02:21,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1969 transitions. [2025-03-08 19:02:21,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 19:02:21,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:21,553 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-08 19:02:21,565 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-08 19:02:21,753 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-08 19:02:21,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:21,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:21,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1994182841, now seen corresponding path program 1 times [2025-03-08 19:02:21,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:21,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897282771] [2025-03-08 19:02:21,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:21,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:22,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 19:02:22,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 19:02:22,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:22,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:22,489 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-08 19:02:22,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:22,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897282771] [2025-03-08 19:02:22,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897282771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:22,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291049324] [2025-03-08 19:02:22,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:22,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:22,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:22,492 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-08 19:02:22,493 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-08 19:02:23,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 19:02:23,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 19:02:23,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:23,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:23,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 3096 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:23,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:23,777 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-08 19:02:23,777 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:23,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291049324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:23,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:23,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:23,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867147929] [2025-03-08 19:02:23,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:23,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:23,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:23,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:23,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:23,778 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-08 19:02:27,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:02:27,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:27,932 INFO L93 Difference]: Finished difference Result 1430 states and 1970 transitions. [2025-03-08 19:02:27,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:27,933 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-08 19:02:27,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:27,939 INFO L225 Difference]: With dead ends: 1430 [2025-03-08 19:02:27,939 INFO L226 Difference]: Without dead ends: 1427 [2025-03-08 19:02:27,939 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-08 19:02:27,940 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-08 19:02:27,940 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-08 19:02:27,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2025-03-08 19:02:28,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1427. [2025-03-08 19:02:28,004 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-08 19:02:28,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1967 transitions. [2025-03-08 19:02:28,009 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1967 transitions. Word has length 52 [2025-03-08 19:02:28,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:28,010 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1967 transitions. [2025-03-08 19:02:28,010 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-08 19:02:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1967 transitions. [2025-03-08 19:02:28,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 19:02:28,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:28,011 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-08 19:02:28,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 19:02:28,211 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-08 19:02:28,211 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:28,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:28,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1690648922, now seen corresponding path program 1 times [2025-03-08 19:02:28,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:28,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184015308] [2025-03-08 19:02:28,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:28,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:28,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 19:02:28,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 19:02:28,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:28,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:28,921 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-08 19:02:28,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:28,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184015308] [2025-03-08 19:02:28,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184015308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:28,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218395623] [2025-03-08 19:02:28,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:28,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:28,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:28,924 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-08 19:02:28,925 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-08 19:02:29,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 19:02:30,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 19:02:30,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:30,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:30,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 3098 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:30,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:30,276 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-08 19:02:30,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:30,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218395623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:30,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:30,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:30,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498770528] [2025-03-08 19:02:30,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:30,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:30,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:30,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:30,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:30,277 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-08 19:02:34,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:02:34,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:34,505 INFO L93 Difference]: Finished difference Result 1680 states and 2301 transitions. [2025-03-08 19:02:34,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:34,505 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-08 19:02:34,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:34,511 INFO L225 Difference]: With dead ends: 1680 [2025-03-08 19:02:34,511 INFO L226 Difference]: Without dead ends: 1648 [2025-03-08 19:02:34,512 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-08 19:02:34,512 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-08 19:02:34,513 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-08 19:02:34,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2025-03-08 19:02:34,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2025-03-08 19:02:34,565 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-08 19:02:34,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2262 transitions. [2025-03-08 19:02:34,573 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2262 transitions. Word has length 53 [2025-03-08 19:02:34,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:34,574 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2262 transitions. [2025-03-08 19:02:34,574 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-08 19:02:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2262 transitions. [2025-03-08 19:02:34,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 19:02:34,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:34,578 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-08 19:02:34,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 19:02:34,778 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-08 19:02:34,778 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:34,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:34,779 INFO L85 PathProgramCache]: Analyzing trace with hash -566424988, now seen corresponding path program 1 times [2025-03-08 19:02:34,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:34,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420930856] [2025-03-08 19:02:34,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:34,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:35,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 19:02:35,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 19:02:35,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:35,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:35,522 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-08 19:02:35,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:35,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420930856] [2025-03-08 19:02:35,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420930856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:35,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947130018] [2025-03-08 19:02:35,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:35,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:35,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:35,525 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-08 19:02:35,527 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-08 19:02:36,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 19:02:36,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 19:02:36,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:36,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:36,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 3191 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 19:02:36,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:36,783 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-08 19:02:36,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:36,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947130018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:36,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:36,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:36,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160726565] [2025-03-08 19:02:36,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:36,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:36,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:36,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:36,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:36,784 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-08 19:02:37,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:37,080 INFO L93 Difference]: Finished difference Result 4209 states and 5755 transitions. [2025-03-08 19:02:37,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:37,081 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-08 19:02:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:37,093 INFO L225 Difference]: With dead ends: 4209 [2025-03-08 19:02:37,093 INFO L226 Difference]: Without dead ends: 2564 [2025-03-08 19:02:37,099 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-08 19:02:37,100 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 701 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-08 19:02:37,100 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-08 19:02:37,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2025-03-08 19:02:37,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2561. [2025-03-08 19:02:37,255 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-08 19:02:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 3486 transitions. [2025-03-08 19:02:37,269 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 3486 transitions. Word has length 71 [2025-03-08 19:02:37,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:37,270 INFO L471 AbstractCegarLoop]: Abstraction has 2561 states and 3486 transitions. [2025-03-08 19:02:37,270 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-08 19:02:37,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 3486 transitions. [2025-03-08 19:02:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 19:02:37,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:37,278 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-08 19:02:37,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 19:02:37,483 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-08 19:02:37,483 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:37,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:37,483 INFO L85 PathProgramCache]: Analyzing trace with hash 165976272, now seen corresponding path program 1 times [2025-03-08 19:02:37,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:37,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388546499] [2025-03-08 19:02:37,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:37,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:38,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 19:02:38,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 19:02:38,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:38,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:38,321 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-08 19:02:38,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:38,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388546499] [2025-03-08 19:02:38,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388546499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:38,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445436809] [2025-03-08 19:02:38,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:38,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:38,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:38,324 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-08 19:02:38,325 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-08 19:02:39,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 19:02:39,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 19:02:39,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:39,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:39,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 3740 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 19:02:39,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:39,693 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-08 19:02:39,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:39,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445436809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:39,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:39,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:39,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632682963] [2025-03-08 19:02:39,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:39,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:39,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:39,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:39,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:39,694 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-08 19:02:39,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:39,905 INFO L93 Difference]: Finished difference Result 5126 states and 7119 transitions. [2025-03-08 19:02:39,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:39,906 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-08 19:02:39,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:39,921 INFO L225 Difference]: With dead ends: 5126 [2025-03-08 19:02:39,922 INFO L226 Difference]: Without dead ends: 2568 [2025-03-08 19:02:39,928 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-08 19:02:39,929 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-08 19:02:39,930 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-08 19:02:39,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2025-03-08 19:02:40,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2568. [2025-03-08 19:02:40,024 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-08 19:02:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3493 transitions. [2025-03-08 19:02:40,035 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3493 transitions. Word has length 135 [2025-03-08 19:02:40,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:40,035 INFO L471 AbstractCegarLoop]: Abstraction has 2568 states and 3493 transitions. [2025-03-08 19:02:40,036 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-08 19:02:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3493 transitions. [2025-03-08 19:02:40,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 19:02:40,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:40,039 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-08 19:02:40,054 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-08 19:02:40,240 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-08 19:02:40,240 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:40,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:40,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1504455710, now seen corresponding path program 1 times [2025-03-08 19:02:40,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:40,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114241831] [2025-03-08 19:02:40,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:40,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:40,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 19:02:40,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 19:02:40,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:40,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:41,100 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-08 19:02:41,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:41,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114241831] [2025-03-08 19:02:41,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114241831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:41,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914921164] [2025-03-08 19:02:41,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:41,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:41,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:41,115 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-08 19:02:41,115 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-08 19:02:42,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 19:02:42,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 19:02:42,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:42,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:42,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 3745 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:42,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:42,589 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-08 19:02:42,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:42,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914921164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:42,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:42,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:02:42,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458019550] [2025-03-08 19:02:42,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:42,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:02:42,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:42,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:02:42,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:42,591 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-08 19:02:42,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:42,818 INFO L93 Difference]: Finished difference Result 5147 states and 7077 transitions. [2025-03-08 19:02:42,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:02:42,819 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-08 19:02:42,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:42,832 INFO L225 Difference]: With dead ends: 5147 [2025-03-08 19:02:42,833 INFO L226 Difference]: Without dead ends: 2582 [2025-03-08 19:02:42,839 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-08 19:02:42,840 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-08 19:02:42,840 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-08 19:02:42,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2025-03-08 19:02:42,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 2575. [2025-03-08 19:02:42,937 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-08 19:02:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2575 states and 3500 transitions. [2025-03-08 19:02:42,946 INFO L78 Accepts]: Start accepts. Automaton has 2575 states and 3500 transitions. Word has length 136 [2025-03-08 19:02:42,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:42,946 INFO L471 AbstractCegarLoop]: Abstraction has 2575 states and 3500 transitions. [2025-03-08 19:02:42,947 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-08 19:02:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 3500 transitions. [2025-03-08 19:02:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 19:02:42,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:42,953 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-08 19:02:42,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 19:02:43,153 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-08 19:02:43,153 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:43,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:43,154 INFO L85 PathProgramCache]: Analyzing trace with hash -592344142, now seen corresponding path program 1 times [2025-03-08 19:02:43,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:43,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869539763] [2025-03-08 19:02:43,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:43,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:43,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 19:02:43,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 19:02:43,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:43,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:43,983 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-08 19:02:43,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:43,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869539763] [2025-03-08 19:02:43,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869539763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:43,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280878632] [2025-03-08 19:02:43,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:43,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:43,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:43,986 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-08 19:02:43,987 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-08 19:02:45,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 19:02:45,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 19:02:45,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:45,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:45,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 4160 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 19:02:45,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:45,550 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-08 19:02:45,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:45,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280878632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:45,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:45,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 19:02:45,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107869044] [2025-03-08 19:02:45,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:45,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:02:45,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:45,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:02:45,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:02:45,551 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-08 19:02:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:45,704 INFO L93 Difference]: Finished difference Result 5161 states and 7154 transitions. [2025-03-08 19:02:45,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:02:45,704 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-08 19:02:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:45,718 INFO L225 Difference]: With dead ends: 5161 [2025-03-08 19:02:45,718 INFO L226 Difference]: Without dead ends: 2589 [2025-03-08 19:02:45,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 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-08 19:02:45,729 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-08 19:02:45,729 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-08 19:02:45,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2025-03-08 19:02:45,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2589. [2025-03-08 19:02:45,804 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-08 19:02:45,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 3514 transitions. [2025-03-08 19:02:45,813 INFO L78 Accepts]: Start accepts. Automaton has 2589 states and 3514 transitions. Word has length 192 [2025-03-08 19:02:45,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:45,813 INFO L471 AbstractCegarLoop]: Abstraction has 2589 states and 3514 transitions. [2025-03-08 19:02:45,813 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-08 19:02:45,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 3514 transitions. [2025-03-08 19:02:45,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 19:02:45,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:45,817 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-08 19:02:45,833 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-08 19:02:46,018 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-08 19:02:46,018 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:46,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:46,019 INFO L85 PathProgramCache]: Analyzing trace with hash 695070164, now seen corresponding path program 1 times [2025-03-08 19:02:46,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:46,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129998853] [2025-03-08 19:02:46,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:46,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:46,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 19:02:46,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 19:02:46,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:46,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:46,965 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-08 19:02:46,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:46,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129998853] [2025-03-08 19:02:46,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129998853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:46,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569643417] [2025-03-08 19:02:46,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:46,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:46,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:46,967 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-08 19:02:46,968 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-08 19:02:48,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 19:02:48,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 19:02:48,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:48,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:48,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 4156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:48,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:48,577 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-08 19:02:48,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:02:49,270 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-08 19:02:49,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569643417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 19:02:49,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 19:02:49,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 19:02:49,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305891484] [2025-03-08 19:02:49,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 19:02:49,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 19:02:49,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:49,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 19:02:49,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:02:49,276 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-08 19:02:49,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:49,551 INFO L93 Difference]: Finished difference Result 5256 states and 7151 transitions. [2025-03-08 19:02:49,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:02:49,552 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-08 19:02:49,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:49,563 INFO L225 Difference]: With dead ends: 5256 [2025-03-08 19:02:49,563 INFO L226 Difference]: Without dead ends: 2670 [2025-03-08 19:02:49,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 385 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-08 19:02:49,571 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-08 19:02:49,571 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-08 19:02:49,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2025-03-08 19:02:49,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2670. [2025-03-08 19:02:49,652 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-08 19:02:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 3631 transitions. [2025-03-08 19:02:49,663 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 3631 transitions. Word has length 194 [2025-03-08 19:02:49,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:49,663 INFO L471 AbstractCegarLoop]: Abstraction has 2670 states and 3631 transitions. [2025-03-08 19:02:49,663 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-08 19:02:49,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 3631 transitions. [2025-03-08 19:02:49,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 19:02:49,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:49,669 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-08 19:02:49,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 19:02:49,869 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-08 19:02:49,870 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:49,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:49,870 INFO L85 PathProgramCache]: Analyzing trace with hash 357654501, now seen corresponding path program 2 times [2025-03-08 19:02:49,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:49,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148516951] [2025-03-08 19:02:49,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 19:02:49,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:50,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 206 statements into 2 equivalence classes. [2025-03-08 19:02:50,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 97 of 206 statements. [2025-03-08 19:02:50,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 19:02:50,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:50,711 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-08 19:02:50,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:50,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148516951] [2025-03-08 19:02:50,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148516951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:50,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:02:50,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:02:50,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387614970] [2025-03-08 19:02:50,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:50,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:02:50,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:50,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:02:50,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:02:50,712 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-08 19:02:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:50,931 INFO L93 Difference]: Finished difference Result 5365 states and 7409 transitions. [2025-03-08 19:02:50,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:02:50,932 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-08 19:02:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:50,946 INFO L225 Difference]: With dead ends: 5365 [2025-03-08 19:02:50,946 INFO L226 Difference]: Without dead ends: 2698 [2025-03-08 19:02:50,954 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-08 19:02:50,955 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-08 19:02:50,955 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-08 19:02:50,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2025-03-08 19:02:51,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2698. [2025-03-08 19:02:51,121 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-08 19:02:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 3680 transitions. [2025-03-08 19:02:51,135 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 3680 transitions. Word has length 206 [2025-03-08 19:02:51,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:51,137 INFO L471 AbstractCegarLoop]: Abstraction has 2698 states and 3680 transitions. [2025-03-08 19:02:51,137 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-08 19:02:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 3680 transitions. [2025-03-08 19:02:51,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-08 19:02:51,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:51,145 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-08 19:02:51,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 19:02:51,145 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:51,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash 980162691, now seen corresponding path program 1 times [2025-03-08 19:02:51,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:51,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24286407] [2025-03-08 19:02:51,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:51,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:51,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 19:02:51,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 19:02:51,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:51,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:52,075 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-08 19:02:52,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:52,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24286407] [2025-03-08 19:02:52,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24286407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:52,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:02:52,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:02:52,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212494878] [2025-03-08 19:02:52,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:52,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:02:52,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:52,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:02:52,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:02:52,077 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-08 19:02:52,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:52,285 INFO L93 Difference]: Finished difference Result 5399 states and 7366 transitions. [2025-03-08 19:02:52,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:02:52,286 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-08 19:02:52,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:52,306 INFO L225 Difference]: With dead ends: 5399 [2025-03-08 19:02:52,306 INFO L226 Difference]: Without dead ends: 2704 [2025-03-08 19:02:52,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:02:52,316 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-08 19:02:52,316 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-08 19:02:52,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-03-08 19:02:52,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2025-03-08 19:02:52,404 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-08 19:02:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3686 transitions. [2025-03-08 19:02:52,416 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3686 transitions. Word has length 272 [2025-03-08 19:02:52,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:52,416 INFO L471 AbstractCegarLoop]: Abstraction has 2704 states and 3686 transitions. [2025-03-08 19:02:52,416 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-08 19:02:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3686 transitions. [2025-03-08 19:02:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-08 19:02:52,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:52,422 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-08 19:02:52,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 19:02:52,422 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:52,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:52,423 INFO L85 PathProgramCache]: Analyzing trace with hash 178449041, now seen corresponding path program 1 times [2025-03-08 19:02:52,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:52,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762868590] [2025-03-08 19:02:52,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:52,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:53,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 19:02:53,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 19:02:53,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:53,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:53,249 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-08 19:02:53,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:53,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762868590] [2025-03-08 19:02:53,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762868590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:53,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721098981] [2025-03-08 19:02:53,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:53,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:53,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:53,251 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-08 19:02:53,253 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-08 19:02:54,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 19:02:54,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 19:02:54,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:54,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:54,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 4526 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 19:02:54,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:54,927 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-08 19:02:54,927 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:02:54,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721098981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:02:54,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:02:54,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 19:02:54,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924162062] [2025-03-08 19:02:54,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:02:54,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:02:54,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:54,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:02:54,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:02:54,929 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-08 19:02:55,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:55,198 INFO L93 Difference]: Finished difference Result 5461 states and 7596 transitions. [2025-03-08 19:02:55,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:02:55,198 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-08 19:02:55,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:55,213 INFO L225 Difference]: With dead ends: 5461 [2025-03-08 19:02:55,213 INFO L226 Difference]: Without dead ends: 2760 [2025-03-08 19:02:55,222 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-08 19:02:55,222 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-08 19:02:55,223 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-08 19:02:55,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2025-03-08 19:02:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2760. [2025-03-08 19:02:55,355 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-08 19:02:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 3770 transitions. [2025-03-08 19:02:55,368 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 3770 transitions. Word has length 275 [2025-03-08 19:02:55,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:55,369 INFO L471 AbstractCegarLoop]: Abstraction has 2760 states and 3770 transitions. [2025-03-08 19:02:55,369 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-08 19:02:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 3770 transitions. [2025-03-08 19:02:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-08 19:02:55,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:55,375 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-08 19:02:55,392 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-08 19:02:55,576 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-08 19:02:55,576 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:55,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:55,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1609988901, now seen corresponding path program 1 times [2025-03-08 19:02:55,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:55,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028973472] [2025-03-08 19:02:55,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:55,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:02:56,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 19:02:56,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 19:02:56,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:56,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:56,533 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-08 19:02:56,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:02:56,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028973472] [2025-03-08 19:02:56,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028973472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:02:56,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768740119] [2025-03-08 19:02:56,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:56,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:02:56,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:02:56,536 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-08 19:02:56,537 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-08 19:02:57,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 19:02:58,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 19:02:58,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:02:58,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:02:58,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 4532 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:02:58,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:02:58,303 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-08 19:02:58,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:02:59,289 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-08 19:02:59,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768740119] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 19:02:59,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 19:02:59,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 19:02:59,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573880769] [2025-03-08 19:02:59,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 19:02:59,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 19:02:59,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:02:59,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 19:02:59,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:02:59,291 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-08 19:02:59,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:02:59,602 INFO L93 Difference]: Finished difference Result 5784 states and 7960 transitions. [2025-03-08 19:02:59,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:02:59,603 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-08 19:02:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:02:59,617 INFO L225 Difference]: With dead ends: 5784 [2025-03-08 19:02:59,617 INFO L226 Difference]: Without dead ends: 3027 [2025-03-08 19:02:59,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 551 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-08 19:02:59,625 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-08 19:02:59,625 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-08 19:02:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2025-03-08 19:02:59,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 3027. [2025-03-08 19:02:59,722 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-08 19:02:59,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3027 states to 3027 states and 4166 transitions. [2025-03-08 19:02:59,736 INFO L78 Accepts]: Start accepts. Automaton has 3027 states and 4166 transitions. Word has length 277 [2025-03-08 19:02:59,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:02:59,736 INFO L471 AbstractCegarLoop]: Abstraction has 3027 states and 4166 transitions. [2025-03-08 19:02:59,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-08 19:02:59,737 INFO L276 IsEmpty]: Start isEmpty. Operand 3027 states and 4166 transitions. [2025-03-08 19:02:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-08 19:02:59,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:02:59,744 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-08 19:02:59,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-08 19:02:59,945 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-08 19:02:59,945 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:02:59,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:02:59,946 INFO L85 PathProgramCache]: Analyzing trace with hash 801604028, now seen corresponding path program 1 times [2025-03-08 19:02:59,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:02:59,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695271323] [2025-03-08 19:02:59,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:02:59,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:03:00,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-08 19:03:00,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-08 19:03:00,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:03:00,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:03:01,026 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-08 19:03:01,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:03:01,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695271323] [2025-03-08 19:03:01,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695271323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:03:01,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:03:01,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:03:01,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798628901] [2025-03-08 19:03:01,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:03:01,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:03:01,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:03:01,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:03:01,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:03:01,027 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-08 19:03:01,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:03:01,284 INFO L93 Difference]: Finished difference Result 6066 states and 8371 transitions. [2025-03-08 19:03:01,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:03:01,285 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-08 19:03:01,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:03:01,302 INFO L225 Difference]: With dead ends: 6066 [2025-03-08 19:03:01,302 INFO L226 Difference]: Without dead ends: 3042 [2025-03-08 19:03:01,310 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-08 19:03:01,311 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:03:01,311 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.2s Time] [2025-03-08 19:03:01,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2025-03-08 19:03:01,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 3042. [2025-03-08 19:03:01,414 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-08 19:03:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 4202 transitions. [2025-03-08 19:03:01,429 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 4202 transitions. Word has length 278 [2025-03-08 19:03:01,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:03:01,430 INFO L471 AbstractCegarLoop]: Abstraction has 3042 states and 4202 transitions. [2025-03-08 19:03:01,430 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-08 19:03:01,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 4202 transitions. [2025-03-08 19:03:01,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 19:03:01,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:03:01,437 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-08 19:03:01,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 19:03:01,437 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:03:01,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:03:01,437 INFO L85 PathProgramCache]: Analyzing trace with hash 748963391, now seen corresponding path program 2 times [2025-03-08 19:03:01,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:03:01,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031009144] [2025-03-08 19:03:01,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 19:03:01,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:03:02,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 298 statements into 2 equivalence classes. [2025-03-08 19:03:02,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 92 of 298 statements. [2025-03-08 19:03:02,077 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 19:03:02,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:03:02,275 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-08 19:03:02,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:03:02,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031009144] [2025-03-08 19:03:02,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031009144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:03:02,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:03:02,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:03:02,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103659323] [2025-03-08 19:03:02,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:03:02,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:03:02,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:03:02,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:03:02,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:03:02,277 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-08 19:03:06,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:03:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:03:06,572 INFO L93 Difference]: Finished difference Result 3042 states and 4202 transitions. [2025-03-08 19:03:06,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:03:06,573 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-08 19:03:06,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:03:06,580 INFO L225 Difference]: With dead ends: 3042 [2025-03-08 19:03:06,580 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 19:03:06,586 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-08 19:03:06,588 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:03:06,589 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.2s Time] [2025-03-08 19:03:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 19:03:06,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 19:03:06,590 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-08 19:03:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 19:03:06,595 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 298 [2025-03-08 19:03:06,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:03:06,595 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 19:03:06,596 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-08 19:03:06,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 19:03:06,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 19:03:06,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 19:03:06,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 19:03:06,602 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-08 19:03:06,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.