./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-16 19:42:41,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:42:41,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:42:41,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:42:41,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:42:41,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:42:41,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:42:41,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:42:41,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:42:41,429 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:42:41,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:42:41,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:42:41,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:42:41,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:42:41,429 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:42:41,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:42:41,430 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:42:41,430 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:42:41,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:42:41,430 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:42:41,430 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:42:41,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:42:41,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:42:41,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:42:41,430 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:42:41,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:42:41,430 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:42:41,430 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:42:41,430 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:42:41,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:42:41,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:42:41,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:42:41,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:42:41,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:42:41,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:42:41,432 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:42:41,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:42:41,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:42:41,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:42:41,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:42:41,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:42:41,433 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:42:41,433 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:42:41,433 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-16 19:42:41,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:42:41,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:42:41,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:42:41,675 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:42:41,676 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:42:41,677 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-16 19:42:42,768 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd0dc8057/9b9cb2dc7ba44bc6a87b4212f57f21e5/FLAGb81724c76 [2025-03-16 19:42:43,033 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:42:43,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_queue-2.i [2025-03-16 19:42:43,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd0dc8057/9b9cb2dc7ba44bc6a87b4212f57f21e5/FLAGb81724c76 [2025-03-16 19:42:43,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd0dc8057/9b9cb2dc7ba44bc6a87b4212f57f21e5 [2025-03-16 19:42:43,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:42:43,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:42:43,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:42:43,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:42:43,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:42:43,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:42:43" (1/1) ... [2025-03-16 19:42:43,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dac9f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:43, skipping insertion in model container [2025-03-16 19:42:43,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:42:43" (1/1) ... [2025-03-16 19:42:43,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:42:43,621 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-16 19:42:43,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:42:43,747 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:42:43,777 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-16 19:42:43,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:42:43,902 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:42:43,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:43 WrapperNode [2025-03-16 19:42:43,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:42:43,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:42:43,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:42:43,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:42:43,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:43" (1/1) ... [2025-03-16 19:42:43,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:43" (1/1) ... [2025-03-16 19:42:43,985 INFO L138 Inliner]: procedures = 249, calls = 626, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1331 [2025-03-16 19:42:43,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:42:43,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:42:43,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:42:43,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:42:43,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:43" (1/1) ... [2025-03-16 19:42:43,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:43" (1/1) ... [2025-03-16 19:42:44,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:43" (1/1) ... [2025-03-16 19:42:44,044 INFO L175 MemorySlicer]: Split 386 memory accesses to 20 slices as follows [2, 4, 8, 8, 8, 20, 12, 2, 83, 8, 8, 2, 8, 0, 6, 46, 113, 6, 40, 2]. 29 percent of accesses are in the largest equivalence class. The 115 initializations are split as follows [2, 0, 3, 3, 3, 6, 6, 0, 40, 2, 2, 0, 2, 0, 0, 0, 46, 0, 0, 0]. The 85 writes are split as follows [0, 2, 2, 2, 2, 8, 3, 0, 22, 4, 4, 0, 3, 0, 0, 0, 33, 0, 0, 0]. [2025-03-16 19:42:44,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:43" (1/1) ... [2025-03-16 19:42:44,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:43" (1/1) ... [2025-03-16 19:42:44,086 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:43" (1/1) ... [2025-03-16 19:42:44,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:43" (1/1) ... [2025-03-16 19:42:44,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:43" (1/1) ... [2025-03-16 19:42:44,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:43" (1/1) ... [2025-03-16 19:42:44,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:42:44,127 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:42:44,127 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:42:44,128 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:42:44,129 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:43" (1/1) ... [2025-03-16 19:42:44,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:42:44,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:44,156 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-16 19:42:44,164 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-16 19:42:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 19:42:44,181 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure empty [2025-03-16 19:42:44,182 INFO L138 BoogieDeclarations]: Found implementation of procedure empty [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-03-16 19:42:44,182 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-16 19:42:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-16 19:42:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure enqueue [2025-03-16 19:42:44,185 INFO L138 BoogieDeclarations]: Found implementation of procedure enqueue [2025-03-16 19:42:44,185 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-03-16 19:42:44,185 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-03-16 19:42:44,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 19:42:44,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 19:42:44,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 19:42:44,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-16 19:42:44,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-16 19:42:44,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-16 19:42:44,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-16 19:42:44,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-16 19:42:44,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-16 19:42:44,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-16 19:42:44,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-16 19:42:44,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-16 19:42:44,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-16 19:42:44,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-16 19:42:44,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-16 19:42:44,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-16 19:42:44,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-16 19:42:44,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-16 19:42:44,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-16 19:42:44,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-16 19:42:44,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 19:42:44,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 19:42:44,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 19:42:44,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-16 19:42:44,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-16 19:42:44,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-16 19:42:44,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-16 19:42:44,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-16 19:42:44,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-16 19:42:44,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-16 19:42:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-16 19:42:44,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-16 19:42:44,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:42:44,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-16 19:42:44,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-16 19:42:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-16 19:42:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-16 19:42:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-16 19:42:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:42:44,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:42:44,459 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:42:44,461 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:42:44,541 INFO L1322 $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-16 19:42:44,541 INFO L1322 $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-16 19:42:44,541 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L957-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:44,541 INFO L1322 $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-16 19:42:44,541 INFO L1322 $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-16 19:42:44,541 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L952-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:45,029 INFO L1322 $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-16 19:42:45,030 INFO L1322 $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-16 19:42:45,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:45,030 INFO L1322 $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-16 19:42:45,030 INFO L1322 $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-16 19:42:45,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1111-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:45,030 INFO L1322 $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-16 19:42:45,030 INFO L1322 $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-16 19:42:45,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1128-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:45,030 INFO L1322 $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-16 19:42:45,030 INFO L1322 $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-16 19:42:45,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1095-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:45,030 INFO L1322 $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-16 19:42:45,030 INFO L1322 $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-16 19:42:45,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1130-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:45,030 INFO L1322 $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-16 19:42:45,030 INFO L1322 $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-16 19:42:45,030 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1097-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:45,031 INFO L1322 $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-16 19:42:45,031 INFO L1322 $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-16 19:42:45,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:45,031 INFO L1322 $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-16 19:42:45,031 INFO L1322 $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-16 19:42:45,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:45,031 INFO L1322 $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-16 19:42:45,031 INFO L1322 $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-16 19:42:45,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:45,031 INFO L1322 $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-16 19:42:45,031 INFO L1322 $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-16 19:42:45,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1071-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:45,031 INFO L1322 $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-16 19:42:45,031 INFO L1322 $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-16 19:42:45,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1073-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:45,031 INFO L1322 $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-16 19:42:45,031 INFO L1322 $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-16 19:42:45,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1041-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:45,031 INFO L1322 $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-16 19:42:45,031 INFO L1322 $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-16 19:42:45,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:45,068 INFO L1322 $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-16 19:42:45,069 INFO L1322 $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-16 19:42:45,069 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:49,502 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-03-16 19:42:49,502 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:42:49,516 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:42:49,516 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:42:49,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:42:49 BoogieIcfgContainer [2025-03-16 19:42:49,517 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:42:49,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:42:49,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:42:49,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:42:49,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:42:43" (1/3) ... [2025-03-16 19:42:49,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f77e702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:42:49, skipping insertion in model container [2025-03-16 19:42:49,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:43" (2/3) ... [2025-03-16 19:42:49,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f77e702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:42:49, skipping insertion in model container [2025-03-16 19:42:49,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:42:49" (3/3) ... [2025-03-16 19:42:49,527 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_queue-2.i [2025-03-16 19:42:49,538 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:42:49,541 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_queue-2.i that has 10 procedures, 345 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 19:42:49,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:42:49,601 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;@33e4d9c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:42:49,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:42:49,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 345 states, 198 states have (on average 1.4747474747474747) internal successors, (292), 200 states have internal predecessors, (292), 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-16 19:42:49,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-16 19:42:49,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:49,641 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] [2025-03-16 19:42:49,641 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:49,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:49,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1385007492, now seen corresponding path program 1 times [2025-03-16 19:42:49,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:49,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626618145] [2025-03-16 19:42:49,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:49,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:50,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-16 19:42:50,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-16 19:42:50,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:50,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:50,765 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-16 19:42:50,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:50,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626618145] [2025-03-16 19:42:50,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626618145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:42:50,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71546612] [2025-03-16 19:42:50,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:50,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:42:50,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:50,768 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-16 19:42:50,770 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-16 19:42:51,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-16 19:42:51,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-16 19:42:51,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:51,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:51,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 1909 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 19:42:51,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:42:51,810 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-16 19:42:51,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:42:51,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71546612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:51,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:42:51,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 19:42:51,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146884959] [2025-03-16 19:42:51,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:51,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 19:42:51,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:51,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 19:42:51,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:42:51,832 INFO L87 Difference]: Start difference. First operand has 345 states, 198 states have (on average 1.4747474747474747) internal successors, (292), 200 states have internal predecessors, (292), 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.0) internal successors, (66), 2 states have internal predecessors, (66), 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-16 19:42:51,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:51,890 INFO L93 Difference]: Finished difference Result 684 states and 1245 transitions. [2025-03-16 19:42:51,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 19:42:51,893 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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 321 [2025-03-16 19:42:51,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:51,901 INFO L225 Difference]: With dead ends: 684 [2025-03-16 19:42:51,901 INFO L226 Difference]: Without dead ends: 339 [2025-03-16 19:42:51,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 322 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-16 19:42:51,911 INFO L435 NwaCegarLoop]: 556 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, 556 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-16 19:42:51,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:42:51,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-16 19:42:51,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2025-03-16 19:42:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 194 states have (on average 1.458762886597938) internal successors, (283), 195 states have internal predecessors, (283), 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-16 19:42:51,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 553 transitions. [2025-03-16 19:42:51,977 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 553 transitions. Word has length 321 [2025-03-16 19:42:51,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:51,977 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 553 transitions. [2025-03-16 19:42:51,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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-16 19:42:51,977 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 553 transitions. [2025-03-16 19:42:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-16 19:42:51,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:51,989 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] [2025-03-16 19:42:52,000 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-16 19:42:52,189 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-16 19:42:52,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:52,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:52,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1118645168, now seen corresponding path program 1 times [2025-03-16 19:42:52,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:52,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901908037] [2025-03-16 19:42:52,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:52,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:52,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-16 19:42:52,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-16 19:42:52,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:52,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:53,748 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-16 19:42:53,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:53,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901908037] [2025-03-16 19:42:53,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901908037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:53,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:53,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:42:53,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506376302] [2025-03-16 19:42:53,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:53,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:42:53,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:53,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:42:53,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:42:53,752 INFO L87 Difference]: Start difference. First operand 339 states and 553 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-16 19:42:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:53,891 INFO L93 Difference]: Finished difference Result 675 states and 1109 transitions. [2025-03-16 19:42:53,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:42:53,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 321 [2025-03-16 19:42:53,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:53,901 INFO L225 Difference]: With dead ends: 675 [2025-03-16 19:42:53,901 INFO L226 Difference]: Without dead ends: 565 [2025-03-16 19:42:53,904 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-16 19:42:53,905 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 436 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1704 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-16 19:42:53,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1704 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:42:53,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-03-16 19:42:53,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 563. [2025-03-16 19:42:53,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 327 states have (on average 1.5351681957186545) internal successors, (502), 329 states have internal predecessors, (502), 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-16 19:42:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 943 transitions. [2025-03-16 19:42:53,978 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 943 transitions. Word has length 321 [2025-03-16 19:42:53,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:53,979 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 943 transitions. [2025-03-16 19:42:53,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-16 19:42:53,979 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 943 transitions. [2025-03-16 19:42:53,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-03-16 19:42:53,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:53,988 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] [2025-03-16 19:42:53,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:42:53,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:53,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1799701779, now seen corresponding path program 1 times [2025-03-16 19:42:53,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:53,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079682423] [2025-03-16 19:42:53,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:53,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:54,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-03-16 19:42:54,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-03-16 19:42:54,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:54,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:54,875 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-16 19:42:54,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:54,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079682423] [2025-03-16 19:42:54,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079682423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:54,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:54,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:42:54,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980762807] [2025-03-16 19:42:54,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:54,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:42:54,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:54,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:42:54,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:42:54,879 INFO L87 Difference]: Start difference. First operand 563 states and 943 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-16 19:42:54,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:54,994 INFO L93 Difference]: Finished difference Result 1119 states and 1879 transitions. [2025-03-16 19:42:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:42:54,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 399 [2025-03-16 19:42:54,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:55,005 INFO L225 Difference]: With dead ends: 1119 [2025-03-16 19:42:55,006 INFO L226 Difference]: Without dead ends: 559 [2025-03-16 19:42:55,008 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-16 19:42:55,011 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 0 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1625 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-16 19:42:55,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1625 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:42:55,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-16 19:42:55,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2025-03-16 19:42:55,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 325 states have (on average 1.5261538461538462) internal successors, (496), 327 states have internal predecessors, (496), 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-16 19:42:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 933 transitions. [2025-03-16 19:42:55,072 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 933 transitions. Word has length 399 [2025-03-16 19:42:55,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:55,073 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 933 transitions. [2025-03-16 19:42:55,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-16 19:42:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 933 transitions. [2025-03-16 19:42:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2025-03-16 19:42:55,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:55,083 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-16 19:42:55,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:42:55,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:55,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash -582718265, now seen corresponding path program 1 times [2025-03-16 19:42:55,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:55,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280587506] [2025-03-16 19:42:55,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:55,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:55,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-03-16 19:42:55,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-03-16 19:42:55,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:55,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:56,485 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-16 19:42:56,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:56,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280587506] [2025-03-16 19:42:56,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280587506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:56,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:56,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:42:56,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871446554] [2025-03-16 19:42:56,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:56,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:42:56,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:56,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:42:56,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:42:56,487 INFO L87 Difference]: Start difference. First operand 559 states and 933 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:43:00,508 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-16 19:43:01,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:01,248 INFO L93 Difference]: Finished difference Result 1241 states and 2056 transitions. [2025-03-16 19:43:01,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:01,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 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 400 [2025-03-16 19:43:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:01,262 INFO L225 Difference]: With dead ends: 1241 [2025-03-16 19:43:01,262 INFO L226 Difference]: Without dead ends: 1127 [2025-03-16 19:43:01,264 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-16 19:43:01,265 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 643 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 70 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:01,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 2047 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 115 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-16 19:43:01,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-03-16 19:43:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1120. [2025-03-16 19:43:01,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 651 states have (on average 1.5238095238095237) internal successors, (992), 658 states have internal predecessors, (992), 429 states have call successors, (429), 36 states have call predecessors, (429), 39 states have return successors, (459), 429 states have call predecessors, (459), 429 states have call successors, (459) [2025-03-16 19:43:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1880 transitions. [2025-03-16 19:43:01,382 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1880 transitions. Word has length 400 [2025-03-16 19:43:01,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:01,383 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 1880 transitions. [2025-03-16 19:43:01,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:43:01,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1880 transitions. [2025-03-16 19:43:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2025-03-16 19:43:01,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:01,396 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-16 19:43:01,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:43:01,396 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:01,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:01,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1554634885, now seen corresponding path program 1 times [2025-03-16 19:43:01,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:01,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416861547] [2025-03-16 19:43:01,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:01,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:01,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-03-16 19:43:01,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-03-16 19:43:01,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:01,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:02,540 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-16 19:43:02,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:02,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416861547] [2025-03-16 19:43:02,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416861547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:02,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:02,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:43:02,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875423113] [2025-03-16 19:43:02,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:02,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:43:02,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:02,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:43:02,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:02,543 INFO L87 Difference]: Start difference. First operand 1120 states and 1880 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:43:06,562 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-16 19:43:07,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:07,280 INFO L93 Difference]: Finished difference Result 2224 states and 3716 transitions. [2025-03-16 19:43:07,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:07,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 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 400 [2025-03-16 19:43:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:07,292 INFO L225 Difference]: With dead ends: 2224 [2025-03-16 19:43:07,293 INFO L226 Difference]: Without dead ends: 1088 [2025-03-16 19:43:07,297 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-16 19:43:07,298 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 645 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 70 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:07,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 2048 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 115 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-16 19:43:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2025-03-16 19:43:07,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1084. [2025-03-16 19:43:07,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 632 states have (on average 1.514240506329114) internal successors, (957), 639 states have internal predecessors, (957), 412 states have call successors, (412), 35 states have call predecessors, (412), 39 states have return successors, (436), 413 states have call predecessors, (436), 412 states have call successors, (436) [2025-03-16 19:43:07,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1805 transitions. [2025-03-16 19:43:07,359 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1805 transitions. Word has length 400 [2025-03-16 19:43:07,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:07,359 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1805 transitions. [2025-03-16 19:43:07,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:43:07,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1805 transitions. [2025-03-16 19:43:07,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2025-03-16 19:43:07,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:07,368 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-16 19:43:07,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:43:07,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:07,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:07,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1452560387, now seen corresponding path program 1 times [2025-03-16 19:43:07,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:07,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659343518] [2025-03-16 19:43:07,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:07,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:07,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-03-16 19:43:07,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-03-16 19:43:07,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:07,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:08,860 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-16 19:43:08,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:08,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659343518] [2025-03-16 19:43:08,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659343518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:08,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:08,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:43:08,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107097981] [2025-03-16 19:43:08,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:08,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:43:08,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:08,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:43:08,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:08,862 INFO L87 Difference]: Start difference. First operand 1084 states and 1805 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:43:12,880 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-16 19:43:16,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:18,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:18,763 INFO L93 Difference]: Finished difference Result 1693 states and 2777 transitions. [2025-03-16 19:43:18,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:43:18,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 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 400 [2025-03-16 19:43:18,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:18,772 INFO L225 Difference]: With dead ends: 1693 [2025-03-16 19:43:18,772 INFO L226 Difference]: Without dead ends: 1003 [2025-03-16 19:43:18,775 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-16 19:43:18,776 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 685 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 90 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:18,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1703 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 447 Invalid, 2 Unknown, 0 Unchecked, 9.7s Time] [2025-03-16 19:43:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-03-16 19:43:18,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 993. [2025-03-16 19:43:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 580 states have (on average 1.4844827586206897) internal successors, (861), 585 states have internal predecessors, (861), 373 states have call successors, (373), 35 states have call predecessors, (373), 39 states have return successors, (394), 374 states have call predecessors, (394), 373 states have call successors, (394) [2025-03-16 19:43:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1628 transitions. [2025-03-16 19:43:18,842 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1628 transitions. Word has length 400 [2025-03-16 19:43:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:18,843 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1628 transitions. [2025-03-16 19:43:18,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:43:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1628 transitions. [2025-03-16 19:43:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-03-16 19:43:18,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:18,853 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] [2025-03-16 19:43:18,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:43:18,853 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:18,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:18,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1294551267, now seen corresponding path program 1 times [2025-03-16 19:43:18,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:18,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447796270] [2025-03-16 19:43:18,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:18,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:19,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-16 19:43:19,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-16 19:43:19,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:19,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:19,518 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-16 19:43:19,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:19,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447796270] [2025-03-16 19:43:19,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447796270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:19,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:19,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:43:19,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513379867] [2025-03-16 19:43:19,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:19,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:43:19,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:19,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:43:19,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:43:19,521 INFO L87 Difference]: Start difference. First operand 993 states and 1628 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-16 19:43:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:19,603 INFO L93 Difference]: Finished difference Result 1979 states and 3244 transitions. [2025-03-16 19:43:19,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:43:19,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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 438 [2025-03-16 19:43:19,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:19,611 INFO L225 Difference]: With dead ends: 1979 [2025-03-16 19:43:19,612 INFO L226 Difference]: Without dead ends: 1009 [2025-03-16 19:43:19,616 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-16 19:43:19,616 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 0 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1629 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-16 19:43:19,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1629 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:43:19,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-03-16 19:43:19,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2025-03-16 19:43:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 592 states have (on average 1.474662162162162) internal successors, (873), 597 states have internal predecessors, (873), 373 states have call successors, (373), 35 states have call predecessors, (373), 43 states have return successors, (401), 378 states have call predecessors, (401), 373 states have call successors, (401) [2025-03-16 19:43:19,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1647 transitions. [2025-03-16 19:43:19,680 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1647 transitions. Word has length 438 [2025-03-16 19:43:19,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:19,681 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1647 transitions. [2025-03-16 19:43:19,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-16 19:43:19,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1647 transitions. [2025-03-16 19:43:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-16 19:43:19,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:19,688 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] [2025-03-16 19:43:19,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:43:19,688 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:19,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:19,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1252744872, now seen corresponding path program 1 times [2025-03-16 19:43:19,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:19,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732479920] [2025-03-16 19:43:19,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:19,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:20,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-16 19:43:20,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-16 19:43:20,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:20,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:20,630 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-16 19:43:20,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:20,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732479920] [2025-03-16 19:43:20,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732479920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:20,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:20,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:43:20,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420651924] [2025-03-16 19:43:20,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:20,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:43:20,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:20,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:43:20,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:43:20,632 INFO L87 Difference]: Start difference. First operand 1009 states and 1647 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-16 19:43:24,649 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-16 19:43:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:24,810 INFO L93 Difference]: Finished difference Result 1501 states and 2403 transitions. [2025-03-16 19:43:24,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:43:24,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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 461 [2025-03-16 19:43:24,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:24,818 INFO L225 Difference]: With dead ends: 1501 [2025-03-16 19:43:24,819 INFO L226 Difference]: Without dead ends: 999 [2025-03-16 19:43:24,821 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-16 19:43:24,822 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 447 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:24,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1699 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 19:43:24,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2025-03-16 19:43:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 995. [2025-03-16 19:43:24,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 582 states have (on average 1.4415807560137457) internal successors, (839), 586 states have internal predecessors, (839), 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-16 19:43:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1606 transitions. [2025-03-16 19:43:24,881 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1606 transitions. Word has length 461 [2025-03-16 19:43:24,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:24,881 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1606 transitions. [2025-03-16 19:43:24,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-16 19:43:24,881 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1606 transitions. [2025-03-16 19:43:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-16 19:43:24,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:24,888 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] [2025-03-16 19:43:24,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:43:24,888 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:24,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:24,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2106581768, now seen corresponding path program 1 times [2025-03-16 19:43:24,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:24,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909412109] [2025-03-16 19:43:24,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:24,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:25,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-16 19:43:25,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-16 19:43:25,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:25,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:25,775 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-16 19:43:25,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:25,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909412109] [2025-03-16 19:43:25,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909412109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:25,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:25,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:43:25,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126074787] [2025-03-16 19:43:25,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:25,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:43:25,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:25,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:43:25,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:43:25,776 INFO L87 Difference]: Start difference. First operand 995 states and 1606 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-16 19:43:29,796 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-16 19:43:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:29,990 INFO L93 Difference]: Finished difference Result 1441 states and 2269 transitions. [2025-03-16 19:43:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:43:29,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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 461 [2025-03-16 19:43:29,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:29,996 INFO L225 Difference]: With dead ends: 1441 [2025-03-16 19:43:29,996 INFO L226 Difference]: Without dead ends: 791 [2025-03-16 19:43:29,998 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-16 19:43:29,999 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 436 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:29,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 2022 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-16 19:43:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2025-03-16 19:43:30,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 785. [2025-03-16 19:43:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 457 states have (on average 1.4179431072210065) internal successors, (648), 461 states have internal predecessors, (648), 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-16 19:43:30,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1260 transitions. [2025-03-16 19:43:30,072 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1260 transitions. Word has length 461 [2025-03-16 19:43:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:30,073 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1260 transitions. [2025-03-16 19:43:30,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-16 19:43:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1260 transitions. [2025-03-16 19:43:30,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-16 19:43:30,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:30,078 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] [2025-03-16 19:43:30,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:43:30,078 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:30,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:30,079 INFO L85 PathProgramCache]: Analyzing trace with hash 828290004, now seen corresponding path program 1 times [2025-03-16 19:43:30,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:30,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37808843] [2025-03-16 19:43:30,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:30,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:30,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-16 19:43:30,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-16 19:43:30,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:30,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:31,116 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-16 19:43:31,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:31,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37808843] [2025-03-16 19:43:31,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37808843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:31,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890021665] [2025-03-16 19:43:31,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:31,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:31,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:31,118 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-16 19:43:31,120 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-16 19:43:32,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-16 19:43:32,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-16 19:43:32,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:32,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:32,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 2670 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-16 19:43:32,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 8091 backedges. 1340 proven. 0 refuted. 0 times theorem prover too weak. 6751 trivial. 0 not checked. [2025-03-16 19:43:33,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:43:33,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890021665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:33,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:43:33,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 14 [2025-03-16 19:43:33,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596165360] [2025-03-16 19:43:33,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:33,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:43:33,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:33,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:43:33,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:43:33,534 INFO L87 Difference]: Start difference. First operand 785 states and 1260 transitions. Second operand has 9 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 5 states have call successors, (71), 3 states have call predecessors, (71), 3 states have return successors, (71), 5 states have call predecessors, (71), 5 states have call successors, (71) [2025-03-16 19:43:37,553 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-16 19:43:41,561 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-16 19:43:45,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:54,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:54,827 INFO L93 Difference]: Finished difference Result 2590 states and 4052 transitions. [2025-03-16 19:43:54,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:43:54,828 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 5 states have call successors, (71), 3 states have call predecessors, (71), 3 states have return successors, (71), 5 states have call predecessors, (71), 5 states have call successors, (71) Word has length 476 [2025-03-16 19:43:54,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:54,836 INFO L225 Difference]: With dead ends: 2590 [2025-03-16 19:43:54,836 INFO L226 Difference]: Without dead ends: 1804 [2025-03-16 19:43:54,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:43:54,840 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 986 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 3169 mSolverCounterSat, 1147 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 4319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1147 IncrementalHoareTripleChecker+Valid, 3169 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:54,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1147 Valid, 1892 Invalid, 4319 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1147 Valid, 3169 Invalid, 3 Unknown, 0 Unchecked, 20.7s Time] [2025-03-16 19:43:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2025-03-16 19:43:54,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1781. [2025-03-16 19:43:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1029 states have (on average 1.227405247813411) internal successors, (1263), 1025 states have internal predecessors, (1263), 684 states have call successors, (684), 41 states have call predecessors, (684), 67 states have return successors, (767), 714 states have call predecessors, (767), 684 states have call successors, (767) [2025-03-16 19:43:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2714 transitions. [2025-03-16 19:43:54,958 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2714 transitions. Word has length 476 [2025-03-16 19:43:54,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:54,959 INFO L471 AbstractCegarLoop]: Abstraction has 1781 states and 2714 transitions. [2025-03-16 19:43:54,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 5 states have call successors, (71), 3 states have call predecessors, (71), 3 states have return successors, (71), 5 states have call predecessors, (71), 5 states have call successors, (71) [2025-03-16 19:43:54,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2714 transitions. [2025-03-16 19:43:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-03-16 19:43:54,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:54,967 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] [2025-03-16 19:43:54,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:43:55,167 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-16 19:43:55,168 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:55,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:55,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2112155314, now seen corresponding path program 1 times [2025-03-16 19:43:55,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:55,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673193394] [2025-03-16 19:43:55,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:55,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:55,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-16 19:43:55,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-16 19:43:55,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:55,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:56,384 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-16 19:43:56,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:56,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673193394] [2025-03-16 19:43:56,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673193394] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:56,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96636186] [2025-03-16 19:43:56,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:56,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:56,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:56,389 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-16 19:43:56,390 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-16 19:43:57,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-16 19:43:57,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-16 19:43:57,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:57,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:57,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 2827 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-16 19:43:57,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:57,565 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 222 treesize of output 268 [2025-03-16 19:43:58,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 210 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 178 [2025-03-16 19:43:59,952 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-16 19:44:00,767 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-16 19:44:01,419 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 29 treesize of output 34 [2025-03-16 19:44:02,062 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 29 treesize of output 34 [2025-03-16 19:44:02,983 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 29 treesize of output 34