./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stack-1.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_stack-1.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 f673ebb9e7e04aacff207de4acfe748a76999a1319247236c14ae51e44f23889 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:25:27,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:25:27,777 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:27,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:25:27,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:25:27,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:25:27,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:25:27,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:25:27,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:25:27,814 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:25:27,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:25:27,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:25:27,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:25:27,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:25:27,817 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:25:27,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:25:27,818 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:27,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:25:27,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:25:27,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:25:27,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:25:27,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:25:27,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:25:27,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:25:27,819 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 -> f673ebb9e7e04aacff207de4acfe748a76999a1319247236c14ae51e44f23889 [2025-02-07 21:25:28,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:25:28,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:25:28,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:25:28,061 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:25:28,062 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:25:28,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stack-1.i [2025-02-07 21:25:29,405 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64e86555e/45a3a0b0a43645438fc5f326b8eb7b38/FLAGbc27e06af [2025-02-07 21:25:29,703 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:25:29,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-1.i [2025-02-07 21:25:29,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64e86555e/45a3a0b0a43645438fc5f326b8eb7b38/FLAGbc27e06af [2025-02-07 21:25:29,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64e86555e/45a3a0b0a43645438fc5f326b8eb7b38 [2025-02-07 21:25:29,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:25:29,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:25:29,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:29,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:25:29,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:25:29,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:29" (1/1) ... [2025-02-07 21:25:29,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f65a6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:29, skipping insertion in model container [2025-02-07 21:25:29,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:29" (1/1) ... [2025-02-07 21:25:30,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:25:30,405 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_stack-1.i[34744,34757] [2025-02-07 21:25:30,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:30,521 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:25:30,559 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_stack-1.i[34744,34757] [2025-02-07 21:25:30,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:30,658 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:25:30,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:30 WrapperNode [2025-02-07 21:25:30,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:30,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:30,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:25:30,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:25:30,665 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:30" (1/1) ... [2025-02-07 21:25:30,690 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:30" (1/1) ... [2025-02-07 21:25:30,742 INFO L138 Inliner]: procedures = 254, calls = 303, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 681 [2025-02-07 21:25:30,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:30,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:25:30,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:25:30,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:25:30,754 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:30" (1/1) ... [2025-02-07 21:25:30,754 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:30" (1/1) ... [2025-02-07 21:25:30,763 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:30" (1/1) ... [2025-02-07 21:25:30,801 INFO L175 MemorySlicer]: Split 156 memory accesses to 18 slices as follows [2, 8, 8, 8, 20, 3, 12, 12, 4, 5, 0, 21, 8, 3, 22, 7, 6, 7]. 14 percent of accesses are in the largest equivalence class. The 53 initializations are split as follows [2, 3, 3, 3, 6, 0, 6, 2, 2, 2, 0, 10, 2, 0, 10, 0, 2, 0]. The 38 writes are split as follows [0, 2, 2, 2, 8, 1, 3, 3, 1, 1, 0, 1, 3, 1, 6, 1, 2, 1]. [2025-02-07 21:25:30,801 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:30" (1/1) ... [2025-02-07 21:25:30,801 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:30" (1/1) ... [2025-02-07 21:25:30,834 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:30" (1/1) ... [2025-02-07 21:25:30,840 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:30" (1/1) ... [2025-02-07 21:25:30,849 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:30" (1/1) ... [2025-02-07 21:25:30,855 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:30" (1/1) ... [2025-02-07 21:25:30,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:25:30,870 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:25:30,874 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:25:30,874 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:25:30,875 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:30" (1/1) ... [2025-02-07 21:25:30,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:30,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:30,907 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:30,914 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:30,929 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 21:25:30,929 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 21:25:30,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:25:30,929 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-02-07 21:25:30,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-07 21:25:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-07 21:25:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-07 21:25:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-07 21:25:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-07 21:25:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-07 21:25:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-07 21:25:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-07 21:25:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-07 21:25:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-07 21:25:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-07 21:25:30,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-07 21:25:30,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-07 21:25:30,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-07 21:25:30,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-07 21:25:30,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-07 21:25:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-07 21:25:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-02-07 21:25:30,937 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-02-07 21:25:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:25:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:25:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 21:25:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 21:25:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 21:25:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 21:25:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 21:25:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 21:25:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 21:25:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 21:25:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 21:25:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 21:25:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 21:25:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 21:25:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-07 21:25:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-07 21:25:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-07 21:25:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-07 21:25:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:25:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:25:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 21:25:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 21:25:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 21:25:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 21:25:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 21:25:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 21:25:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 21:25:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 21:25:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 21:25:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 21:25:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 21:25:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 21:25:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-07 21:25:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-07 21:25:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-07 21:25:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-07 21:25:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2025-02-07 21:25:30,939 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2025-02-07 21:25:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:25:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 21:25:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 21:25:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-07 21:25:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-07 21:25:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-07 21:25:30,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-07 21:25:30,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:30,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-07 21:25:30,944 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-07 21:25:30,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 21:25:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-07 21:25:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-07 21:25:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-07 21:25:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-07 21:25:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:25:30,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:25:31,141 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:25:31,143 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:25:31,188 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-02-07 21:25:31,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: 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:31,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L955-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc #t~mem53; [2025-02-07 21:25:31,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-07 21:25:31,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068-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~mem77#1 := read~int#16(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset, 1); [2025-02-07 21:25:31,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002: havoc pop_#t~ret60#1;havoc pop_#t~mem61#1; [2025-02-07 21:25:31,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1027-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-02-07 21:25:31,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1027-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:31,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1027-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1069: assume -2147483648 <= main_thread_#t~ret78#1 && main_thread_#t~ret78#1 <= 2147483647;havoc main_thread_#t~mem77#1;havoc main_thread_#t~ret78#1; [2025-02-07 21:25:31,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1069-1: SUMMARY for call main_thread_#t~ret78#1 := __CS_pthread_join(main_thread_#t~mem77#1, 0, 0); srcloc: null [2025-02-07 21:25:31,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1003-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-02-07 21:25:31,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1003-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:31,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1003-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1028: assume -2147483648 <= t1_#t~ret65#1 && t1_#t~ret65#1 <= 2147483647;havoc t1_#t~ret65#1; [2025-02-07 21:25:31,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1028-1: SUMMARY for call t1_#t~ret65#1 := __CS_pthread_mutex_unlock(~#m~0.base, ~#m~0.offset + (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296)); srcloc: null [2025-02-07 21:25:31,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-02-07 21:25:31,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-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:31,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045: assume -2 == t2_#t~ret69#1;havoc t2_#t~ret69#1; [2025-02-07 21:25:31,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045: assume !(-2 == t2_#t~ret69#1);havoc t2_#t~ret69#1; [2025-02-07 21:25:31,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1070-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-07 21:25:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1070-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~mem79#1 := read~int#16(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset, 1); [2025-02-07 21:25:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1070-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-02-07 21:25:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));t1_#t~post66#1 := t1_~i~0#1;t1_~i~0#1 := 1 + t1_#t~post66#1;havoc t1_#t~post66#1; [2025-02-07 21:25:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1071: assume -2147483648 <= main_thread_#t~ret80#1 && main_thread_#t~ret80#1 <= 2147483647;havoc main_thread_#t~mem79#1;havoc main_thread_#t~ret80#1; [2025-02-07 21:25:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1071-1: SUMMARY for call main_thread_#t~ret80#1 := __CS_pthread_join(main_thread_#t~mem79#1, 0, 0); srcloc: null [2025-02-07 21:25:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-02-07 21:25:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));pop_#res#1 := 0; [2025-02-07 21:25:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,623 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);push_#res#1 := 0; [2025-02-07 21:25:31,623 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:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L972-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1063: main_thread_#t~ret74#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~ret74#1 && main_thread_#t~ret74#1 <= 2147483647;havoc main_thread_#t~ret74#1; [2025-02-07 21:25:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1022: assume -1 == t1_#t~ret64#1;havoc t1_#t~ret64#1; [2025-02-07 21:25:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1022: assume !(-1 == t1_#t~ret64#1);havoc t1_#t~ret64#1; [2025-02-07 21:25:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-02-07 21:25:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-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:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1072-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-07 21:25:31,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1072-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_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset;#t~ret165#1.base, #t~ret165#1.offset := main_thread_#res#1.base, main_thread_#res#1.offset;havoc main_thread_#t~nondet72#1, main_thread_#t~nondet73#1, main_thread_#t~ret74#1, main_thread_#t~ret75#1, main_thread_#t~ret76#1, main_thread_#t~mem77#1, main_thread_#t~ret78#1, main_thread_#t~mem79#1, main_thread_#t~ret80#1, main_thread_~arg#1.base, main_thread_~arg#1.offset, main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset, main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset;havoc main_thread_#in~arg#1.base, main_thread_#in~arg#1.offset;assume { :end_inline_main_thread } true;#t~funptrres162#1.base, #t~funptrres162#1.offset := #t~ret165#1.base, #t~ret165#1.offset; [2025-02-07 21:25:31,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1072-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-07 21:25:31,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-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:31,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048: SUMMARY for call error(); srcloc: null [2025-02-07 21:25:31,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1007-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-02-07 21:25:31,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1007-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));t2_#t~ret69#1 := pop_#res#1;havoc pop_#t~mem58#1, pop_#t~ret59#1, pop_#t~ret60#1, pop_#t~mem61#1, pop_~stack#1.base, pop_~stack#1.offset;havoc pop_#in~stack#1.base, pop_#in~stack#1.offset;assume { :end_inline_pop } true;assume -2147483648 <= t2_#t~ret69#1 && t2_#t~ret69#1 <= 2147483647; [2025-02-07 21:25:31,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1007-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065: assume -2147483648 <= main_thread_#t~ret75#1 && main_thread_#t~ret75#1 <= 2147483647;havoc main_thread_#t~ret75#1; [2025-02-07 21:25:31,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-1: SUMMARY for call main_thread_#t~ret75#1 := __CS_pthread_create(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset, 0, 0, #funAddr~t1.base, #funAddr~t1.offset, 0, 0); srcloc: null [2025-02-07 21:25:31,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1024-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-02-07 21:25:31,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1024-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:31,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1024-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1066-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-07 21:25:31,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1066-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:31,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1066-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1025: SUMMARY for call error(); srcloc: null [2025-02-07 21:25:31,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1050-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-02-07 21:25:31,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1050-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:31,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1050-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2025-02-07 21:25:31,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));t1_#t~ret64#1 := push_#res#1;havoc push_#t~mem55#1, push_#t~ret56#1, push_#t~ret57#1, push_~stack#1.base, push_~stack#1.offset, push_~x#1;havoc push_#in~stack#1.base, push_#in~stack#1.offset, push_#in~x#1;assume { :end_inline_push } true;assume -2147483648 <= t1_#t~ret64#1 && t1_#t~ret64#1 <= 2147483647; [2025-02-07 21:25:31,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067: assume -2147483648 <= main_thread_#t~ret76#1 && main_thread_#t~ret76#1 <= 2147483647;havoc main_thread_#t~ret76#1; [2025-02-07 21:25:31,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067-1: SUMMARY for call main_thread_#t~ret76#1 := __CS_pthread_create(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset, 0, 0, #funAddr~t2.base, #funAddr~t2.offset, 0, 0); srcloc: null [2025-02-07 21:25:31,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L937: 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:31,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L937: 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:31,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L937-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L935: 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:31,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L935: 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:31,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L935-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L933: 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:31,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L933: 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:31,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L933-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L931: 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:31,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L931: 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:31,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L931-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:31,977 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2025-02-07 21:25:31,978 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:25:31,985 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:25:31,985 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:25:31,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:31 BoogieIcfgContainer [2025-02-07 21:25:31,986 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:25:31,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:25:31,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:25:31,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:25:31,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:25:29" (1/3) ... [2025-02-07 21:25:31,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec4050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:31, skipping insertion in model container [2025-02-07 21:25:31,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:30" (2/3) ... [2025-02-07 21:25:31,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec4050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:31, skipping insertion in model container [2025-02-07 21:25:31,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:31" (3/3) ... [2025-02-07 21:25:31,992 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_stack-1.i [2025-02-07 21:25:32,001 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:25:32,007 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_stack-1.i that has 10 procedures, 180 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-07 21:25:32,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:25:32,050 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;@2f672775, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:25:32,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:25:32,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 97 states have (on average 1.5360824742268042) internal successors, (149), 106 states have internal predecessors, (149), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-07 21:25:32,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-07 21:25:32,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:32,067 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,067 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:32,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:32,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1222707228, now seen corresponding path program 1 times [2025-02-07 21:25:32,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:32,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299363829] [2025-02-07 21:25:32,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:32,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:32,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-07 21:25:32,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-07 21:25:32,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:32,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-07 21:25:32,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:32,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299363829] [2025-02-07 21:25:32,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299363829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:32,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:32,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:32,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761536977] [2025-02-07 21:25:32,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:32,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:32,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:32,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:32,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:32,657 INFO L87 Difference]: Start difference. First operand has 169 states, 97 states have (on average 1.5360824742268042) internal successors, (149), 106 states have internal predecessors, (149), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-07 21:25:36,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:36,775 INFO L93 Difference]: Finished difference Result 323 states and 552 transitions. [2025-02-07 21:25:36,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:36,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2025-02-07 21:25:36,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:36,786 INFO L225 Difference]: With dead ends: 323 [2025-02-07 21:25:36,787 INFO L226 Difference]: Without dead ends: 99 [2025-02-07 21:25:36,791 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:36,797 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 4 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:36,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 487 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-02-07 21:25:36,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-07 21:25:36,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2025-02-07 21:25:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 63 states have internal predecessors, (76), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-07 21:25:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 132 transitions. [2025-02-07 21:25:36,837 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 132 transitions. Word has length 94 [2025-02-07 21:25:36,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:36,838 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 132 transitions. [2025-02-07 21:25:36,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-07 21:25:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 132 transitions. [2025-02-07 21:25:36,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-07 21:25:36,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:36,844 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:25:36,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:36,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1851650207, now seen corresponding path program 1 times [2025-02-07 21:25:36,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:36,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992641332] [2025-02-07 21:25:36,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:36,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:36,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-07 21:25:36,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-07 21:25:36,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:36,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-07 21:25:37,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:37,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992641332] [2025-02-07 21:25:37,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992641332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:37,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:37,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:37,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241509269] [2025-02-07 21:25:37,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:37,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:37,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:37,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:37,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:37,156 INFO L87 Difference]: Start difference. First operand 97 states and 132 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-07 21:25:37,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:37,190 INFO L93 Difference]: Finished difference Result 194 states and 266 transitions. [2025-02-07 21:25:37,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:37,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2025-02-07 21:25:37,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:37,194 INFO L225 Difference]: With dead ends: 194 [2025-02-07 21:25:37,194 INFO L226 Difference]: Without dead ends: 99 [2025-02-07 21:25:37,195 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:37,195 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:37,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 254 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:37,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-07 21:25:37,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-07 21:25:37,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.2) internal successors, (78), 65 states have internal predecessors, (78), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-07 21:25:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 134 transitions. [2025-02-07 21:25:37,203 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 134 transitions. Word has length 97 [2025-02-07 21:25:37,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:37,203 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 134 transitions. [2025-02-07 21:25:37,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-07 21:25:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 134 transitions. [2025-02-07 21:25:37,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-07 21:25:37,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:37,208 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:25:37,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:37,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:37,209 INFO L85 PathProgramCache]: Analyzing trace with hash 446057407, now seen corresponding path program 1 times [2025-02-07 21:25:37,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:37,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641697964] [2025-02-07 21:25:37,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:37,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:37,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-07 21:25:37,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-07 21:25:37,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:37,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-02-07 21:25:37,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:37,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641697964] [2025-02-07 21:25:37,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641697964] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:37,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998169072] [2025-02-07 21:25:37,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:37,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:37,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:37,507 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:37,512 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:37,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-07 21:25:37,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-07 21:25:37,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:37,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:37,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:37,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-02-07 21:25:37,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-02-07 21:25:37,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998169072] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:37,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:37,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-07 21:25:37,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520059785] [2025-02-07 21:25:37,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:37,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:25:37,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:37,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:25:37,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:37,952 INFO L87 Difference]: Start difference. First operand 99 states and 134 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-07 21:25:38,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:38,039 INFO L93 Difference]: Finished difference Result 200 states and 274 transitions. [2025-02-07 21:25:38,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:38,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 99 [2025-02-07 21:25:38,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:38,041 INFO L225 Difference]: With dead ends: 200 [2025-02-07 21:25:38,044 INFO L226 Difference]: Without dead ends: 103 [2025-02-07 21:25:38,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 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:38,045 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:38,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 504 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:25:38,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-07 21:25:38,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-02-07 21:25:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 69 states have internal predecessors, (82), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-07 21:25:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 138 transitions. [2025-02-07 21:25:38,056 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 138 transitions. Word has length 99 [2025-02-07 21:25:38,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:38,056 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 138 transitions. [2025-02-07 21:25:38,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-07 21:25:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 138 transitions. [2025-02-07 21:25:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-07 21:25:38,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:38,058 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 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] [2025-02-07 21:25:38,071 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:38,258 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:38,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:38,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:38,259 INFO L85 PathProgramCache]: Analyzing trace with hash 898115135, now seen corresponding path program 2 times [2025-02-07 21:25:38,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:38,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933020458] [2025-02-07 21:25:38,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:38,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:38,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-02-07 21:25:38,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 103 statements. [2025-02-07 21:25:38,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:38,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:38,457 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-02-07 21:25:38,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:38,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933020458] [2025-02-07 21:25:38,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933020458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:38,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:38,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:38,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395529781] [2025-02-07 21:25:38,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:38,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:38,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:38,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:38,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:38,459 INFO L87 Difference]: Start difference. First operand 103 states and 138 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-07 21:25:38,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:38,480 INFO L93 Difference]: Finished difference Result 193 states and 262 transitions. [2025-02-07 21:25:38,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:38,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 103 [2025-02-07 21:25:38,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:38,483 INFO L225 Difference]: With dead ends: 193 [2025-02-07 21:25:38,483 INFO L226 Difference]: Without dead ends: 159 [2025-02-07 21:25:38,483 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:38,484 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 88 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:38,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 390 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:38,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-07 21:25:38,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-02-07 21:25:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 107 states have (on average 1.1869158878504673) internal successors, (127), 107 states have internal predecessors, (127), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2025-02-07 21:25:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 212 transitions. [2025-02-07 21:25:38,500 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 212 transitions. Word has length 103 [2025-02-07 21:25:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:38,500 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 212 transitions. [2025-02-07 21:25:38,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-07 21:25:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 212 transitions. [2025-02-07 21:25:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-07 21:25:38,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:38,502 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 6, 6, 6, 3, 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, 1, 1, 1, 1, 1] [2025-02-07 21:25:38,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:25:38,503 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:38,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:38,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1898547562, now seen corresponding path program 1 times [2025-02-07 21:25:38,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:38,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442390375] [2025-02-07 21:25:38,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:38,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:38,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-07 21:25:38,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-07 21:25:38,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:38,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:38,775 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2025-02-07 21:25:38,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:38,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442390375] [2025-02-07 21:25:38,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442390375] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:38,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675501450] [2025-02-07 21:25:38,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:38,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:38,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:38,778 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:38,779 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:39,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-07 21:25:39,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-07 21:25:39,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:39,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:39,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 21:25:39,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2025-02-07 21:25:39,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:39,396 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2025-02-07 21:25:39,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675501450] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:39,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:39,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 9 [2025-02-07 21:25:39,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568661218] [2025-02-07 21:25:39,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:39,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 21:25:39,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:39,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 21:25:39,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:25:39,398 INFO L87 Difference]: Start difference. First operand 159 states and 212 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-07 21:25:43,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:45,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:45,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:45,897 INFO L93 Difference]: Finished difference Result 329 states and 442 transitions. [2025-02-07 21:25:45,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 21:25:45,897 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 193 [2025-02-07 21:25:45,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:45,899 INFO L225 Difference]: With dead ends: 329 [2025-02-07 21:25:45,899 INFO L226 Difference]: Without dead ends: 172 [2025-02-07 21:25:45,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 386 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2025-02-07 21:25:45,900 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 12 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:45,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 625 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2025-02-07 21:25:45,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-02-07 21:25:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-02-07 21:25:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 120 states have (on average 1.1833333333333333) internal successors, (142), 120 states have internal predecessors, (142), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2025-02-07 21:25:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 227 transitions. [2025-02-07 21:25:45,910 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 227 transitions. Word has length 193 [2025-02-07 21:25:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:45,911 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 227 transitions. [2025-02-07 21:25:45,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-07 21:25:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 227 transitions. [2025-02-07 21:25:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-07 21:25:45,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:45,913 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:45,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 21:25:46,113 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:46,114 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:46,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:46,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1558100275, now seen corresponding path program 2 times [2025-02-07 21:25:46,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:46,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127913723] [2025-02-07 21:25:46,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:46,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:46,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 206 statements into 2 equivalence classes. [2025-02-07 21:25:46,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 206 statements. [2025-02-07 21:25:46,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:46,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 933 trivial. 0 not checked. [2025-02-07 21:25:46,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:46,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127913723] [2025-02-07 21:25:46,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127913723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:46,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:46,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:25:46,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723641975] [2025-02-07 21:25:46,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:46,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:25:46,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:46,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:25:46,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:46,377 INFO L87 Difference]: Start difference. First operand 172 states and 227 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-07 21:25:50,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:54,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:55,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:55,615 INFO L93 Difference]: Finished difference Result 216 states and 286 transitions. [2025-02-07 21:25:55,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:55,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 206 [2025-02-07 21:25:55,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:55,618 INFO L225 Difference]: With dead ends: 216 [2025-02-07 21:25:55,618 INFO L226 Difference]: Without dead ends: 173 [2025-02-07 21:25:55,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:55,619 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 111 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:55,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 336 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2025-02-07 21:25:55,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-07 21:25:55,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2025-02-07 21:25:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 119 states have internal predecessors, (138), 40 states have call successors, (40), 10 states have call predecessors, (40), 11 states have return successors, (43), 40 states have call predecessors, (43), 40 states have call successors, (43) [2025-02-07 21:25:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 221 transitions. [2025-02-07 21:25:55,642 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 221 transitions. Word has length 206 [2025-02-07 21:25:55,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:55,642 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 221 transitions. [2025-02-07 21:25:55,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-07 21:25:55,643 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 221 transitions. [2025-02-07 21:25:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-07 21:25:55,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:55,646 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:55,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:25:55,646 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:55,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash -94441043, now seen corresponding path program 1 times [2025-02-07 21:25:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:55,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844742762] [2025-02-07 21:25:55,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:55,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:55,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-07 21:25:55,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-07 21:25:55,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:55,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:56,312 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 933 trivial. 0 not checked. [2025-02-07 21:25:56,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:56,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844742762] [2025-02-07 21:25:56,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844742762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:56,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:56,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:25:56,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103552506] [2025-02-07 21:25:56,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:56,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:25:56,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:56,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:25:56,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:56,314 INFO L87 Difference]: Start difference. First operand 170 states and 221 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-07 21:26:00,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:01,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:01,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:01,585 INFO L93 Difference]: Finished difference Result 261 states and 338 transitions. [2025-02-07 21:26:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:26:01,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 206 [2025-02-07 21:26:01,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:01,587 INFO L225 Difference]: With dead ends: 261 [2025-02-07 21:26:01,587 INFO L226 Difference]: Without dead ends: 153 [2025-02-07 21:26:01,588 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:26:01,588 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 113 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:01,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 339 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 38 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-02-07 21:26:01,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-07 21:26:01,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-02-07 21:26:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 107 states have internal predecessors, (122), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-02-07 21:26:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 193 transitions. [2025-02-07 21:26:01,605 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 193 transitions. Word has length 206 [2025-02-07 21:26:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:01,606 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 193 transitions. [2025-02-07 21:26:01,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-07 21:26:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 193 transitions. [2025-02-07 21:26:01,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-07 21:26:01,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:26:01,607 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:26:01,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:26:01,608 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:26:01,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:26:01,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1543490419, now seen corresponding path program 1 times [2025-02-07 21:26:01,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:26:01,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769731330] [2025-02-07 21:26:01,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:01,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:26:01,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-07 21:26:01,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-07 21:26:01,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:01,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 933 trivial. 0 not checked. [2025-02-07 21:26:02,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:26:02,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769731330] [2025-02-07 21:26:02,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769731330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:26:02,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:26:02,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:26:02,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649847695] [2025-02-07 21:26:02,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:26:02,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:26:02,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:26:02,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:26:02,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:26:02,143 INFO L87 Difference]: Start difference. First operand 153 states and 193 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-07 21:26:03,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:03,566 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2025-02-07 21:26:03,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:26:03,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 206 [2025-02-07 21:26:03,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:03,567 INFO L225 Difference]: With dead ends: 162 [2025-02-07 21:26:03,567 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:26:03,568 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:26:03,568 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 41 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:03,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 119 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-07 21:26:03,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:26:03,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:26:03,569 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:26:03,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:26:03,569 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2025-02-07 21:26:03,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:03,569 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:26:03,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-07 21:26:03,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:26:03,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:26:03,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 21:26:03,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:26:03,574 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-02-07 21:26:03,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:26:05,276 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:26:05,284 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.offset [2025-02-07 21:26:05,284 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL]] [2025-02-07 21:26:05,284 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.base [2025-02-07 21:26:05,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL] [2025-02-07 21:26:05,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.base [2025-02-07 21:26:05,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL]] [2025-02-07 21:26:05,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.offset [2025-02-07 21:26:05,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.offset [2025-02-07 21:26:05,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL]] [2025-02-07 21:26:05,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.base [2025-02-07 21:26:05,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL]] [2025-02-07 21:26:05,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.offset [2025-02-07 21:26:05,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL] [2025-02-07 21:26:05,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,288 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.offset [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL]] [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.base [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL]] [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.offset [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.offset [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL] [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.offset [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.offset [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL]] [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.base [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL]] [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.base [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL] [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.offset [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL] [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2025-02-07 21:26:05,290 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.base [2025-02-07 21:26:05,290 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL] [2025-02-07 21:26:05,291 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,291 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.offset [2025-02-07 21:26:05,291 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL] [2025-02-07 21:26:05,291 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,291 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.base [2025-02-07 21:26:05,291 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL] [2025-02-07 21:26:05,291 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,291 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.offset [2025-02-07 21:26:05,291 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL] [2025-02-07 21:26:05,291 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,292 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.base [2025-02-07 21:26:05,292 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL] [2025-02-07 21:26:05,292 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,292 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.offset [2025-02-07 21:26:05,292 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL] [2025-02-07 21:26:05,292 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:26:05,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:26:05 BoogieIcfgContainer [2025-02-07 21:26:05,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:26:05,293 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:26:05,293 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:26:05,293 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:26:05,294 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:31" (3/4) ... [2025-02-07 21:26:05,298 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:26:05,307 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_join [2025-02-07 21:26:05,307 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_lock [2025-02-07 21:26:05,307 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_unlock [2025-02-07 21:26:05,308 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:26:05,308 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure get_top [2025-02-07 21:26:05,308 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_create [2025-02-07 21:26:05,308 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-07 21:26:05,308 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure error [2025-02-07 21:26:05,308 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_cs [2025-02-07 21:26:05,323 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 46 nodes and edges [2025-02-07 21:26:05,323 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-07 21:26:05,324 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-07 21:26:05,324 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-07 21:26:05,348 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == \old(__CS_error)) [2025-02-07 21:26:05,348 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((__CS_error == 0) && (0 == \old(__CS_error))) [2025-02-07 21:26:05,387 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == \old(__CS_error)) [2025-02-07 21:26:05,387 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((__CS_error == 0) && (0 == \old(__CS_error))) [2025-02-07 21:26:05,422 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:26:05,422 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:26:05,422 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:26:05,423 INFO L158 Benchmark]: Toolchain (without parser) took 35456.15ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 107.7MB in the beginning and 180.4MB in the end (delta: -72.7MB). Peak memory consumption was 131.6MB. Max. memory is 16.1GB. [2025-02-07 21:26:05,423 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:26:05,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 688.05ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 72.5MB in the end (delta: 35.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 21:26:05,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.65ms. Allocated memory is still 142.6MB. Free memory was 72.5MB in the beginning and 66.2MB in the end (delta: 6.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:26:05,423 INFO L158 Benchmark]: Boogie Preprocessor took 127.10ms. Allocated memory is still 142.6MB. Free memory was 66.2MB in the beginning and 57.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:26:05,423 INFO L158 Benchmark]: IcfgBuilder took 1115.29ms. Allocated memory is still 142.6MB. Free memory was 57.8MB in the beginning and 53.8MB in the end (delta: 4.1MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2025-02-07 21:26:05,423 INFO L158 Benchmark]: TraceAbstraction took 33305.07ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 52.8MB in the beginning and 193.2MB in the end (delta: -140.4MB). Peak memory consumption was 143.4MB. Max. memory is 16.1GB. [2025-02-07 21:26:05,424 INFO L158 Benchmark]: Witness Printer took 129.07ms. Allocated memory is still 343.9MB. Free memory was 193.2MB in the beginning and 180.4MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:26:05,425 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.19ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 688.05ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 72.5MB in the end (delta: 35.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.65ms. Allocated memory is still 142.6MB. Free memory was 72.5MB in the beginning and 66.2MB in the end (delta: 6.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 127.10ms. Allocated memory is still 142.6MB. Free memory was 66.2MB in the beginning and 57.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1115.29ms. Allocated memory is still 142.6MB. Free memory was 57.8MB in the beginning and 53.8MB in the end (delta: 4.1MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * TraceAbstraction took 33305.07ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 52.8MB in the beginning and 193.2MB in the end (delta: -140.4MB). Peak memory consumption was 143.4MB. Max. memory is 16.1GB. * Witness Printer took 129.07ms. Allocated memory is still 343.9MB. Free memory was 193.2MB in the beginning and 180.4MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.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$#3.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.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$#3.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~main_thread.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#3.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#3.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#3.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: 779]: 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 10 procedures, 180 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.5s, OverallIterations: 8, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 369 SdHoareTripleChecker+Valid, 26.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 369 mSDsluCounter, 3054 SdHoareTripleChecker+Invalid, 26.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2003 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 175 IncrementalHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 1051 mSDtfsCounter, 175 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 642 GetRequests, 597 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=5, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1496 NumberOfCodeBlocks, 1224 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1776 ConstructedInterpolants, 0 QuantifiedInterpolants, 2561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2107 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 7537/7553 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: 1014]: Location Invariant Derived location invariant: ((__CS_error == 0) && (0 == \old(__CS_error))) - InvariantResult [Line: 1037]: Location Invariant Derived location invariant: (0 == \old(__CS_error)) - InvariantResult [Line: 1091]: Location Invariant Derived location invariant: ((__CS_error == 0) && (i <= 1)) - InvariantResult [Line: 1083]: Location Invariant Derived location invariant: (__CS_error == 0) - InvariantResult [Line: 1087]: Location Invariant Derived location invariant: (((__CS_error == 0) && (i <= 1)) && (j <= 3)) RESULT: Ultimate proved your program to be correct! [2025-02-07 21:26:05,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE