./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_sync.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_sync.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:25:39,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:25:39,947 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:25:39,952 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:25:39,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:25:39,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:25:39,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:25:39,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:25:39,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:25:39,965 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:25:39,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:25:39,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:25:39,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:25:39,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:25:39,966 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:25:39,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:25:39,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:25:39,966 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:25:39,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:25:39,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:25:39,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:25:39,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:25:39,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:25:39,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:25:39,967 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:25:39,967 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:25:39,967 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:25:39,967 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:25:39,967 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:25:39,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:25:39,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:25:39,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:25:39,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:39,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:25:39,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:25:39,967 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:25:39,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:25:39,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:25:39,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:25:39,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:25:39,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:25:39,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:25:39,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:25:39,968 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef [2025-02-07 21:25:40,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:25:40,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:25:40,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:25:40,163 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:25:40,163 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:25:40,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_sync.i [2025-02-07 21:25:41,221 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dfccb70b1/468d6cc0e4e0497c99ced67853acbc6a/FLAG2c1d8675e [2025-02-07 21:25:41,537 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:25:41,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i [2025-02-07 21:25:41,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dfccb70b1/468d6cc0e4e0497c99ced67853acbc6a/FLAG2c1d8675e [2025-02-07 21:25:41,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dfccb70b1/468d6cc0e4e0497c99ced67853acbc6a [2025-02-07 21:25:41,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:25:41,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:25:41,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:41,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:25:41,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:25:41,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:41" (1/1) ... [2025-02-07 21:25:41,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@442f0f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:41, skipping insertion in model container [2025-02-07 21:25:41,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:41" (1/1) ... [2025-02-07 21:25:41,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:25:41,878 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i[34698,34711] [2025-02-07 21:25:41,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:41,954 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:25:41,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i[34698,34711] [2025-02-07 21:25:42,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:42,045 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:25:42,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:42 WrapperNode [2025-02-07 21:25:42,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:42,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:42,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:25:42,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:25:42,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:42" (1/1) ... [2025-02-07 21:25:42,065 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:42" (1/1) ... [2025-02-07 21:25:42,090 INFO L138 Inliner]: procedures = 245, calls = 253, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 551 [2025-02-07 21:25:42,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:42,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:25:42,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:25:42,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:25:42,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:42" (1/1) ... [2025-02-07 21:25:42,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:42" (1/1) ... [2025-02-07 21:25:42,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:42" (1/1) ... [2025-02-07 21:25:42,123 INFO L175 MemorySlicer]: Split 126 memory accesses to 17 slices as follows [2, 3, 8, 8, 8, 20, 8, 3, 16, 12, 7, 3, 3, 12, 7, 6, 0]. 16 percent of accesses are in the largest equivalence class. The 33 initializations are split as follows [2, 0, 3, 3, 3, 6, 4, 0, 6, 2, 0, 0, 0, 2, 0, 2, 0]. The 38 writes are split as follows [0, 1, 2, 2, 2, 8, 2, 1, 5, 4, 1, 1, 1, 5, 1, 2, 0]. [2025-02-07 21:25:42,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:42" (1/1) ... [2025-02-07 21:25:42,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:42" (1/1) ... [2025-02-07 21:25:42,140 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:42" (1/1) ... [2025-02-07 21:25:42,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:42" (1/1) ... [2025-02-07 21:25:42,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:42" (1/1) ... [2025-02-07 21:25:42,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:42" (1/1) ... [2025-02-07 21:25:42,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:25:42,153 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:25:42,153 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:25:42,153 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:25:42,154 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:42" (1/1) ... [2025-02-07 21:25:42,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:42,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:42,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:25:42,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 21:25:42,195 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_signal [2025-02-07 21:25:42,195 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_signal [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-02-07 21:25:42,195 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-07 21:25:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-02-07 21:25:42,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:25:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:25:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 21:25:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 21:25:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 21:25:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 21:25:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 21:25:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 21:25:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 21:25:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 21:25:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 21:25:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 21:25:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 21:25:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 21:25:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-07 21:25:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-07 21:25:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-07 21:25:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_init [2025-02-07 21:25:42,200 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_init [2025-02-07 21:25:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:25:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:25:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 21:25:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 21:25:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 21:25:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 21:25:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 21:25:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 21:25:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 21:25:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 21:25:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 21:25:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 21:25:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 21:25:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 21:25:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-07 21:25:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-07 21:25:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-07 21:25:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:25:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 21:25:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 21:25:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-07 21:25:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-07 21:25:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-07 21:25:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-07 21:25:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-07 21:25:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-07 21:25:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-07 21:25:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-07 21:25:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-07 21:25:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-07 21:25:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-07 21:25:42,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_wait [2025-02-07 21:25:42,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_wait [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-07 21:25:42,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:42,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-07 21:25:42,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 21:25:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 21:25:42,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 21:25:42,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-07 21:25:42,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-07 21:25:42,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-07 21:25:42,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:25:42,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:25:42,398 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:25:42,400 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:25:42,702 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L993-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-07 21:25:42,703 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L993-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset;#t~ret139#1.base, #t~ret139#1.offset := main_thread_#res#1.base, main_thread_#res#1.offset;havoc main_thread_#t~nondet64#1, main_thread_#t~nondet65#1, main_thread_#t~ret66#1, main_thread_#t~ret67#1, main_thread_#t~ret68#1, main_thread_#t~ret69#1, main_thread_#t~ret70#1, main_thread_#t~mem71#1, main_thread_#t~ret72#1, main_thread_#t~mem73#1, main_thread_#t~ret74#1, main_thread_#t~mem75#1, main_thread_~arg#1.base, main_thread_~arg#1.offset, main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset, main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset;havoc main_thread_#in~arg#1.base, main_thread_#in~arg#1.offset;assume { :end_inline_main_thread } true;#t~funptrres136#1.base, #t~funptrres136#1.offset := #t~ret139#1.base, #t~ret139#1.offset; [2025-02-07 21:25:42,703 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L993-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:42,703 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L985-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-07 21:25:42,703 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L985-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));~__CS_error~0 := 1;~__CS_ret~0 := ~__CS_ret_ERROR~0;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-07 21:25:42,703 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L985-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:42,704 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L977: assume -2147483648 <= main_thread_#t~ret70#1 && main_thread_#t~ret70#1 <= 2147483647;havoc main_thread_#t~ret70#1; [2025-02-07 21:25:42,704 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L977-1: SUMMARY for call main_thread_#t~ret70#1 := __CS_pthread_create(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset, 0, 0, #funAddr~thread2.base, #funAddr~thread2.offset, 0, 0); srcloc: null [2025-02-07 21:25:42,704 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: main_thread_#t~ret66#1 := __CS_pthread_mutex_init_#res#1;havoc __CS_pthread_mutex_init_~mutex#1.base, __CS_pthread_mutex_init_~mutex#1.offset, __CS_pthread_mutex_init_~attr#1.base, __CS_pthread_mutex_init_~attr#1.offset;havoc __CS_pthread_mutex_init_#in~mutex#1.base, __CS_pthread_mutex_init_#in~mutex#1.offset, __CS_pthread_mutex_init_#in~attr#1.base, __CS_pthread_mutex_init_#in~attr#1.offset;assume { :end_inline___CS_pthread_mutex_init } true;assume -2147483648 <= main_thread_#t~ret66#1 && main_thread_#t~ret66#1 <= 2147483647;havoc main_thread_#t~ret66#1; [2025-02-07 21:25:42,704 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L978-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-07 21:25:42,704 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L978-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));call main_thread_#t~mem71#1 := read~int#15(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset, 1); [2025-02-07 21:25:42,704 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L978-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:42,704 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L970-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-07 21:25:42,704 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L970-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:42,704 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L970-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:42,704 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-07 21:25:42,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:42,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:42,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: assume -2147483648 <= main_thread_#t~ret72#1 && main_thread_#t~ret72#1 <= 2147483647;havoc main_thread_#t~mem71#1;havoc main_thread_#t~ret72#1; [2025-02-07 21:25:42,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L979-1: SUMMARY for call main_thread_#t~ret72#1 := __CS_pthread_join(main_thread_#t~mem71#1, 0, 0); srcloc: null [2025-02-07 21:25:42,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L971: assume -2147483648 <= main_thread_#t~ret67#1 && main_thread_#t~ret67#1 <= 2147483647;havoc main_thread_#t~ret67#1; [2025-02-07 21:25:42,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L971-1: SUMMARY for call main_thread_#t~ret67#1 := __CS_pthread_cond_init(~#empty~0.base, ~#empty~0.offset + (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296), 0, 0); srcloc: null [2025-02-07 21:25:42,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L980-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-07 21:25:42,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L980-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));call main_thread_#t~mem73#1 := read~int#15(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset, 1); [2025-02-07 21:25:42,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L980-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:42,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L972-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-07 21:25:42,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L972-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:42,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L972-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:42,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-07 21:25:42,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:42,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:42,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L981: assume -2147483648 <= main_thread_#t~ret74#1 && main_thread_#t~ret74#1 <= 2147483647;havoc main_thread_#t~mem73#1;havoc main_thread_#t~ret74#1; [2025-02-07 21:25:42,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L981-1: SUMMARY for call main_thread_#t~ret74#1 := __CS_pthread_join(main_thread_#t~mem73#1, 0, 0); srcloc: null [2025-02-07 21:25:42,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L973: assume -2147483648 <= main_thread_#t~ret68#1 && main_thread_#t~ret68#1 <= 2147483647;havoc main_thread_#t~ret68#1; [2025-02-07 21:25:42,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L973-1: SUMMARY for call main_thread_#t~ret68#1 := __CS_pthread_cond_init(~#full~0.base, ~#full~0.offset + (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296), 0, 0); srcloc: null [2025-02-07 21:25:42,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L982-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-07 21:25:42,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L982-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));call main_thread_#t~mem75#1 := read~int#9(~#num~0.base, ~#num~0.offset + 4 * (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296), 4); [2025-02-07 21:25:42,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L982-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:42,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L974-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-07 21:25:42,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L974-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:42,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L974-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:42,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-07 21:25:42,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:42,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:42,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983: assume 1 != main_thread_#t~mem75#1;havoc main_thread_#t~mem75#1; [2025-02-07 21:25:42,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983: assume !(1 != main_thread_#t~mem75#1);havoc main_thread_#t~mem75#1; [2025-02-07 21:25:42,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L975: assume -2147483648 <= main_thread_#t~ret69#1 && main_thread_#t~ret69#1 <= 2147483647;havoc main_thread_#t~ret69#1; [2025-02-07 21:25:42,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L975-1: SUMMARY for call main_thread_#t~ret69#1 := __CS_pthread_create(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset, 0, 0, #funAddr~thread1.base, #funAddr~thread1.offset, 0, 0); srcloc: null [2025-02-07 21:25:42,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L976-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-07 21:25:42,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L976-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:42,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L976-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:43,005 INFO L? ?]: Removed 125 outVars from TransFormulas that were not future-live. [2025-02-07 21:25:43,005 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:25:43,015 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:25:43,016 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:25:43,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:43 BoogieIcfgContainer [2025-02-07 21:25:43,016 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:25:43,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:25:43,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:25:43,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:25:43,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:25:41" (1/3) ... [2025-02-07 21:25:43,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f61ab27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:43, skipping insertion in model container [2025-02-07 21:25:43,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:42" (2/3) ... [2025-02-07 21:25:43,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f61ab27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:43, skipping insertion in model container [2025-02-07 21:25:43,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:43" (3/3) ... [2025-02-07 21:25:43,022 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_sync.i [2025-02-07 21:25:43,030 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:25:43,031 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_sync.i that has 11 procedures, 152 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-07 21:25:43,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:25:43,084 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;@54a44cf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:25:43,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:25:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 91 states have internal predecessors, (125), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-07 21:25:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-07 21:25:43,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:43,097 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 21:25:43,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:43,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:43,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1153241050, now seen corresponding path program 1 times [2025-02-07 21:25:43,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:43,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523200555] [2025-02-07 21:25:43,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:43,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:43,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-07 21:25:43,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-07 21:25:43,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:43,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 21:25:43,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:43,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523200555] [2025-02-07 21:25:43,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523200555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:43,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:43,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:43,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864049932] [2025-02-07 21:25:43,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:43,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:43,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:43,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:43,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:43,536 INFO L87 Difference]: Start difference. First operand has 139 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 91 states have internal predecessors, (125), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 21:25:43,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:43,672 INFO L93 Difference]: Finished difference Result 271 states and 432 transitions. [2025-02-07 21:25:43,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:43,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 70 [2025-02-07 21:25:43,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:43,682 INFO L225 Difference]: With dead ends: 271 [2025-02-07 21:25:43,682 INFO L226 Difference]: Without dead ends: 127 [2025-02-07 21:25:43,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:43,690 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 2 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:43,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 385 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:25:43,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-07 21:25:43,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2025-02-07 21:25:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 81 states have internal predecessors, (98), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-07 21:25:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 172 transitions. [2025-02-07 21:25:43,741 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 172 transitions. Word has length 70 [2025-02-07 21:25:43,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:43,742 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 172 transitions. [2025-02-07 21:25:43,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 21:25:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 172 transitions. [2025-02-07 21:25:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-07 21:25:43,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:43,748 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 21:25:43,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:25:43,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:43,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:43,749 INFO L85 PathProgramCache]: Analyzing trace with hash -849315842, now seen corresponding path program 1 times [2025-02-07 21:25:43,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:43,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972921638] [2025-02-07 21:25:43,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:43,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:43,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-07 21:25:43,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-07 21:25:43,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:43,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 21:25:43,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:43,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972921638] [2025-02-07 21:25:43,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972921638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:43,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:43,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:43,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666456714] [2025-02-07 21:25:43,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:43,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:43,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:43,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:43,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:43,973 INFO L87 Difference]: Start difference. First operand 126 states and 172 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 21:25:44,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:44,007 INFO L93 Difference]: Finished difference Result 251 states and 344 transitions. [2025-02-07 21:25:44,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:44,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2025-02-07 21:25:44,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:44,010 INFO L225 Difference]: With dead ends: 251 [2025-02-07 21:25:44,011 INFO L226 Difference]: Without dead ends: 127 [2025-02-07 21:25:44,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:44,012 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:44,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 337 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:44,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-07 21:25:44,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-07 21:25:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 82 states have internal predecessors, (99), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-07 21:25:44,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 173 transitions. [2025-02-07 21:25:44,022 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 173 transitions. Word has length 72 [2025-02-07 21:25:44,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:44,022 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 173 transitions. [2025-02-07 21:25:44,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 21:25:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 173 transitions. [2025-02-07 21:25:44,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-07 21:25:44,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:44,027 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 21:25:44,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:25:44,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:44,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:44,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1865025830, now seen corresponding path program 1 times [2025-02-07 21:25:44,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:44,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120556491] [2025-02-07 21:25:44,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:44,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:44,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-07 21:25:44,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-07 21:25:44,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:44,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:44,238 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 21:25:44,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:44,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120556491] [2025-02-07 21:25:44,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120556491] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:44,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612406537] [2025-02-07 21:25:44,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:44,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:44,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:44,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:44,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 21:25:44,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-07 21:25:44,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-07 21:25:44,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:44,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:44,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:44,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:44,552 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 21:25:44,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 21:25:44,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612406537] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:44,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:44,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-07 21:25:44,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769179868] [2025-02-07 21:25:44,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:44,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:25:44,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:44,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:25:44,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:44,600 INFO L87 Difference]: Start difference. First operand 127 states and 173 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-07 21:25:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:44,638 INFO L93 Difference]: Finished difference Result 254 states and 348 transitions. [2025-02-07 21:25:44,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:44,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 73 [2025-02-07 21:25:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:44,640 INFO L225 Difference]: With dead ends: 254 [2025-02-07 21:25:44,640 INFO L226 Difference]: Without dead ends: 129 [2025-02-07 21:25:44,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:44,641 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:44,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 671 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:44,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-07 21:25:44,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-02-07 21:25:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 84 states have (on average 1.2023809523809523) internal successors, (101), 84 states have internal predecessors, (101), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-07 21:25:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 175 transitions. [2025-02-07 21:25:44,648 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 175 transitions. Word has length 73 [2025-02-07 21:25:44,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:44,648 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 175 transitions. [2025-02-07 21:25:44,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-07 21:25:44,649 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 175 transitions. [2025-02-07 21:25:44,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:25:44,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:44,650 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:44,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 21:25:44,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:44,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:44,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:44,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1547469862, now seen corresponding path program 2 times [2025-02-07 21:25:44,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:44,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789813256] [2025-02-07 21:25:44,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:44,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:44,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-07 21:25:44,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 75 statements. [2025-02-07 21:25:44,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:44,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-02-07 21:25:45,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:45,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789813256] [2025-02-07 21:25:45,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789813256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:45,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:45,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:45,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909112813] [2025-02-07 21:25:45,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:45,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:45,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:45,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:45,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:45,084 INFO L87 Difference]: Start difference. First operand 129 states and 175 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 21:25:45,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:45,111 INFO L93 Difference]: Finished difference Result 249 states and 344 transitions. [2025-02-07 21:25:45,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:45,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2025-02-07 21:25:45,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:45,114 INFO L225 Difference]: With dead ends: 249 [2025-02-07 21:25:45,114 INFO L226 Difference]: Without dead ends: 223 [2025-02-07 21:25:45,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:45,115 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 137 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:45,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 597 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:45,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-07 21:25:45,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-02-07 21:25:45,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 145 states have (on average 1.2) internal successors, (174), 145 states have internal predecessors, (174), 63 states have call successors, (63), 14 states have call predecessors, (63), 14 states have return successors, (69), 63 states have call predecessors, (69), 63 states have call successors, (69) [2025-02-07 21:25:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 306 transitions. [2025-02-07 21:25:45,132 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 306 transitions. Word has length 75 [2025-02-07 21:25:45,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:45,132 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 306 transitions. [2025-02-07 21:25:45,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 21:25:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 306 transitions. [2025-02-07 21:25:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-07 21:25:45,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:45,135 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 6, 6, 6, 6, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:45,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:25:45,136 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:45,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:45,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1136073575, now seen corresponding path program 1 times [2025-02-07 21:25:45,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:45,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855472494] [2025-02-07 21:25:45,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:45,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:45,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-07 21:25:45,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-07 21:25:45,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:45,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-07 21:25:45,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:45,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855472494] [2025-02-07 21:25:45,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855472494] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:45,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375148238] [2025-02-07 21:25:45,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:45,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:45,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:45,369 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:45,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 21:25:45,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-07 21:25:45,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-07 21:25:45,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:45,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:45,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 1220 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 21:25:45,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 515 proven. 0 refuted. 0 times theorem prover too weak. 521 trivial. 0 not checked. [2025-02-07 21:25:45,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 21:25:45,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375148238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:45,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 21:25:45,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-07 21:25:45,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542389506] [2025-02-07 21:25:45,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:45,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:45,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:45,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:45,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:45,743 INFO L87 Difference]: Start difference. First operand 223 states and 306 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-07 21:25:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:45,760 INFO L93 Difference]: Finished difference Result 443 states and 619 transitions. [2025-02-07 21:25:45,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:45,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 206 [2025-02-07 21:25:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:45,764 INFO L225 Difference]: With dead ends: 443 [2025-02-07 21:25:45,764 INFO L226 Difference]: Without dead ends: 229 [2025-02-07 21:25:45,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:45,766 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 3 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:45,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 334 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-07 21:25:45,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 225. [2025-02-07 21:25:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 147 states have (on average 1.1972789115646258) internal successors, (176), 147 states have internal predecessors, (176), 63 states have call successors, (63), 14 states have call predecessors, (63), 14 states have return successors, (69), 63 states have call predecessors, (69), 63 states have call successors, (69) [2025-02-07 21:25:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 308 transitions. [2025-02-07 21:25:45,782 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 308 transitions. Word has length 206 [2025-02-07 21:25:45,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:45,782 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 308 transitions. [2025-02-07 21:25:45,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-07 21:25:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 308 transitions. [2025-02-07 21:25:45,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-07 21:25:45,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:45,789 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 6, 6, 6, 6, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:45,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 21:25:45,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:45,990 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:45,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:45,990 INFO L85 PathProgramCache]: Analyzing trace with hash 146210862, now seen corresponding path program 1 times [2025-02-07 21:25:45,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:45,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705002301] [2025-02-07 21:25:45,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:45,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:46,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-07 21:25:46,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-07 21:25:46,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:46,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1037 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-02-07 21:25:46,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:46,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705002301] [2025-02-07 21:25:46,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705002301] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:46,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11433679] [2025-02-07 21:25:46,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:46,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:46,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:46,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:46,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 21:25:46,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-07 21:25:46,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-07 21:25:46,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:46,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:46,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:46,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1037 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-02-07 21:25:46,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:46,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1037 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-02-07 21:25:46,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11433679] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:46,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:46,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 5 [2025-02-07 21:25:46,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053607490] [2025-02-07 21:25:46,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:46,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:25:46,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:46,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:25:46,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:46,865 INFO L87 Difference]: Start difference. First operand 225 states and 308 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-02-07 21:25:49,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:49,393 INFO L93 Difference]: Finished difference Result 448 states and 614 transitions. [2025-02-07 21:25:49,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:49,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 209 [2025-02-07 21:25:49,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:49,395 INFO L225 Difference]: With dead ends: 448 [2025-02-07 21:25:49,396 INFO L226 Difference]: Without dead ends: 230 [2025-02-07 21:25:49,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 415 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:49,397 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 2 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:49,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 666 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-07 21:25:49,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-07 21:25:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2025-02-07 21:25:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 152 states have (on average 1.1973684210526316) internal successors, (182), 152 states have internal predecessors, (182), 63 states have call successors, (63), 14 states have call predecessors, (63), 14 states have return successors, (69), 63 states have call predecessors, (69), 63 states have call successors, (69) [2025-02-07 21:25:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 314 transitions. [2025-02-07 21:25:49,412 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 314 transitions. Word has length 209 [2025-02-07 21:25:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:49,412 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 314 transitions. [2025-02-07 21:25:49,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-02-07 21:25:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 314 transitions. [2025-02-07 21:25:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-07 21:25:49,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:49,415 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2025-02-07 21:25:49,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 21:25:49,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:49,616 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:49,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:49,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1361933796, now seen corresponding path program 2 times [2025-02-07 21:25:49,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:49,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366987653] [2025-02-07 21:25:49,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:49,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:49,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 214 statements into 2 equivalence classes. [2025-02-07 21:25:49,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 214 statements. [2025-02-07 21:25:49,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:49,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1061 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1061 trivial. 0 not checked. [2025-02-07 21:25:49,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:49,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366987653] [2025-02-07 21:25:49,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366987653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:49,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:49,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:49,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593993128] [2025-02-07 21:25:49,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:49,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:49,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:49,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:49,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:49,843 INFO L87 Difference]: Start difference. First operand 230 states and 314 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-07 21:25:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:51,420 INFO L93 Difference]: Finished difference Result 424 states and 573 transitions. [2025-02-07 21:25:51,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:51,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 214 [2025-02-07 21:25:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:51,422 INFO L225 Difference]: With dead ends: 424 [2025-02-07 21:25:51,422 INFO L226 Difference]: Without dead ends: 222 [2025-02-07 21:25:51,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:51,424 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 157 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:51,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 321 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-07 21:25:51,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-07 21:25:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-02-07 21:25:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 146 states have (on average 1.178082191780822) internal successors, (172), 146 states have internal predecessors, (172), 61 states have call successors, (61), 14 states have call predecessors, (61), 14 states have return successors, (66), 61 states have call predecessors, (66), 61 states have call successors, (66) [2025-02-07 21:25:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 299 transitions. [2025-02-07 21:25:51,443 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 299 transitions. Word has length 214 [2025-02-07 21:25:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:51,444 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 299 transitions. [2025-02-07 21:25:51,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-07 21:25:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 299 transitions. [2025-02-07 21:25:51,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-07 21:25:51,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:51,446 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2025-02-07 21:25:51,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:25:51,446 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:51,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:51,447 INFO L85 PathProgramCache]: Analyzing trace with hash 360471300, now seen corresponding path program 1 times [2025-02-07 21:25:51,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:51,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629511102] [2025-02-07 21:25:51,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:51,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:51,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-07 21:25:51,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-07 21:25:51,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:51,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1061 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1060 trivial. 0 not checked. [2025-02-07 21:25:51,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:51,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629511102] [2025-02-07 21:25:51,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629511102] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:51,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174684632] [2025-02-07 21:25:51,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:51,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:51,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:51,736 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:51,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 21:25:51,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-07 21:25:52,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-07 21:25:52,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:52,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:52,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:52,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1061 backedges. 515 proven. 1 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2025-02-07 21:25:52,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1061 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1060 trivial. 0 not checked. [2025-02-07 21:25:52,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174684632] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:52,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:52,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-07 21:25:52,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147408970] [2025-02-07 21:25:52,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:52,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:25:52,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:52,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:25:52,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:52,311 INFO L87 Difference]: Start difference. First operand 222 states and 299 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-02-07 21:25:52,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:52,343 INFO L93 Difference]: Finished difference Result 442 states and 606 transitions. [2025-02-07 21:25:52,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:52,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 214 [2025-02-07 21:25:52,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:52,346 INFO L225 Difference]: With dead ends: 442 [2025-02-07 21:25:52,347 INFO L226 Difference]: Without dead ends: 234 [2025-02-07 21:25:52,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 425 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:52,348 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 6 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:52,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 483 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:52,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-02-07 21:25:52,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-02-07 21:25:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 158 states have (on average 1.1898734177215189) internal successors, (188), 158 states have internal predecessors, (188), 61 states have call successors, (61), 14 states have call predecessors, (61), 14 states have return successors, (66), 61 states have call predecessors, (66), 61 states have call successors, (66) [2025-02-07 21:25:52,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 315 transitions. [2025-02-07 21:25:52,392 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 315 transitions. Word has length 214 [2025-02-07 21:25:52,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:52,392 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 315 transitions. [2025-02-07 21:25:52,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-02-07 21:25:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 315 transitions. [2025-02-07 21:25:52,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-07 21:25:52,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:52,394 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:52,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 21:25:52,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-07 21:25:52,595 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:52,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:52,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1568940708, now seen corresponding path program 1 times [2025-02-07 21:25:52,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:52,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281058552] [2025-02-07 21:25:52,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:52,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:52,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-07 21:25:52,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-07 21:25:52,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:52,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2025-02-07 21:25:53,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:53,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281058552] [2025-02-07 21:25:53,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281058552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:53,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:53,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:25:53,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336948887] [2025-02-07 21:25:53,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:53,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:25:53,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:53,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:25:53,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:53,122 INFO L87 Difference]: Start difference. First operand 234 states and 315 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 4 states have call successors, (22), 1 states have call predecessors, (22), 2 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-07 21:25:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:53,329 INFO L93 Difference]: Finished difference Result 272 states and 364 transitions. [2025-02-07 21:25:53,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:53,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 4 states have call successors, (22), 1 states have call predecessors, (22), 2 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 220 [2025-02-07 21:25:53,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:53,332 INFO L225 Difference]: With dead ends: 272 [2025-02-07 21:25:53,332 INFO L226 Difference]: Without dead ends: 234 [2025-02-07 21:25:53,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:25:53,333 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 151 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:53,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 426 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:25:53,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-02-07 21:25:53,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2025-02-07 21:25:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 157 states have (on average 1.1847133757961783) internal successors, (186), 158 states have internal predecessors, (186), 58 states have call successors, (58), 14 states have call predecessors, (58), 15 states have return successors, (64), 58 states have call predecessors, (64), 58 states have call successors, (64) [2025-02-07 21:25:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 308 transitions. [2025-02-07 21:25:53,351 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 308 transitions. Word has length 220 [2025-02-07 21:25:53,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:53,352 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 308 transitions. [2025-02-07 21:25:53,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 4 states have call successors, (22), 1 states have call predecessors, (22), 2 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-07 21:25:53,352 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 308 transitions. [2025-02-07 21:25:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-07 21:25:53,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:53,354 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:53,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 21:25:53,355 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:53,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:53,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1908287076, now seen corresponding path program 2 times [2025-02-07 21:25:53,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:53,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654126131] [2025-02-07 21:25:53,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:53,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:53,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 220 statements into 2 equivalence classes. [2025-02-07 21:25:53,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 220 statements. [2025-02-07 21:25:53,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:53,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2025-02-07 21:25:53,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:53,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654126131] [2025-02-07 21:25:53,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654126131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:53,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:53,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:53,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218047257] [2025-02-07 21:25:53,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:53,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:53,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:53,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:53,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:53,497 INFO L87 Difference]: Start difference. First operand 231 states and 308 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-07 21:25:53,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:53,689 INFO L93 Difference]: Finished difference Result 423 states and 561 transitions. [2025-02-07 21:25:53,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:53,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 220 [2025-02-07 21:25:53,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:53,692 INFO L225 Difference]: With dead ends: 423 [2025-02-07 21:25:53,692 INFO L226 Difference]: Without dead ends: 178 [2025-02-07 21:25:53,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:53,694 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 153 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:53,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 309 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:25:53,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-07 21:25:53,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2025-02-07 21:25:53,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 117 states have (on average 1.1623931623931625) internal successors, (136), 118 states have internal predecessors, (136), 47 states have call successors, (47), 11 states have call predecessors, (47), 10 states have return successors, (49), 45 states have call predecessors, (49), 47 states have call successors, (49) [2025-02-07 21:25:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 232 transitions. [2025-02-07 21:25:53,708 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 232 transitions. Word has length 220 [2025-02-07 21:25:53,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:53,709 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 232 transitions. [2025-02-07 21:25:53,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-07 21:25:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 232 transitions. [2025-02-07 21:25:53,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-07 21:25:53,711 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:53,711 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:53,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 21:25:53,711 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:53,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:53,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1936911612, now seen corresponding path program 1 times [2025-02-07 21:25:53,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:53,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120052922] [2025-02-07 21:25:53,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:53,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:53,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-07 21:25:53,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-07 21:25:53,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:53,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2025-02-07 21:25:54,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:54,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120052922] [2025-02-07 21:25:54,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120052922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:54,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:54,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:25:54,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241876314] [2025-02-07 21:25:54,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:54,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:25:54,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:54,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:25:54,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:54,218 INFO L87 Difference]: Start difference. First operand 175 states and 232 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 4 states have call successors, (22), 1 states have call predecessors, (22), 2 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-07 21:25:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:54,690 INFO L93 Difference]: Finished difference Result 212 states and 278 transitions. [2025-02-07 21:25:54,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:54,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 4 states have call successors, (22), 1 states have call predecessors, (22), 2 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 220 [2025-02-07 21:25:54,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:54,693 INFO L225 Difference]: With dead ends: 212 [2025-02-07 21:25:54,693 INFO L226 Difference]: Without dead ends: 140 [2025-02-07 21:25:54,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:25:54,694 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 147 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:54,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 416 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 21:25:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-07 21:25:54,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-02-07 21:25:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 98 states have (on average 1.163265306122449) internal successors, (114), 98 states have internal predecessors, (114), 31 states have call successors, (31), 11 states have call predecessors, (31), 10 states have return successors, (32), 30 states have call predecessors, (32), 31 states have call successors, (32) [2025-02-07 21:25:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 177 transitions. [2025-02-07 21:25:54,706 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 177 transitions. Word has length 220 [2025-02-07 21:25:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:54,707 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 177 transitions. [2025-02-07 21:25:54,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 4 states have call successors, (22), 1 states have call predecessors, (22), 2 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-07 21:25:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2025-02-07 21:25:54,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-07 21:25:54,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:54,708 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:54,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 21:25:54,708 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:54,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:54,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2052400836, now seen corresponding path program 1 times [2025-02-07 21:25:54,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:54,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014881736] [2025-02-07 21:25:54,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:54,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:54,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-07 21:25:54,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-07 21:25:54,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:54,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 1037 trivial. 0 not checked. [2025-02-07 21:25:55,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:55,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014881736] [2025-02-07 21:25:55,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014881736] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:55,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469106845] [2025-02-07 21:25:55,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:55,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:55,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:55,656 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:55,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 21:25:55,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-07 21:25:56,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-07 21:25:56,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:56,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:56,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-07 21:25:56,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:56,106 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 11 treesize of output 7 [2025-02-07 21:25:56,111 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 11 treesize of output 7 [2025-02-07 21:25:56,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-07 21:25:56,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-07 21:25:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2025-02-07 21:25:56,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 21:25:56,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469106845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:56,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 21:25:56,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-02-07 21:25:56,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134248906] [2025-02-07 21:25:56,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:56,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:25:56,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:56,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:25:56,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:25:56,260 INFO L87 Difference]: Start difference. First operand 140 states and 177 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-07 21:25:57,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:57,102 INFO L93 Difference]: Finished difference Result 144 states and 180 transitions. [2025-02-07 21:25:57,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:57,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 220 [2025-02-07 21:25:57,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:57,103 INFO L225 Difference]: With dead ends: 144 [2025-02-07 21:25:57,103 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:25:57,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-02-07 21:25:57,104 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 66 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:57,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 154 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 21:25:57,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:25:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:25:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:25:57,105 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2025-02-07 21:25:57,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:57,105 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:25:57,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-07 21:25:57,105 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:25:57,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:25:57,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 21:25:57,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 21:25:57,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-07 21:25:57,311 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:57,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:25:59,615 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:25:59,621 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:59,622 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] [2025-02-07 21:25:59,622 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:59,623 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 21:25:59,623 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-07 21:25:59,623 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:25:59,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 21:25:59,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-07 21:25:59,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:25:59,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:59,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] [2025-02-07 21:25:59,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:59,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 21:25:59,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-07 21:25:59,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:25:59,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 21:25:59,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-07 21:25:59,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:25:59,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset [2025-02-07 21:25:59,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL] [2025-02-07 21:25:59,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:59,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:59,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] [2025-02-07 21:25:59,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:59,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 21:25:59,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-07 21:25:59,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:25:59,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 21:25:59,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-07 21:25:59,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:25:59,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:59,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] [2025-02-07 21:25:59,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:59,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.offset [2025-02-07 21:25:59,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset [2025-02-07 21:25:59,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL]] [2025-02-07 21:25:59,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:59,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset [2025-02-07 21:25:59,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL] [2025-02-07 21:25:59,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:59,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:59,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] [2025-02-07 21:25:59,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:59,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.base [2025-02-07 21:25:59,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2025-02-07 21:25:59,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 21:25:59,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2025-02-07 21:25:59,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:25:59,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 21:25:59,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2025-02-07 21:25:59,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:25:59,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2025-02-07 21:25:59,627 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:59,627 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] [2025-02-07 21:25:59,627 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:59,627 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 21:25:59,628 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-07 21:25:59,628 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:25:59,628 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 21:25:59,628 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-07 21:25:59,628 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:25:59,628 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset [2025-02-07 21:25:59,628 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL] [2025-02-07 21:25:59,628 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:59,629 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:59,629 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] [2025-02-07 21:25:59,629 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:59,629 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:59,629 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] [2025-02-07 21:25:59,629 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:59,629 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.base [2025-02-07 21:25:59,629 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.offset [2025-02-07 21:25:59,630 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset [2025-02-07 21:25:59,630 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL] [2025-02-07 21:25:59,630 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:59,630 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.offset [2025-02-07 21:25:59,630 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2025-02-07 21:25:59,630 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2025-02-07 21:25:59,630 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.base [2025-02-07 21:25:59,630 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 21:25:59,630 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-07 21:25:59,630 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:25:59,630 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 21:25:59,630 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-07 21:25:59,630 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:25:59,630 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:59,630 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] [2025-02-07 21:25:59,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:59,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.offset [2025-02-07 21:25:59,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset [2025-02-07 21:25:59,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL]] [2025-02-07 21:25:59,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:59,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:59,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] [2025-02-07 21:25:59,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:59,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.base [2025-02-07 21:25:59,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 21:25:59,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2025-02-07 21:25:59,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:25:59,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 21:25:59,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2025-02-07 21:25:59,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:25:59,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:59,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] [2025-02-07 21:25:59,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:59,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 21:25:59,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-07 21:25:59,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:25:59,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 21:25:59,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-07 21:25:59,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:25:59,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset [2025-02-07 21:25:59,633 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL] [2025-02-07 21:25:59,633 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:59,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:25:59 BoogieIcfgContainer [2025-02-07 21:25:59,633 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:25:59,634 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:25:59,634 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:25:59,634 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:25:59,634 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:43" (3/4) ... [2025-02-07 21:25:59,636 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:25:59,642 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_join [2025-02-07 21:25:59,642 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_lock [2025-02-07 21:25:59,642 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_unlock [2025-02-07 21:25:59,642 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:59,642 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_cond_init [2025-02-07 21:25:59,642 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_create [2025-02-07 21:25:59,642 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-07 21:25:59,642 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_cond_wait [2025-02-07 21:25:59,642 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_cs [2025-02-07 21:25:59,643 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_cond_signal [2025-02-07 21:25:59,651 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2025-02-07 21:25:59,651 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-02-07 21:25:59,652 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-07 21:25:59,652 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-07 21:25:59,653 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:25:59,673 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == \old(__CS_error)) [2025-02-07 21:25:59,673 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == \old(__CS_error)) [2025-02-07 21:25:59,700 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == \old(__CS_error)) [2025-02-07 21:25:59,700 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == \old(__CS_error)) [2025-02-07 21:25:59,728 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:25:59,728 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:25:59,729 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:25:59,729 INFO L158 Benchmark]: Toolchain (without parser) took 18160.96ms. Allocated memory was 167.8MB in the beginning and 461.4MB in the end (delta: 293.6MB). Free memory was 131.6MB in the beginning and 334.3MB in the end (delta: -202.7MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB. [2025-02-07 21:25:59,729 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:25:59,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.15ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 98.1MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 21:25:59,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.63ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 93.2MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:25:59,730 INFO L158 Benchmark]: Boogie Preprocessor took 61.72ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 85.8MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:25:59,730 INFO L158 Benchmark]: IcfgBuilder took 863.21ms. Allocated memory is still 167.8MB. Free memory was 85.8MB in the beginning and 104.4MB in the end (delta: -18.5MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2025-02-07 21:25:59,730 INFO L158 Benchmark]: TraceAbstraction took 16615.47ms. Allocated memory was 167.8MB in the beginning and 461.4MB in the end (delta: 293.6MB). Free memory was 104.4MB in the beginning and 346.8MB in the end (delta: -242.4MB). Peak memory consumption was 255.6MB. Max. memory is 16.1GB. [2025-02-07 21:25:59,730 INFO L158 Benchmark]: Witness Printer took 95.02ms. Allocated memory is still 461.4MB. Free memory was 346.8MB in the beginning and 334.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:25:59,731 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 477.15ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 98.1MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.63ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 93.2MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.72ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 85.8MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 863.21ms. Allocated memory is still 167.8MB. Free memory was 85.8MB in the beginning and 104.4MB in the end (delta: -18.5MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16615.47ms. Allocated memory was 167.8MB in the beginning and 461.4MB in the end (delta: 293.6MB). Free memory was 104.4MB in the beginning and 346.8MB in the end (delta: -242.4MB). Peak memory consumption was 255.6MB. Max. memory is 16.1GB. * Witness Printer took 95.02ms. Allocated memory is still 461.4MB. Free memory was 346.8MB in the beginning and 334.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 778]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 152 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 12, TraceHistogramMax: 22, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 824 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 824 mSDsluCounter, 5099 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3171 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 215 IncrementalHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 1928 mSDtfsCounter, 215 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1479 GetRequests, 1428 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=8, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2935 NumberOfCodeBlocks, 2482 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3411 ConstructedInterpolants, 0 QuantifiedInterpolants, 4500 SizeOfPredicates, 4 NumberOfNonLiveVariables, 5928 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 20 InterpolantComputations, 9 PerfectInterpolantSequences, 15864/15881 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 949]: Location Invariant Derived location invariant: (0 == \old(__CS_error)) - InvariantResult [Line: 1004]: Location Invariant Derived location invariant: (__CS_error == 0) - InvariantResult [Line: 931]: Location Invariant Derived location invariant: (0 == \old(__CS_error)) - InvariantResult [Line: 1009]: Location Invariant Derived location invariant: ((__CS_error == 0) && (i <= 1)) RESULT: Ultimate proved your program to be correct! [2025-02-07 21:25:59,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE