./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/seq-pthread/cs_queue-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 8159433f4ea1208e9ded3d30d98c55f64500f74c12655a237b65d69e94898ea5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:34:52,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:34:52,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:34:52,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:34:52,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:34:52,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:34:52,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:34:52,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:34:52,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:34:52,956 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:34:52,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:34:52,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:34:52,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:34:52,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:34:52,957 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:34:52,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:34:52,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:34:52,957 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:34:52,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:34:52,957 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:34:52,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:34:52,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:34:52,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:34:52,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:34:52,958 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:34:52,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:34:52,958 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:34:52,958 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:34:52,958 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:34:52,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:34:52,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:34:52,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:34:52,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:34:52,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:34:52,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:34:52,959 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:34:52,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:34:52,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:34:52,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:34:52,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:34:52,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:34:52,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:34:52,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:34:52,959 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8159433f4ea1208e9ded3d30d98c55f64500f74c12655a237b65d69e94898ea5 [2025-03-08 06:34:53,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:34:53,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:34:53,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:34:53,192 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:34:53,192 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:34:53,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_queue-2.i [2025-03-08 06:34:54,344 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd389378/41b98b625f0b46d6944aa01b00496187/FLAG6fb7327bf [2025-03-08 06:34:54,680 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:34:54,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_queue-2.i [2025-03-08 06:34:54,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd389378/41b98b625f0b46d6944aa01b00496187/FLAG6fb7327bf [2025-03-08 06:34:54,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd389378/41b98b625f0b46d6944aa01b00496187 [2025-03-08 06:34:54,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:34:54,944 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:34:54,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:34:54,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:34:54,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:34:54,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:34:54" (1/1) ... [2025-03-08 06:34:54,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca9014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:54, skipping insertion in model container [2025-03-08 06:34:54,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:34:54" (1/1) ... [2025-03-08 06:34:54,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:34:55,246 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/seq-pthread/cs_queue-2.i[34556,34569] [2025-03-08 06:34:55,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:34:55,385 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:34:55,421 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/seq-pthread/cs_queue-2.i[34556,34569] [2025-03-08 06:34:55,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:34:55,519 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:34:55,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:55 WrapperNode [2025-03-08 06:34:55,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:34:55,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:34:55,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:34:55,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:34:55,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:55" (1/1) ... [2025-03-08 06:34:55,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:55" (1/1) ... [2025-03-08 06:34:55,584 INFO L138 Inliner]: procedures = 249, calls = 626, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1331 [2025-03-08 06:34:55,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:34:55,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:34:55,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:34:55,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:34:55,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:55" (1/1) ... [2025-03-08 06:34:55,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:55" (1/1) ... [2025-03-08 06:34:55,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:55" (1/1) ... [2025-03-08 06:34:55,639 INFO L175 MemorySlicer]: Split 386 memory accesses to 20 slices as follows [2, 8, 8, 6, 8, 20, 12, 83, 2, 8, 8, 46, 113, 40, 0, 6, 8, 4, 2, 2]. 29 percent of accesses are in the largest equivalence class. The 115 initializations are split as follows [2, 3, 3, 0, 3, 6, 6, 40, 0, 2, 2, 0, 46, 0, 0, 0, 2, 0, 0, 0]. The 85 writes are split as follows [0, 2, 2, 0, 2, 8, 3, 22, 0, 4, 4, 0, 33, 0, 0, 0, 3, 2, 0, 0]. [2025-03-08 06:34:55,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:55" (1/1) ... [2025-03-08 06:34:55,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:55" (1/1) ... [2025-03-08 06:34:55,688 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:55" (1/1) ... [2025-03-08 06:34:55,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:55" (1/1) ... [2025-03-08 06:34:55,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:55" (1/1) ... [2025-03-08 06:34:55,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:55" (1/1) ... [2025-03-08 06:34:55,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:34:55,731 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:34:55,731 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:34:55,731 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:34:55,732 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:55" (1/1) ... [2025-03-08 06:34:55,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:34:55,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:55,761 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 06:34:55,764 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 06:34:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 06:34:55,781 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 06:34:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 06:34:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure empty [2025-03-08 06:34:55,782 INFO L138 BoogieDeclarations]: Found implementation of procedure empty [2025-03-08 06:34:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-03-08 06:34:55,782 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-03-08 06:34:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 06:34:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 06:34:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 06:34:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 06:34:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 06:34:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 06:34:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 06:34:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 06:34:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 06:34:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 06:34:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 06:34:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 06:34:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 06:34:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 06:34:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 06:34:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 06:34:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 06:34:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-08 06:34:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-08 06:34:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-08 06:34:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 06:34:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 06:34:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 06:34:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 06:34:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 06:34:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 06:34:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 06:34:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure enqueue [2025-03-08 06:34:55,784 INFO L138 BoogieDeclarations]: Found implementation of procedure enqueue [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-03-08 06:34:55,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 06:34:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-08 06:34:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-08 06:34:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:34:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 06:34:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 06:34:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 06:34:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 06:34:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 06:34:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 06:34:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 06:34:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 06:34:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 06:34:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 06:34:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 06:34:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 06:34:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 06:34:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 06:34:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 06:34:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 06:34:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 06:34:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-08 06:34:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-08 06:34:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-08 06:34:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-08 06:34:55,788 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-08 06:34:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-08 06:34:55,788 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-08 06:34:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-08 06:34:55,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-08 06:34:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-08 06:34:55,788 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-08 06:34:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:34:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 06:34:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 06:34:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 06:34:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 06:34:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 06:34:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 06:34:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 06:34:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 06:34:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 06:34:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 06:34:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 06:34:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 06:34:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 06:34:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 06:34:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 06:34:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 06:34:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 06:34:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 06:34:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 06:34:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:34:55,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:34:56,030 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:34:56,031 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:34:56,097 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L957: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-03-08 06:34:56,098 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L957: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:34:56,100 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L957-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:56,100 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L952: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-03-08 06:34:56,100 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L952: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:34:56,101 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L952-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:56,629 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-03-08 06:34:56,630 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:34:56,630 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:56,630 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1111-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-03-08 06:34:56,630 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1111-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:34:56,631 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1111-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:56,631 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1128-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-08 06:34:56,631 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1128-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:34:56,631 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1128-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:56,631 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1095-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-03-08 06:34:56,631 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1095-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:34:56,631 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1095-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:56,632 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1130-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-08 06:34:56,632 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1130-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:34:56,632 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1130-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:56,632 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1097-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-03-08 06:34:56,632 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1097-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:34:56,632 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1097-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:56,632 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-03-08 06:34:56,632 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:34:56,632 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:56,632 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-08 06:34:56,632 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:34:56,632 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:56,633 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);dequeue_#res#1 := 0; [2025-03-08 06:34:56,633 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:34:56,635 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:56,635 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1071-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-03-08 06:34:56,635 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1071-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:34:56,635 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1071-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:56,635 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1073-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-03-08 06:34:56,636 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1073-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:34:56,636 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1073-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:56,636 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1041-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-03-08 06:34:56,636 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1041-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:34:56,636 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1041-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:56,636 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-03-08 06:34:56,636 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:34:56,636 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:56,680 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L996: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-03-08 06:34:56,680 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L996: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:34:56,680 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:35:01,094 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2025-03-08 06:35:01,094 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:35:01,110 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:35:01,110 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:35:01,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:35:01 BoogieIcfgContainer [2025-03-08 06:35:01,111 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:35:01,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:35:01,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:35:01,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:35:01,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:34:54" (1/3) ... [2025-03-08 06:35:01,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38393c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:35:01, skipping insertion in model container [2025-03-08 06:35:01,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:55" (2/3) ... [2025-03-08 06:35:01,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38393c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:35:01, skipping insertion in model container [2025-03-08 06:35:01,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:35:01" (3/3) ... [2025-03-08 06:35:01,119 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_queue-2.i [2025-03-08 06:35:01,132 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:35:01,136 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_queue-2.i that has 10 procedures, 348 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 06:35:01,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:35:01,208 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;@7d6a6cf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:35:01,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:35:01,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 348 states, 201 states have (on average 1.4676616915422886) internal successors, (295), 203 states have internal predecessors, (295), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-08 06:35:01,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-08 06:35:01,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:01,243 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:35:01,243 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:01,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:01,247 INFO L85 PathProgramCache]: Analyzing trace with hash -265943803, now seen corresponding path program 1 times [2025-03-08 06:35:01,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:01,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118337756] [2025-03-08 06:35:01,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:01,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:01,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-08 06:35:02,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-08 06:35:02,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:02,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:02,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2025-03-08 06:35:02,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:02,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118337756] [2025-03-08 06:35:02,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118337756] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:02,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300392918] [2025-03-08 06:35:02,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:02,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:02,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:02,283 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 06:35:02,285 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 06:35:02,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-08 06:35:03,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-08 06:35:03,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:03,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:03,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 1913 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 06:35:03,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2025-03-08 06:35:03,177 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:35:03,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300392918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:03,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:35:03,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 06:35:03,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420522666] [2025-03-08 06:35:03,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:03,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 06:35:03,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:03,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 06:35:03,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 06:35:03,202 INFO L87 Difference]: Start difference. First operand has 348 states, 201 states have (on average 1.4676616915422886) internal successors, (295), 203 states have internal predecessors, (295), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) [2025-03-08 06:35:03,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:03,266 INFO L93 Difference]: Finished difference Result 689 states and 1250 transitions. [2025-03-08 06:35:03,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 06:35:03,268 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) Word has length 322 [2025-03-08 06:35:03,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:03,277 INFO L225 Difference]: With dead ends: 689 [2025-03-08 06:35:03,277 INFO L226 Difference]: Without dead ends: 341 [2025-03-08 06:35:03,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 06:35:03,286 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:03,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:35:03,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-08 06:35:03,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2025-03-08 06:35:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 196 states have (on average 1.4540816326530612) internal successors, (285), 197 states have internal predecessors, (285), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-08 06:35:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 555 transitions. [2025-03-08 06:35:03,364 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 555 transitions. Word has length 322 [2025-03-08 06:35:03,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:03,365 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 555 transitions. [2025-03-08 06:35:03,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) [2025-03-08 06:35:03,366 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 555 transitions. [2025-03-08 06:35:03,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-08 06:35:03,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:03,378 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:35:03,388 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 06:35:03,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 06:35:03,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:03,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:03,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1525370833, now seen corresponding path program 1 times [2025-03-08 06:35:03,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:03,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420130206] [2025-03-08 06:35:03,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:03,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:04,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-08 06:35:04,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-08 06:35:04,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:04,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:04,933 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-08 06:35:04,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:04,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420130206] [2025-03-08 06:35:04,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420130206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:04,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:04,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:35:04,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648951865] [2025-03-08 06:35:04,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:04,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:35:04,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:04,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:35:04,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:35:04,940 INFO L87 Difference]: Start difference. First operand 341 states and 555 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 06:35:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:05,052 INFO L93 Difference]: Finished difference Result 678 states and 1112 transitions. [2025-03-08 06:35:05,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:35:05,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 322 [2025-03-08 06:35:05,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:05,060 INFO L225 Difference]: With dead ends: 678 [2025-03-08 06:35:05,060 INFO L226 Difference]: Without dead ends: 568 [2025-03-08 06:35:05,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:05,061 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 437 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:05,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1822 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:35:05,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-08 06:35:05,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 566. [2025-03-08 06:35:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 330 states have (on average 1.5303030303030303) internal successors, (505), 332 states have internal predecessors, (505), 217 states have call successors, (217), 18 states have call predecessors, (217), 18 states have return successors, (224), 217 states have call predecessors, (224), 217 states have call successors, (224) [2025-03-08 06:35:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 946 transitions. [2025-03-08 06:35:05,135 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 946 transitions. Word has length 322 [2025-03-08 06:35:05,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:05,135 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 946 transitions. [2025-03-08 06:35:05,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 06:35:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 946 transitions. [2025-03-08 06:35:05,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2025-03-08 06:35:05,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:05,148 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:35:05,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:35:05,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:05,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:05,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1590555158, now seen corresponding path program 1 times [2025-03-08 06:35:05,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:05,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085923556] [2025-03-08 06:35:05,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:05,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:05,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-03-08 06:35:05,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-03-08 06:35:05,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:05,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6434 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6434 trivial. 0 not checked. [2025-03-08 06:35:05,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:05,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085923556] [2025-03-08 06:35:05,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085923556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:05,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:05,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:35:05,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297279149] [2025-03-08 06:35:05,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:05,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:35:05,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:05,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:35:05,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:35:05,842 INFO L87 Difference]: Start difference. First operand 566 states and 946 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (61), 1 states have call predecessors, (61), 3 states have return successors, (61), 3 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-08 06:35:05,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:05,909 INFO L93 Difference]: Finished difference Result 1124 states and 1884 transitions. [2025-03-08 06:35:05,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:35:05,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (61), 1 states have call predecessors, (61), 3 states have return successors, (61), 3 states have call predecessors, (61), 2 states have call successors, (61) Word has length 400 [2025-03-08 06:35:05,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:05,916 INFO L225 Difference]: With dead ends: 1124 [2025-03-08 06:35:05,916 INFO L226 Difference]: Without dead ends: 562 [2025-03-08 06:35:05,919 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 06:35:05,921 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 0 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:05,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1631 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:35:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-08 06:35:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2025-03-08 06:35:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 328 states have (on average 1.521341463414634) internal successors, (499), 330 states have internal predecessors, (499), 215 states have call successors, (215), 18 states have call predecessors, (215), 18 states have return successors, (222), 215 states have call predecessors, (222), 215 states have call successors, (222) [2025-03-08 06:35:05,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 936 transitions. [2025-03-08 06:35:05,977 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 936 transitions. Word has length 400 [2025-03-08 06:35:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:05,978 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 936 transitions. [2025-03-08 06:35:05,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (61), 1 states have call predecessors, (61), 3 states have return successors, (61), 3 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-08 06:35:05,978 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 936 transitions. [2025-03-08 06:35:05,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-08 06:35:05,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:05,985 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:35:05,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:35:05,986 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:05,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:05,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1342090130, now seen corresponding path program 1 times [2025-03-08 06:35:05,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:05,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529544349] [2025-03-08 06:35:05,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:05,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:06,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-08 06:35:06,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-08 06:35:06,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:06,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6434 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6434 trivial. 0 not checked. [2025-03-08 06:35:07,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:07,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529544349] [2025-03-08 06:35:07,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529544349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:07,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:07,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:35:07,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495708611] [2025-03-08 06:35:07,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:07,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:35:07,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:07,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:35:07,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:07,173 INFO L87 Difference]: Start difference. First operand 562 states and 936 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) [2025-03-08 06:35:11,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:35:15,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:35:19,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:35:19,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:19,767 INFO L93 Difference]: Finished difference Result 1247 states and 2062 transitions. [2025-03-08 06:35:19,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:35:19,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) Word has length 401 [2025-03-08 06:35:19,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:19,781 INFO L225 Difference]: With dead ends: 1247 [2025-03-08 06:35:19,782 INFO L226 Difference]: Without dead ends: 1133 [2025-03-08 06:35:19,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:35:19,784 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 600 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 37 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:19,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 2147 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 100 Invalid, 3 Unknown, 0 Unchecked, 12.5s Time] [2025-03-08 06:35:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-03-08 06:35:19,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1125. [2025-03-08 06:35:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 656 states have (on average 1.5198170731707317) internal successors, (997), 663 states have internal predecessors, (997), 429 states have call successors, (429), 36 states have call predecessors, (429), 39 states have return successors, (461), 429 states have call predecessors, (461), 429 states have call successors, (461) [2025-03-08 06:35:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1887 transitions. [2025-03-08 06:35:19,896 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1887 transitions. Word has length 401 [2025-03-08 06:35:19,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:19,896 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1887 transitions. [2025-03-08 06:35:19,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) [2025-03-08 06:35:19,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1887 transitions. [2025-03-08 06:35:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-08 06:35:19,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:19,910 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:35:19,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:35:19,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:19,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:19,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1511083793, now seen corresponding path program 1 times [2025-03-08 06:35:19,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:19,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614911043] [2025-03-08 06:35:19,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:19,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:20,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-08 06:35:20,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-08 06:35:20,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:20,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6434 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6434 trivial. 0 not checked. [2025-03-08 06:35:20,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:20,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614911043] [2025-03-08 06:35:20,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614911043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:20,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:20,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:35:20,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381468914] [2025-03-08 06:35:20,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:20,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:35:20,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:20,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:35:20,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:20,950 INFO L87 Difference]: Start difference. First operand 1125 states and 1887 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) [2025-03-08 06:35:24,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:35:28,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:35:32,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:35:33,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:33,737 INFO L93 Difference]: Finished difference Result 2242 states and 3745 transitions. [2025-03-08 06:35:33,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:35:33,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) Word has length 401 [2025-03-08 06:35:33,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:33,748 INFO L225 Difference]: With dead ends: 2242 [2025-03-08 06:35:33,748 INFO L226 Difference]: Without dead ends: 1139 [2025-03-08 06:35:33,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:35:33,754 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 648 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 70 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 2049 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:33,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 2049 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 115 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2025-03-08 06:35:33,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2025-03-08 06:35:33,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1129. [2025-03-08 06:35:33,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 659 states have (on average 1.5144157814871018) internal successors, (998), 668 states have internal predecessors, (998), 428 states have call successors, (428), 36 states have call predecessors, (428), 41 states have return successors, (459), 428 states have call predecessors, (459), 428 states have call successors, (459) [2025-03-08 06:35:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1885 transitions. [2025-03-08 06:35:33,839 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1885 transitions. Word has length 401 [2025-03-08 06:35:33,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:33,841 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1885 transitions. [2025-03-08 06:35:33,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) [2025-03-08 06:35:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1885 transitions. [2025-03-08 06:35:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-08 06:35:33,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:33,852 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:35:33,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:35:33,852 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:33,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:33,853 INFO L85 PathProgramCache]: Analyzing trace with hash -772791602, now seen corresponding path program 1 times [2025-03-08 06:35:33,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:33,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641409789] [2025-03-08 06:35:33,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:33,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:34,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-08 06:35:34,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-08 06:35:34,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:34,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6434 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6434 trivial. 0 not checked. [2025-03-08 06:35:35,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:35,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641409789] [2025-03-08 06:35:35,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641409789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:35,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:35,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:35:35,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139028532] [2025-03-08 06:35:35,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:35,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:35:35,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:35,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:35:35,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:35,054 INFO L87 Difference]: Start difference. First operand 1129 states and 1885 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) [2025-03-08 06:35:39,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:35:43,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:35:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:45,297 INFO L93 Difference]: Finished difference Result 1889 states and 3098 transitions. [2025-03-08 06:35:45,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:35:45,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) Word has length 401 [2025-03-08 06:35:45,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:45,307 INFO L225 Difference]: With dead ends: 1889 [2025-03-08 06:35:45,307 INFO L226 Difference]: Without dead ends: 1039 [2025-03-08 06:35:45,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:35:45,313 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 687 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 90 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:45,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1710 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 449 Invalid, 2 Unknown, 0 Unchecked, 10.0s Time] [2025-03-08 06:35:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-03-08 06:35:45,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1035. [2025-03-08 06:35:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 605 states have (on average 1.487603305785124) internal successors, (900), 611 states have internal predecessors, (900), 389 states have call successors, (389), 36 states have call predecessors, (389), 40 states have return successors, (416), 389 states have call predecessors, (416), 389 states have call successors, (416) [2025-03-08 06:35:45,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1705 transitions. [2025-03-08 06:35:45,389 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1705 transitions. Word has length 401 [2025-03-08 06:35:45,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:45,390 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1705 transitions. [2025-03-08 06:35:45,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) [2025-03-08 06:35:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1705 transitions. [2025-03-08 06:35:45,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-08 06:35:45,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:45,399 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:35:45,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:35:45,399 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:45,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:45,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1069945708, now seen corresponding path program 1 times [2025-03-08 06:35:45,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:45,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600417451] [2025-03-08 06:35:45,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:45,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:45,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-08 06:35:45,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-08 06:35:45,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:45,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7220 trivial. 0 not checked. [2025-03-08 06:35:46,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:46,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600417451] [2025-03-08 06:35:46,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600417451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:46,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:46,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:35:46,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425229786] [2025-03-08 06:35:46,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:46,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:35:46,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:46,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:35:46,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:35:46,019 INFO L87 Difference]: Start difference. First operand 1035 states and 1705 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (65), 1 states have call predecessors, (65), 3 states have return successors, (65), 3 states have call predecessors, (65), 2 states have call successors, (65) [2025-03-08 06:35:46,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:46,111 INFO L93 Difference]: Finished difference Result 2062 states and 3398 transitions. [2025-03-08 06:35:46,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:35:46,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (65), 1 states have call predecessors, (65), 3 states have return successors, (65), 3 states have call predecessors, (65), 2 states have call successors, (65) Word has length 439 [2025-03-08 06:35:46,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:46,120 INFO L225 Difference]: With dead ends: 2062 [2025-03-08 06:35:46,120 INFO L226 Difference]: Without dead ends: 1051 [2025-03-08 06:35:46,124 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 06:35:46,125 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 0 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:46,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1635 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:35:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-08 06:35:46,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2025-03-08 06:35:46,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 617 states have (on average 1.4781199351701784) internal successors, (912), 623 states have internal predecessors, (912), 389 states have call successors, (389), 36 states have call predecessors, (389), 44 states have return successors, (424), 393 states have call predecessors, (424), 389 states have call successors, (424) [2025-03-08 06:35:46,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1725 transitions. [2025-03-08 06:35:46,191 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1725 transitions. Word has length 439 [2025-03-08 06:35:46,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:46,192 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1725 transitions. [2025-03-08 06:35:46,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (65), 1 states have call predecessors, (65), 3 states have return successors, (65), 3 states have call predecessors, (65), 2 states have call successors, (65) [2025-03-08 06:35:46,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1725 transitions. [2025-03-08 06:35:46,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-08 06:35:46,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:46,200 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:35:46,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:35:46,200 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:46,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:46,201 INFO L85 PathProgramCache]: Analyzing trace with hash 123511149, now seen corresponding path program 1 times [2025-03-08 06:35:46,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:46,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203292345] [2025-03-08 06:35:46,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:46,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:46,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-08 06:35:46,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-08 06:35:46,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:46,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 7789 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7789 trivial. 0 not checked. [2025-03-08 06:35:47,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:47,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203292345] [2025-03-08 06:35:47,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203292345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:47,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:47,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:35:47,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806410354] [2025-03-08 06:35:47,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:47,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:35:47,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:47,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:35:47,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:35:47,142 INFO L87 Difference]: Start difference. First operand 1051 states and 1725 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-08 06:35:51,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:35:55,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:35:55,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:55,298 INFO L93 Difference]: Finished difference Result 1700 states and 2729 transitions. [2025-03-08 06:35:55,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:35:55,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 462 [2025-03-08 06:35:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:55,307 INFO L225 Difference]: With dead ends: 1700 [2025-03-08 06:35:55,307 INFO L226 Difference]: Without dead ends: 1003 [2025-03-08 06:35:55,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:55,310 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 448 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:55,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1703 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-03-08 06:35:55,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-03-08 06:35:55,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 999. [2025-03-08 06:35:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 586 states have (on average 1.4385665529010239) internal successors, (843), 590 states have internal predecessors, (843), 370 states have call successors, (370), 35 states have call predecessors, (370), 42 states have return successors, (397), 375 states have call predecessors, (397), 370 states have call successors, (397) [2025-03-08 06:35:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1610 transitions. [2025-03-08 06:35:55,369 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1610 transitions. Word has length 462 [2025-03-08 06:35:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:55,370 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1610 transitions. [2025-03-08 06:35:55,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-08 06:35:55,370 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1610 transitions. [2025-03-08 06:35:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-08 06:35:55,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:55,376 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:35:55,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:35:55,376 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:55,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:55,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1597789292, now seen corresponding path program 1 times [2025-03-08 06:35:55,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:55,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771264940] [2025-03-08 06:35:55,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:55,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:55,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-08 06:35:55,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-08 06:35:55,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:55,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:56,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7789 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7789 trivial. 0 not checked. [2025-03-08 06:35:56,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:56,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771264940] [2025-03-08 06:35:56,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771264940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:56,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:56,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:35:56,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914808015] [2025-03-08 06:35:56,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:56,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:35:56,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:56,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:35:56,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:35:56,280 INFO L87 Difference]: Start difference. First operand 999 states and 1610 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-08 06:36:00,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:36:04,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:36:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:36:04,432 INFO L93 Difference]: Finished difference Result 1446 states and 2274 transitions. [2025-03-08 06:36:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:36:04,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 462 [2025-03-08 06:36:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:36:04,438 INFO L225 Difference]: With dead ends: 1446 [2025-03-08 06:36:04,438 INFO L226 Difference]: Without dead ends: 795 [2025-03-08 06:36:04,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:36:04,440 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 437 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:36:04,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 2026 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-03-08 06:36:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-03-08 06:36:04,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 789. [2025-03-08 06:36:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 461 states have (on average 1.4143167028199566) internal successors, (652), 465 states have internal predecessors, (652), 296 states have call successors, (296), 27 states have call predecessors, (296), 31 states have return successors, (316), 298 states have call predecessors, (316), 296 states have call successors, (316) [2025-03-08 06:36:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1264 transitions. [2025-03-08 06:36:04,497 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1264 transitions. Word has length 462 [2025-03-08 06:36:04,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:36:04,497 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1264 transitions. [2025-03-08 06:36:04,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-08 06:36:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1264 transitions. [2025-03-08 06:36:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-08 06:36:04,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:36:04,501 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 11, 11, 11, 11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:36:04,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:36:04,502 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:36:04,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:36:04,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1358655115, now seen corresponding path program 1 times [2025-03-08 06:36:04,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:36:04,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842461099] [2025-03-08 06:36:04,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:36:04,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:36:04,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 06:36:04,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 06:36:04,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:36:04,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8091 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8087 trivial. 0 not checked. [2025-03-08 06:36:05,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:36:05,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842461099] [2025-03-08 06:36:05,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842461099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:36:05,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422913002] [2025-03-08 06:36:05,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:36:05,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:36:05,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:36:05,424 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 06:36:05,425 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 06:36:06,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 06:36:06,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 06:36:06,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:36:06,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:06,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 2690 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 06:36:06,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:36:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 8091 backedges. 1774 proven. 0 refuted. 0 times theorem prover too weak. 6317 trivial. 0 not checked. [2025-03-08 06:36:07,822 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:36:07,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422913002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:36:07,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:36:07,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 15 [2025-03-08 06:36:07,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275113597] [2025-03-08 06:36:07,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:36:07,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:36:07,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:36:07,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:36:07,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:36:07,825 INFO L87 Difference]: Start difference. First operand 789 states and 1264 transitions. Second operand has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 6 states have call successors, (71), 3 states have call predecessors, (71), 5 states have return successors, (71), 6 states have call predecessors, (71), 6 states have call successors, (71) [2025-03-08 06:36:17,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:36:17,018 INFO L93 Difference]: Finished difference Result 2506 states and 3903 transitions. [2025-03-08 06:36:17,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:36:17,019 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 6 states have call successors, (71), 3 states have call predecessors, (71), 5 states have return successors, (71), 6 states have call predecessors, (71), 6 states have call successors, (71) Word has length 478 [2025-03-08 06:36:17,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:36:17,029 INFO L225 Difference]: With dead ends: 2506 [2025-03-08 06:36:17,030 INFO L226 Difference]: Without dead ends: 1708 [2025-03-08 06:36:17,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:36:17,035 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 1167 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 2948 mSolverCounterSat, 1145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 4093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1145 IncrementalHoareTripleChecker+Valid, 2948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:36:17,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1375 Valid, 1427 Invalid, 4093 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1145 Valid, 2948 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2025-03-08 06:36:17,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2025-03-08 06:36:17,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1561. [2025-03-08 06:36:17,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 914 states have (on average 1.2472647702407003) internal successors, (1140), 912 states have internal predecessors, (1140), 579 states have call successors, (579), 42 states have call predecessors, (579), 67 states have return successors, (662), 606 states have call predecessors, (662), 579 states have call successors, (662) [2025-03-08 06:36:17,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2381 transitions. [2025-03-08 06:36:17,151 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2381 transitions. Word has length 478 [2025-03-08 06:36:17,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:36:17,151 INFO L471 AbstractCegarLoop]: Abstraction has 1561 states and 2381 transitions. [2025-03-08 06:36:17,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 6 states have call successors, (71), 3 states have call predecessors, (71), 5 states have return successors, (71), 6 states have call predecessors, (71), 6 states have call successors, (71) [2025-03-08 06:36:17,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2381 transitions. [2025-03-08 06:36:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-03-08 06:36:17,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:36:17,159 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 15, 15, 15, 15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:36:17,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 06:36:17,360 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,SelfDestructingSolverStorable9 [2025-03-08 06:36:17,360 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:36:17,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:36:17,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1412664097, now seen corresponding path program 1 times [2025-03-08 06:36:17,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:36:17,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182951229] [2025-03-08 06:36:17,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:36:17,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:36:17,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-03-08 06:36:17,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-03-08 06:36:17,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:36:17,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9373 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9369 trivial. 0 not checked. [2025-03-08 06:36:18,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:36:18,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182951229] [2025-03-08 06:36:18,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182951229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:36:18,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363407047] [2025-03-08 06:36:18,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:36:18,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:36:18,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:36:18,475 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 06:36:18,477 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 06:36:19,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-03-08 06:36:19,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-03-08 06:36:19,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:36:19,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:19,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 2847 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-08 06:36:19,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:36:19,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 300 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 203 [2025-03-08 06:36:20,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 120 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 133 [2025-03-08 06:36:21,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-08 06:36:22,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2025-03-08 06:36:23,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2025-03-08 06:36:24,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23