./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_lamport.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 d49d34698411f85a0a6e83adb869f73bcb1d6aade5262b0ab5e3122db7000276 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:00:50,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:00:50,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:00:50,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:00:50,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:00:50,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:00:50,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:00:50,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:00:50,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:00:50,130 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:00:50,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:00:50,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:00:50,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:00:50,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:00:50,131 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:00:50,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:00:50,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:00:50,131 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:00:50,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:00:50,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:00:50,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:00:50,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:00:50,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:00:50,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:00:50,132 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:00:50,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:00:50,132 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:00:50,133 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:00:50,133 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:00:50,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:00:50,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:00:50,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:00:50,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:00:50,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:00:50,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:00:50,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:00:50,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:00:50,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:00:50,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:00:50,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:00:50,134 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:00:50,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:00:50,134 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:00:50,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:00:50,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:00:50,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:00:50,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:00:50,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:00:50,135 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 -> d49d34698411f85a0a6e83adb869f73bcb1d6aade5262b0ab5e3122db7000276 [2025-01-09 05:00:50,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:00:50,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:00:50,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:00:50,431 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:00:50,431 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:00:50,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lamport.i [2025-01-09 05:00:51,704 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3d187ca5/1d7881e1ba164454a06a15a48635507a/FLAG84917f37c [2025-01-09 05:00:52,069 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:00:52,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lamport.i [2025-01-09 05:00:52,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3d187ca5/1d7881e1ba164454a06a15a48635507a/FLAG84917f37c [2025-01-09 05:00:52,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3d187ca5/1d7881e1ba164454a06a15a48635507a [2025-01-09 05:00:52,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:00:52,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:00:52,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:00:52,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:00:52,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:00:52,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3249ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52, skipping insertion in model container [2025-01-09 05:00:52,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:00:52,452 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_lamport.i[23604,23617] [2025-01-09 05:00:52,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:00:52,592 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:00:52,638 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_lamport.i[23604,23617] [2025-01-09 05:00:52,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:00:52,745 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:00:52,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52 WrapperNode [2025-01-09 05:00:52,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:00:52,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:00:52,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:00:52,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:00:52,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,813 INFO L138 Inliner]: procedures = 145, calls = 360, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 471 [2025-01-09 05:00:52,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:00:52,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:00:52,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:00:52,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:00:52,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,882 INFO L175 MemorySlicer]: Split 168 memory accesses to 20 slices as follows [2, 8, 8, 13, 5, 8, 29, 21, 0, 7, 7, 7, 5, 7, 5, 7, 6, 5, 5, 13]. 17 percent of accesses are in the largest equivalence class. The 46 initializations are split as follows [2, 3, 3, 0, 0, 3, 9, 9, 0, 3, 3, 3, 0, 3, 0, 3, 2, 0, 0, 0]. The 42 writes are split as follows [0, 2, 2, 1, 1, 2, 11, 6, 0, 2, 2, 2, 1, 2, 1, 2, 2, 1, 1, 1]. [2025-01-09 05:00:52,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,922 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:00:52,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:00:52,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:00:52,980 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:00:52,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:00:53,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:00:53,024 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-01-09 05:00:53,028 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-01-09 05:00:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 05:00:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 05:00:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 05:00:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 05:00:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 05:00:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 05:00:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 05:00:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 05:00:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 05:00:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 05:00:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 05:00:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 05:00:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 05:00:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 05:00:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 05:00:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 05:00:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 05:00:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 05:00:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 05:00:53,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 05:00:53,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 05:00:53,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 05:00:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 05:00:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 05:00:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 05:00:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 05:00:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 05:00:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 05:00:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 05:00:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 05:00:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 05:00:53,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 05:00:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-01-09 05:00:53,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 05:00:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 05:00:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 05:00:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 05:00:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 05:00:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 05:00:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 05:00:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-09 05:00:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-01-09 05:00:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-01-09 05:00:53,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-01-09 05:00:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:00:53,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:00:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 05:00:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 05:00:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 05:00:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 05:00:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 05:00:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 05:00:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 05:00:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 05:00:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 05:00:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 05:00:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 05:00:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 05:00:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 05:00:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 05:00:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 05:00:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 05:00:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 05:00:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-09 05:00:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-09 05:00:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-01-09 05:00:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-01-09 05:00:53,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 05:00:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:00:53,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:00:53,326 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:00:53,327 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:00:57,969 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-01-09 05:00:57,970 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:00:57,979 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:00:57,979 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 05:00:57,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:00:57 BoogieIcfgContainer [2025-01-09 05:00:57,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:00:57,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:00:57,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:00:57,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:00:57,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:00:52" (1/3) ... [2025-01-09 05:00:57,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d81b694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:00:57, skipping insertion in model container [2025-01-09 05:00:57,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (2/3) ... [2025-01-09 05:00:57,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d81b694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:00:57, skipping insertion in model container [2025-01-09 05:00:57,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:00:57" (3/3) ... [2025-01-09 05:00:57,990 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_lamport.i [2025-01-09 05:00:58,004 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:00:58,007 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_lamport.i that has 6 procedures, 114 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 05:00:58,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:00:58,071 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;@456c2831, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:00:58,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 05:00:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 71 states have (on average 1.295774647887324) internal successors, (92), 72 states have internal predecessors, (92), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 05:00:58,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:00:58,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:00:58,092 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:00:58,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:00:58,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:00:58,099 INFO L85 PathProgramCache]: Analyzing trace with hash 787706451, now seen corresponding path program 1 times [2025-01-09 05:00:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:00:58,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384973736] [2025-01-09 05:00:58,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:00:58,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:00:58,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:00:58,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:00:58,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:00:58,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:00:59,048 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 05:00:59,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:00:59,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384973736] [2025-01-09 05:00:59,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384973736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:00:59,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:00:59,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:00:59,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735937647] [2025-01-09 05:00:59,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:00:59,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:00:59,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:00:59,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:00:59,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:00:59,078 INFO L87 Difference]: Start difference. First operand has 114 states, 71 states have (on average 1.295774647887324) internal successors, (92), 72 states have internal predecessors, (92), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 05:01:03,120 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-01-09 05:01:03,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:03,211 INFO L93 Difference]: Finished difference Result 226 states and 360 transitions. [2025-01-09 05:01:03,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:01:03,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2025-01-09 05:01:03,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:03,222 INFO L225 Difference]: With dead ends: 226 [2025-01-09 05:01:03,223 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 05:01:03,227 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-01-09 05:01:03,231 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 2 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:03,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 315 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 05:01:03,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 05:01:03,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-01-09 05:01:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 69 states have internal predecessors, (87), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 05:01:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-01-09 05:01:03,285 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 143 [2025-01-09 05:01:03,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:03,285 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-01-09 05:01:03,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 05:01:03,286 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-01-09 05:01:03,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 05:01:03,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:03,292 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:01:03,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:01:03,293 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:03,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:03,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1753766817, now seen corresponding path program 1 times [2025-01-09 05:01:03,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:03,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61098343] [2025-01-09 05:01:03,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:03,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:03,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 05:01:03,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 05:01:03,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:03,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 05:01:03,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:03,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61098343] [2025-01-09 05:01:03,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61098343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:03,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:03,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:01:03,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012671803] [2025-01-09 05:01:03,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:03,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:01:03,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:03,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:01:03,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:01:03,731 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 05:01:03,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:03,758 INFO L93 Difference]: Finished difference Result 220 states and 317 transitions. [2025-01-09 05:01:03,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:01:03,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2025-01-09 05:01:03,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:03,763 INFO L225 Difference]: With dead ends: 220 [2025-01-09 05:01:03,764 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 05:01:03,765 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-01-09 05:01:03,765 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:03,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:01:03,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 05:01:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-09 05:01:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 states have internal predecessors, (88), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 05:01:03,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2025-01-09 05:01:03,788 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 145 [2025-01-09 05:01:03,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:03,789 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2025-01-09 05:01:03,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 05:01:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2025-01-09 05:01:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 05:01:03,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:03,796 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:01:03,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:01:03,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:03,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:03,797 INFO L85 PathProgramCache]: Analyzing trace with hash -198113869, now seen corresponding path program 1 times [2025-01-09 05:01:03,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:03,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531080692] [2025-01-09 05:01:03,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:03,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:03,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 05:01:03,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 05:01:03,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:03,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 05:01:04,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:04,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531080692] [2025-01-09 05:01:04,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531080692] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:04,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004009287] [2025-01-09 05:01:04,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:04,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:04,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:04,238 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-01-09 05:01:04,242 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-01-09 05:01:04,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 05:01:04,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 05:01:04,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:04,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:04,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 05:01:04,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 05:01:04,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:01:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 05:01:05,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004009287] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:01:05,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:01:05,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-09 05:01:05,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115528694] [2025-01-09 05:01:05,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:01:05,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:01:05,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:05,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:01:05,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:01:05,070 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 05:01:05,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:05,121 INFO L93 Difference]: Finished difference Result 223 states and 321 transitions. [2025-01-09 05:01:05,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:01:05,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 146 [2025-01-09 05:01:05,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:05,125 INFO L225 Difference]: With dead ends: 223 [2025-01-09 05:01:05,125 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 05:01:05,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 289 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-01-09 05:01:05,131 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:05,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 465 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:01:05,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 05:01:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-09 05:01:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 05:01:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2025-01-09 05:01:05,145 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 146 [2025-01-09 05:01:05,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:05,145 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2025-01-09 05:01:05,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 05:01:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2025-01-09 05:01:05,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 05:01:05,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:05,148 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 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] [2025-01-09 05:01:05,159 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-01-09 05:01:05,348 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-01-09 05:01:05,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:05,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:05,349 INFO L85 PathProgramCache]: Analyzing trace with hash 566496115, now seen corresponding path program 2 times [2025-01-09 05:01:05,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:05,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153773331] [2025-01-09 05:01:05,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:01:05,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:05,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-01-09 05:01:05,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 148 statements. [2025-01-09 05:01:05,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 05:01:05,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:05,776 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2025-01-09 05:01:05,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:05,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153773331] [2025-01-09 05:01:05,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153773331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:05,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:05,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:01:05,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75818173] [2025-01-09 05:01:05,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:05,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:01:05,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:05,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:01:05,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:01:05,780 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 05:01:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:05,841 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2025-01-09 05:01:05,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:01:05,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-01-09 05:01:05,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:05,848 INFO L225 Difference]: With dead ends: 218 [2025-01-09 05:01:05,848 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 05:01:05,849 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-01-09 05:01:05,850 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 99 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:05,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 490 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:01:05,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 05:01:05,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-01-09 05:01:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2025-01-09 05:01:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 241 transitions. [2025-01-09 05:01:05,883 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 241 transitions. Word has length 148 [2025-01-09 05:01:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:05,884 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 241 transitions. [2025-01-09 05:01:05,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 05:01:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 241 transitions. [2025-01-09 05:01:05,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 05:01:05,888 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:05,888 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:05,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:01:05,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:05,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:05,889 INFO L85 PathProgramCache]: Analyzing trace with hash 448712381, now seen corresponding path program 1 times [2025-01-09 05:01:05,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:05,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100895916] [2025-01-09 05:01:05,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:05,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:05,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 05:01:06,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 05:01:06,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:06,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2025-01-09 05:01:06,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:06,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100895916] [2025-01-09 05:01:06,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100895916] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:06,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605685045] [2025-01-09 05:01:06,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:06,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:06,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:06,362 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-01-09 05:01:06,364 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-01-09 05:01:06,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 05:01:07,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 05:01:07,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:07,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:07,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 05:01:07,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2025-01-09 05:01:07,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:01:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2025-01-09 05:01:07,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605685045] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:01:07,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:01:07,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-09 05:01:07,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276912289] [2025-01-09 05:01:07,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:01:07,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:01:07,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:07,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:01:07,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:01:07,335 INFO L87 Difference]: Start difference. First operand 168 states and 241 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-01-09 05:01:11,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:01:15,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:01:19,433 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-01-09 05:01:23,444 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-01-09 05:01:23,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:23,479 INFO L93 Difference]: Finished difference Result 338 states and 486 transitions. [2025-01-09 05:01:23,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:01:23,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 217 [2025-01-09 05:01:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:23,483 INFO L225 Difference]: With dead ends: 338 [2025-01-09 05:01:23,483 INFO L226 Difference]: Without dead ends: 178 [2025-01-09 05:01:23,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 431 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-01-09 05:01:23,485 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 2 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:23,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 461 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-01-09 05:01:23,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-09 05:01:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-01-09 05:01:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 118 states have (on average 1.2796610169491525) internal successors, (151), 118 states have internal predecessors, (151), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2025-01-09 05:01:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 253 transitions. [2025-01-09 05:01:23,508 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 253 transitions. Word has length 217 [2025-01-09 05:01:23,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:23,508 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 253 transitions. [2025-01-09 05:01:23,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-01-09 05:01:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 253 transitions. [2025-01-09 05:01:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-09 05:01:23,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:23,514 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:23,529 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-01-09 05:01:23,715 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-01-09 05:01:23,715 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:23,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:23,716 INFO L85 PathProgramCache]: Analyzing trace with hash 668900925, now seen corresponding path program 2 times [2025-01-09 05:01:23,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:23,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377648844] [2025-01-09 05:01:23,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:01:23,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:23,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 227 statements into 2 equivalence classes. [2025-01-09 05:01:23,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 227 statements. [2025-01-09 05:01:23,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 05:01:23,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2025-01-09 05:01:24,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:24,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377648844] [2025-01-09 05:01:24,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377648844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:24,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:24,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:01:24,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753877617] [2025-01-09 05:01:24,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:24,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:01:24,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:24,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:01:24,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:01:24,136 INFO L87 Difference]: Start difference. First operand 178 states and 253 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 05:01:28,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:01:32,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:01:32,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:32,326 INFO L93 Difference]: Finished difference Result 472 states and 679 transitions. [2025-01-09 05:01:32,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:01:32,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 227 [2025-01-09 05:01:32,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:32,337 INFO L225 Difference]: With dead ends: 472 [2025-01-09 05:01:32,337 INFO L226 Difference]: Without dead ends: 328 [2025-01-09 05:01:32,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:01:32,339 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 142 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:32,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 661 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-01-09 05:01:32,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-01-09 05:01:32,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2025-01-09 05:01:32,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 208 states have (on average 1.2740384615384615) internal successors, (265), 208 states have internal predecessors, (265), 95 states have call successors, (95), 20 states have call predecessors, (95), 20 states have return successors, (110), 95 states have call predecessors, (110), 95 states have call successors, (110) [2025-01-09 05:01:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 470 transitions. [2025-01-09 05:01:32,398 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 470 transitions. Word has length 227 [2025-01-09 05:01:32,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:32,398 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 470 transitions. [2025-01-09 05:01:32,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 05:01:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 470 transitions. [2025-01-09 05:01:32,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-09 05:01:32,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:32,407 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:32,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:01:32,407 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:32,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:32,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1729057305, now seen corresponding path program 1 times [2025-01-09 05:01:32,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:32,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375520370] [2025-01-09 05:01:32,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:32,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:32,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 05:01:32,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 05:01:32,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:32,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:33,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2025-01-09 05:01:33,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:33,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375520370] [2025-01-09 05:01:33,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375520370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:33,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:33,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:01:33,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338620907] [2025-01-09 05:01:33,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:33,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:01:33,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:33,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:01:33,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:01:33,360 INFO L87 Difference]: Start difference. First operand 324 states and 470 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 05:01:35,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:01:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:36,040 INFO L93 Difference]: Finished difference Result 594 states and 849 transitions. [2025-01-09 05:01:36,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:01:36,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 227 [2025-01-09 05:01:36,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:36,044 INFO L225 Difference]: With dead ends: 594 [2025-01-09 05:01:36,044 INFO L226 Difference]: Without dead ends: 298 [2025-01-09 05:01:36,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:01:36,046 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 138 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:36,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 665 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 05:01:36,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-01-09 05:01:36,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2025-01-09 05:01:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 189 states have (on average 1.2328042328042328) internal successors, (233), 189 states have internal predecessors, (233), 86 states have call successors, (86), 18 states have call predecessors, (86), 18 states have return successors, (94), 86 states have call predecessors, (94), 86 states have call successors, (94) [2025-01-09 05:01:36,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 413 transitions. [2025-01-09 05:01:36,075 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 413 transitions. Word has length 227 [2025-01-09 05:01:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:36,075 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 413 transitions. [2025-01-09 05:01:36,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 05:01:36,076 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 413 transitions. [2025-01-09 05:01:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-09 05:01:36,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:36,081 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:36,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:01:36,082 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:36,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:36,082 INFO L85 PathProgramCache]: Analyzing trace with hash 216478161, now seen corresponding path program 1 times [2025-01-09 05:01:36,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:36,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15165550] [2025-01-09 05:01:36,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:36,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:36,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 05:01:36,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 05:01:36,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:36,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-01-09 05:01:36,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:36,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15165550] [2025-01-09 05:01:36,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15165550] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:36,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127141468] [2025-01-09 05:01:36,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:36,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:36,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:36,850 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:01:36,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 05:01:37,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 05:01:37,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 05:01:37,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:37,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:37,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 1860 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 05:01:37,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:37,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 352 proven. 4 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked. [2025-01-09 05:01:37,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:01:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-01-09 05:01:38,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127141468] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:01:38,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:01:38,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-01-09 05:01:38,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624279399] [2025-01-09 05:01:38,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:01:38,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 05:01:38,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:38,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 05:01:38,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:01:38,373 INFO L87 Difference]: Start difference. First operand 294 states and 413 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 9 states have call successors, (62), 5 states have call predecessors, (62), 6 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) [2025-01-09 05:01:42,394 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-01-09 05:01:43,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:01:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:44,183 INFO L93 Difference]: Finished difference Result 586 states and 836 transitions. [2025-01-09 05:01:44,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:01:44,183 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 9 states have call successors, (62), 5 states have call predecessors, (62), 6 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) Word has length 227 [2025-01-09 05:01:44,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:44,187 INFO L225 Difference]: With dead ends: 586 [2025-01-09 05:01:44,187 INFO L226 Difference]: Without dead ends: 316 [2025-01-09 05:01:44,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:01:44,189 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 167 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 122 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:44,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 469 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2025-01-09 05:01:44,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-01-09 05:01:44,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 313. [2025-01-09 05:01:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 207 states have (on average 1.2560386473429952) internal successors, (260), 209 states have internal predecessors, (260), 77 states have call successors, (77), 26 states have call predecessors, (77), 28 states have return successors, (97), 77 states have call predecessors, (97), 77 states have call successors, (97) [2025-01-09 05:01:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 434 transitions. [2025-01-09 05:01:44,218 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 434 transitions. Word has length 227 [2025-01-09 05:01:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:44,218 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 434 transitions. [2025-01-09 05:01:44,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 9 states have call successors, (62), 5 states have call predecessors, (62), 6 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) [2025-01-09 05:01:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 434 transitions. [2025-01-09 05:01:44,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-09 05:01:44,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:44,224 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:44,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 05:01:44,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:44,428 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:44,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:44,428 INFO L85 PathProgramCache]: Analyzing trace with hash -520926287, now seen corresponding path program 1 times [2025-01-09 05:01:44,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:44,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327340713] [2025-01-09 05:01:44,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:44,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:44,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 05:01:44,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 05:01:44,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:44,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-01-09 05:01:46,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:46,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327340713] [2025-01-09 05:01:46,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327340713] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:46,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177694991] [2025-01-09 05:01:46,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:46,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:46,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:46,773 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:01:46,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 05:01:47,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 05:01:47,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 05:01:47,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:47,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:47,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 05:01:47,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:47,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 05:01:50,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 05:01:50,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 05:01:50,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2025-01-09 05:01:54,995 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-01-09 05:01:54,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2025-01-09 05:02:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 397 proven. 4 refuted. 0 times theorem prover too weak. 1005 trivial. 0 not checked. [2025-01-09 05:02:16,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:02:16,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2025-01-09 05:02:16,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-01-09 05:02:17,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-01-09 05:02:17,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-01-09 05:02:17,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-01-09 05:02:17,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-01-09 05:02:17,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-01-09 05:02:17,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177694991] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:02:17,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:02:17,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 9] total 37 [2025-01-09 05:02:17,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146137068] [2025-01-09 05:02:17,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:02:17,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 05:02:17,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:17,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 05:02:17,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1191, Unknown=2, NotChecked=0, Total=1332 [2025-01-09 05:02:17,630 INFO L87 Difference]: Start difference. First operand 313 states and 434 transitions. Second operand has 37 states, 34 states have (on average 4.088235294117647) internal successors, (139), 34 states have internal predecessors, (139), 18 states have call successors, (72), 12 states have call predecessors, (72), 14 states have return successors, (72), 16 states have call predecessors, (72), 18 states have call successors, (72)