./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stateful-1.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_stateful-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:01:25,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:01:25,766 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:01:25,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:01:25,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:01:25,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:01:25,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:01:25,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:01:25,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:01:25,798 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:01:25,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:01:25,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:01:25,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:01:25,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:01:25,799 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:01:25,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:01:25,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:01:25,799 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:01:25,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:01:25,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:01:25,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:01:25,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:01:25,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:01:25,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:01:25,799 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:01:25,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:01:25,800 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:01:25,800 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:01:25,800 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:01:25,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:01:25,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:01:25,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:01:25,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:01:25,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:01:25,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:01:25,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:01:25,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:01:25,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:01:25,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:01:25,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:01:25,802 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:01:25,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:01:25,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:01:25,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:01:25,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:01:25,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:01:25,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:01:25,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:01:25,803 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 -> 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e [2025-01-09 05:01:26,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:01:26,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:01:26,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:01:26,125 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:01:26,125 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:01:26,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2025-01-09 05:01:27,490 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b74f243ec/30f7a3d0acac4f38a5fabd3098ce235b/FLAG0695e9a9f [2025-01-09 05:01:27,787 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:01:27,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2025-01-09 05:01:27,812 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b74f243ec/30f7a3d0acac4f38a5fabd3098ce235b/FLAG0695e9a9f [2025-01-09 05:01:27,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b74f243ec/30f7a3d0acac4f38a5fabd3098ce235b [2025-01-09 05:01:27,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:01:27,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:01:27,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:01:27,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:01:27,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:01:27,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:01:27" (1/1) ... [2025-01-09 05:01:27,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b9d9b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:27, skipping insertion in model container [2025-01-09 05:01:27,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:01:27" (1/1) ... [2025-01-09 05:01:27,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:01:28,163 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_stateful-1.i[23400,23413] [2025-01-09 05:01:28,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:01:28,289 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:01:28,317 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_stateful-1.i[23400,23413] [2025-01-09 05:01:28,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:01:28,416 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:01:28,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:28 WrapperNode [2025-01-09 05:01:28,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:01:28,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:01:28,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:01:28,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:01:28,423 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:01:28" (1/1) ... [2025-01-09 05:01:28,448 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:01:28" (1/1) ... [2025-01-09 05:01:28,481 INFO L138 Inliner]: procedures = 144, calls = 240, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 572 [2025-01-09 05:01:28,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:01:28,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:01:28,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:01:28,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:01:28,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:28" (1/1) ... [2025-01-09 05:01:28,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:28" (1/1) ... [2025-01-09 05:01:28,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:28" (1/1) ... [2025-01-09 05:01:28,538 INFO L175 MemorySlicer]: Split 120 memory accesses to 17 slices as follows [2, 8, 3, 8, 7, 8, 0, 20, 3, 12, 10, 10, 3, 3, 4, 12, 7]. 17 percent of accesses are in the largest equivalence class. The 31 initializations are split as follows [2, 3, 0, 3, 0, 3, 0, 6, 0, 6, 2, 2, 0, 0, 0, 4, 0]. The 37 writes are split as follows [0, 2, 1, 2, 1, 2, 0, 8, 1, 3, 4, 4, 1, 1, 2, 4, 1]. [2025-01-09 05:01:28,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:28" (1/1) ... [2025-01-09 05:01:28,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:28" (1/1) ... [2025-01-09 05:01:28,566 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:28" (1/1) ... [2025-01-09 05:01:28,568 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:28" (1/1) ... [2025-01-09 05:01:28,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:28" (1/1) ... [2025-01-09 05:01:28,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:28" (1/1) ... [2025-01-09 05:01:28,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:28" (1/1) ... [2025-01-09 05:01:28,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:01:28,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:01:28,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:01:28,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:01:28,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:28" (1/1) ... [2025-01-09 05:01:28,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:01:28,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:28,638 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:01:28,643 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:01:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 05:01:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 05:01:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 05:01:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 05:01:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 05:01:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 05:01:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 05:01:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 05:01:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 05:01:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 05:01:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 05:01:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 05:01:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 05:01:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 05:01:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 05:01:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 05:01:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 05:01:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 05:01:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 05:01:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 05:01:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 05:01:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 05:01:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 05:01:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 05:01:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 05:01:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 05:01:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 05:01:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 05:01:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 05:01:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 05:01:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 05:01:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 05:01:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 05:01:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 05:01:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:01:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 05:01:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 05:01:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 05:01:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 05:01:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 05:01:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 05:01:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 05:01:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 05:01:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 05:01:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 05:01:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 05:01:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 05:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 05:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 05:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 05:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 05:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 05:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 05:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2025-01-09 05:01:28,667 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2025-01-09 05:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-01-09 05:01:28,667 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-01-09 05:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-01-09 05:01:28,667 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-01-09 05:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 05:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 05:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 05:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 05:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 05:01:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 05:01:28,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 05:01:28,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 05:01:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 05:01:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 05:01:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 05:01:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 05:01:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 05:01:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 05:01:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 05:01:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 05:01:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 05:01:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-01-09 05:01:28,669 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-01-09 05:01:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:01:28,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:01:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 05:01:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 05:01:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 05:01:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 05:01:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 05:01:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 05:01:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-01-09 05:01:28,670 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 05:01:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 05:01:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 05:01:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 05:01:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 05:01:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 05:01:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 05:01:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 05:01:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 05:01:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 05:01:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 05:01:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 05:01:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-01-09 05:01:28,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-01-09 05:01:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:01:28,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:01:28,901 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:01:28,904 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:01:29,363 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: SUMMARY for call __CS_cs(); srcloc: null [2025-01-09 05:01:29,364 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-01-09 05:01:29,364 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:29,364 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:29,364 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-01-09 05:01:29,364 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:29,364 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-01-09 05:01:33,752 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-01-09 05:01:33,752 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:01:33,771 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:01:33,771 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 05:01:33,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:01:33 BoogieIcfgContainer [2025-01-09 05:01:33,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:01:33,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:01:33,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:01:33,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:01:33,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:01:27" (1/3) ... [2025-01-09 05:01:33,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6940e7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:01:33, skipping insertion in model container [2025-01-09 05:01:33,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:28" (2/3) ... [2025-01-09 05:01:33,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6940e7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:01:33, skipping insertion in model container [2025-01-09 05:01:33,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:01:33" (3/3) ... [2025-01-09 05:01:33,785 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_stateful-1.i [2025-01-09 05:01:33,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:01:33,798 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_stateful-1.i that has 8 procedures, 166 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 05:01:33,864 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:01:33,877 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;@14f9dc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:01:33,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 05:01:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 115 states have (on average 1.5043478260869565) internal successors, (173), 116 states have internal predecessors, (173), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 05:01:33,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 05:01:33,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:33,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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:33,892 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:33,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:33,899 INFO L85 PathProgramCache]: Analyzing trace with hash 207467221, now seen corresponding path program 1 times [2025-01-09 05:01:33,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:33,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260352603] [2025-01-09 05:01:33,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:33,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:34,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 05:01:34,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 05:01:34,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:34,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:01:34,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:34,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260352603] [2025-01-09 05:01:34,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260352603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:34,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:34,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:01:34,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597689065] [2025-01-09 05:01:34,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:34,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:01:34,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:34,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:01:34,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:01:34,442 INFO L87 Difference]: Start difference. First operand has 166 states, 115 states have (on average 1.5043478260869565) internal successors, (173), 116 states have internal predecessors, (173), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:01:38,482 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:38,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:38,550 INFO L93 Difference]: Finished difference Result 330 states and 542 transitions. [2025-01-09 05:01:38,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:01:38,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-01-09 05:01:38,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:38,561 INFO L225 Difference]: With dead ends: 330 [2025-01-09 05:01:38,562 INFO L226 Difference]: Without dead ends: 164 [2025-01-09 05:01:38,566 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:38,568 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 2 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 479 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:38,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 479 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 05:01:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-01-09 05:01:38,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2025-01-09 05:01:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 113 states have internal predecessors, (157), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 05:01:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2025-01-09 05:01:38,637 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 31 [2025-01-09 05:01:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:38,637 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2025-01-09 05:01:38,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:01:38,638 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2025-01-09 05:01:38,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 05:01:38,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:38,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:01:38,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:38,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:38,643 INFO L85 PathProgramCache]: Analyzing trace with hash -82959555, now seen corresponding path program 1 times [2025-01-09 05:01:38,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:38,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619567694] [2025-01-09 05:01:38,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:38,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:38,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 05:01:38,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 05:01:38,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:38,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:01:38,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:38,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619567694] [2025-01-09 05:01:38,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619567694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:38,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:38,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:01:38,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216382969] [2025-01-09 05:01:38,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:38,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:01:38,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:38,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:01:38,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:01:38,923 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:01:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:38,980 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2025-01-09 05:01:38,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:01:38,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-01-09 05:01:38,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:38,985 INFO L225 Difference]: With dead ends: 324 [2025-01-09 05:01:38,986 INFO L226 Difference]: Without dead ends: 164 [2025-01-09 05:01:38,987 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:38,987 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 0 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 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:38,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 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:38,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-01-09 05:01:39,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-01-09 05:01:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 114 states have internal predecessors, (158), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 05:01:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2025-01-09 05:01:39,010 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 33 [2025-01-09 05:01:39,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:39,011 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2025-01-09 05:01:39,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:01:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2025-01-09 05:01:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 05:01:39,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:39,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:01:39,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:39,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:39,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1679313349, now seen corresponding path program 1 times [2025-01-09 05:01:39,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:39,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082154345] [2025-01-09 05:01:39,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:39,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:39,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 05:01:39,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 05:01:39,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:39,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:01:39,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:39,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082154345] [2025-01-09 05:01:39,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082154345] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:39,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312778001] [2025-01-09 05:01:39,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:39,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:39,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:39,314 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:39,321 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:39,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 05:01:39,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 05:01:39,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:39,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:39,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 05:01:39,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:01:39,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:01:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:01:39,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312778001] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:01:39,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:01:39,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-09 05:01:39,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048860639] [2025-01-09 05:01:39,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:01:39,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:01:39,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:39,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:01:39,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:01:39,783 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:01:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:39,862 INFO L93 Difference]: Finished difference Result 327 states and 485 transitions. [2025-01-09 05:01:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:01:39,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-01-09 05:01:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:39,866 INFO L225 Difference]: With dead ends: 327 [2025-01-09 05:01:39,866 INFO L226 Difference]: Without dead ends: 166 [2025-01-09 05:01:39,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 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:39,871 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 0 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:39,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 947 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:01:39,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-09 05:01:39,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-01-09 05:01:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 116 states have (on average 1.3793103448275863) internal successors, (160), 116 states have internal predecessors, (160), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 05:01:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 244 transitions. [2025-01-09 05:01:39,892 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 244 transitions. Word has length 34 [2025-01-09 05:01:39,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:39,893 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 244 transitions. [2025-01-09 05:01:39,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:01:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 244 transitions. [2025-01-09 05:01:39,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 05:01:39,894 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:39,895 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:01:39,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 05:01:40,098 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:40,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:40,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:40,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1802344645, now seen corresponding path program 2 times [2025-01-09 05:01:40,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:40,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039805987] [2025-01-09 05:01:40,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:01:40,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:40,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 05:01:40,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 36 statements. [2025-01-09 05:01:40,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 05:01:40,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 05:01:40,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:40,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039805987] [2025-01-09 05:01:40,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039805987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:40,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:40,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:01:40,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418151887] [2025-01-09 05:01:40,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:40,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:01:40,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:40,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:01:40,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:01:40,457 INFO L87 Difference]: Start difference. First operand 166 states and 244 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:01:40,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:40,516 INFO L93 Difference]: Finished difference Result 322 states and 483 transitions. [2025-01-09 05:01:40,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:01:40,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-09 05:01:40,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:40,520 INFO L225 Difference]: With dead ends: 322 [2025-01-09 05:01:40,520 INFO L226 Difference]: Without dead ends: 296 [2025-01-09 05:01:40,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:40,524 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 203 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:40,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 864 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:01:40,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-01-09 05:01:40,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2025-01-09 05:01:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 83 states have call successors, (83), 14 states have call predecessors, (83), 14 states have return successors, (91), 83 states have call predecessors, (91), 83 states have call successors, (91) [2025-01-09 05:01:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 454 transitions. [2025-01-09 05:01:40,568 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 454 transitions. Word has length 36 [2025-01-09 05:01:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:40,568 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 454 transitions. [2025-01-09 05:01:40,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:01:40,569 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 454 transitions. [2025-01-09 05:01:40,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 05:01:40,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:40,572 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2025-01-09 05:01:40,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:01:40,572 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:40,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:40,573 INFO L85 PathProgramCache]: Analyzing trace with hash 28505697, now seen corresponding path program 1 times [2025-01-09 05:01:40,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:40,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437532877] [2025-01-09 05:01:40,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:40,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:40,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 05:01:40,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 05:01:40,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:40,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:40,889 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 05:01:40,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:40,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437532877] [2025-01-09 05:01:40,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437532877] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:40,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666961601] [2025-01-09 05:01:40,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:40,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:40,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:40,892 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:40,894 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:41,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 05:01:41,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 05:01:41,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:41,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:41,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 05:01:41,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 05:01:41,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:01:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 05:01:41,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666961601] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:01:41,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:01:41,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-01-09 05:01:41,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819493631] [2025-01-09 05:01:41,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:01:41,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:01:41,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:41,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:01:41,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:01:41,450 INFO L87 Difference]: Start difference. First operand 295 states and 454 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 05:01:45,557 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:45,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:45,593 INFO L93 Difference]: Finished difference Result 587 states and 905 transitions. [2025-01-09 05:01:45,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:01:45,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 86 [2025-01-09 05:01:45,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:45,608 INFO L225 Difference]: With dead ends: 587 [2025-01-09 05:01:45,609 INFO L226 Difference]: Without dead ends: 300 [2025-01-09 05:01:45,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:01:45,611 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 2 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:45,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 707 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 05:01:45,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-01-09 05:01:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-01-09 05:01:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 202 states have (on average 1.4158415841584158) internal successors, (286), 202 states have internal predecessors, (286), 83 states have call successors, (83), 14 states have call predecessors, (83), 14 states have return successors, (91), 83 states have call predecessors, (91), 83 states have call successors, (91) [2025-01-09 05:01:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 460 transitions. [2025-01-09 05:01:45,634 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 460 transitions. Word has length 86 [2025-01-09 05:01:45,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:45,635 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 460 transitions. [2025-01-09 05:01:45,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 05:01:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 460 transitions. [2025-01-09 05:01:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 05:01:45,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:45,638 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 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] [2025-01-09 05:01:45,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 05:01:45,839 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:45,839 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:45,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:45,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1364780961, now seen corresponding path program 2 times [2025-01-09 05:01:45,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:45,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174807810] [2025-01-09 05:01:45,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:01:45,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:45,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-01-09 05:01:45,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 91 statements. [2025-01-09 05:01:45,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 05:01:45,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-09 05:01:46,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:46,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174807810] [2025-01-09 05:01:46,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174807810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:46,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:46,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:01:46,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933216521] [2025-01-09 05:01:46,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:46,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:01:46,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:46,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:01:46,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:01:46,243 INFO L87 Difference]: Start difference. First operand 300 states and 460 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 05:01:47,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:01:48,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:48,096 INFO L93 Difference]: Finished difference Result 848 states and 1312 transitions. [2025-01-09 05:01:48,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:01:48,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2025-01-09 05:01:48,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:48,101 INFO L225 Difference]: With dead ends: 848 [2025-01-09 05:01:48,102 INFO L226 Difference]: Without dead ends: 577 [2025-01-09 05:01:48,104 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:48,105 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 224 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:48,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 791 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 05:01:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-01-09 05:01:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 553. [2025-01-09 05:01:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 361 states have (on average 1.443213296398892) internal successors, (521), 360 states have internal predecessors, (521), 163 states have call successors, (163), 28 states have call predecessors, (163), 28 states have return successors, (186), 164 states have call predecessors, (186), 163 states have call successors, (186) [2025-01-09 05:01:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 870 transitions. [2025-01-09 05:01:48,164 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 870 transitions. Word has length 91 [2025-01-09 05:01:48,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:48,165 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 870 transitions. [2025-01-09 05:01:48,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 05:01:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 870 transitions. [2025-01-09 05:01:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 05:01:48,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:48,171 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 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] [2025-01-09 05:01:48,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:01:48,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:48,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:48,172 INFO L85 PathProgramCache]: Analyzing trace with hash 620740031, now seen corresponding path program 1 times [2025-01-09 05:01:48,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:48,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463957754] [2025-01-09 05:01:48,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:48,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:48,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 05:01:48,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 05:01:48,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:48,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-09 05:01:48,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:48,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463957754] [2025-01-09 05:01:48,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463957754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:48,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:48,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:01:48,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685918444] [2025-01-09 05:01:48,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:48,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:01:48,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:48,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:01:48,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:01:48,714 INFO L87 Difference]: Start difference. First operand 553 states and 870 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 05:01:52,835 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:52,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:52,988 INFO L93 Difference]: Finished difference Result 1042 states and 1613 transitions. [2025-01-09 05:01:52,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:01:52,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2025-01-09 05:01:52,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:52,993 INFO L225 Difference]: With dead ends: 1042 [2025-01-09 05:01:52,993 INFO L226 Difference]: Without dead ends: 504 [2025-01-09 05:01:52,996 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:52,997 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 220 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:52,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 792 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 05:01:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-01-09 05:01:53,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 480. [2025-01-09 05:01:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 318 states have (on average 1.3584905660377358) internal successors, (432), 316 states have internal predecessors, (432), 136 states have call successors, (136), 25 states have call predecessors, (136), 25 states have return successors, (151), 138 states have call predecessors, (151), 136 states have call successors, (151) [2025-01-09 05:01:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 719 transitions. [2025-01-09 05:01:53,037 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 719 transitions. Word has length 91 [2025-01-09 05:01:53,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:53,037 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 719 transitions. [2025-01-09 05:01:53,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 05:01:53,038 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 719 transitions. [2025-01-09 05:01:53,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 05:01:53,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:53,040 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 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] [2025-01-09 05:01:53,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:01:53,040 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:53,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:53,041 INFO L85 PathProgramCache]: Analyzing trace with hash 290708255, now seen corresponding path program 1 times [2025-01-09 05:01:53,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:53,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642372929] [2025-01-09 05:01:53,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:53,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:53,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 05:01:53,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 05:01:53,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:53,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:54,156 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 05:01:54,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:54,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642372929] [2025-01-09 05:01:54,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642372929] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:54,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248841315] [2025-01-09 05:01:54,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:54,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:54,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:54,161 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:54,163 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:54,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 05:01:54,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 05:01:54,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:54,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:54,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 05:01:54,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:54,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 05:01:54,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 05:01:54,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 05:01:54,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 05:01:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-09 05:01:54,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:01:54,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248841315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:54,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:01:54,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 05:01:54,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255499536] [2025-01-09 05:01:54,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:54,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:01:54,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:54,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:01:54,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:01:54,925 INFO L87 Difference]: Start difference. First operand 480 states and 719 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 05:01:56,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:56,443 INFO L93 Difference]: Finished difference Result 543 states and 784 transitions. [2025-01-09 05:01:56,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:01:56,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2025-01-09 05:01:56,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:56,448 INFO L225 Difference]: With dead ends: 543 [2025-01-09 05:01:56,449 INFO L226 Difference]: Without dead ends: 425 [2025-01-09 05:01:56,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:01:56,451 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 244 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:56,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 941 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 05:01:56,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-09 05:01:56,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 401. [2025-01-09 05:01:56,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 273 states have (on average 1.3663003663003663) internal successors, (373), 273 states have internal predecessors, (373), 104 states have call successors, (104), 21 states have call predecessors, (104), 23 states have return successors, (122), 106 states have call predecessors, (122), 104 states have call successors, (122) [2025-01-09 05:01:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 599 transitions. [2025-01-09 05:01:56,509 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 599 transitions. Word has length 91 [2025-01-09 05:01:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:56,510 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 599 transitions. [2025-01-09 05:01:56,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 05:01:56,510 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 599 transitions. [2025-01-09 05:01:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 05:01:56,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:56,514 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 2, 2, 2, 2, 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] [2025-01-09 05:01:56,525 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:56,717 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:56,718 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:56,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:56,719 INFO L85 PathProgramCache]: Analyzing trace with hash 310815983, now seen corresponding path program 1 times [2025-01-09 05:01:56,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:56,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691591644] [2025-01-09 05:01:56,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:56,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:56,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 05:01:56,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 05:01:56,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:56,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-01-09 05:01:57,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:57,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691591644] [2025-01-09 05:01:57,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691591644] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:57,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861199122] [2025-01-09 05:01:57,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:57,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:57,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:57,268 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:57,271 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:57,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 05:01:57,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 05:01:57,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:57,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:57,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 1409 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 05:01:57,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:57,959 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-01-09 05:01:57,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:01:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-01-09 05:01:58,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861199122] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:01:58,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:01:58,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-01-09 05:01:58,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094823276] [2025-01-09 05:01:58,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:01:58,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 05:01:58,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:58,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 05:01:58,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:01:58,385 INFO L87 Difference]: Start difference. First operand 401 states and 599 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 7 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) [2025-01-09 05:01:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:59,402 INFO L93 Difference]: Finished difference Result 1025 states and 1561 transitions. [2025-01-09 05:01:59,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:01:59,403 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 7 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) Word has length 134 [2025-01-09 05:01:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:59,408 INFO L225 Difference]: With dead ends: 1025 [2025-01-09 05:01:59,408 INFO L226 Difference]: Without dead ends: 659 [2025-01-09 05:01:59,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 267 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:59,411 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 440 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:59,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 925 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 05:01:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-01-09 05:01:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 620. [2025-01-09 05:01:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 407 states have (on average 1.3906633906633907) internal successors, (566), 410 states have internal predecessors, (566), 174 states have call successors, (174), 36 states have call predecessors, (174), 38 states have return successors, (206), 173 states have call predecessors, (206), 174 states have call successors, (206) [2025-01-09 05:01:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 946 transitions. [2025-01-09 05:01:59,465 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 946 transitions. Word has length 134 [2025-01-09 05:01:59,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:59,465 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 946 transitions. [2025-01-09 05:01:59,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 7 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) [2025-01-09 05:01:59,466 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 946 transitions. [2025-01-09 05:01:59,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 05:01:59,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:59,470 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 2, 2, 2, 2, 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] [2025-01-09 05:01:59,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 05:01:59,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 05:01:59,671 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:59,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:59,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1895503503, now seen corresponding path program 1 times [2025-01-09 05:01:59,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:59,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682888307] [2025-01-09 05:01:59,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:59,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:59,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 05:01:59,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 05:01:59,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:59,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-01-09 05:02:01,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:01,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682888307] [2025-01-09 05:02:01,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682888307] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:01,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679388289] [2025-01-09 05:02:01,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:01,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:01,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:01,542 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:02:01,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 05:02:01,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 05:02:02,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 05:02:02,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:02,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:02,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 1507 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 05:02:02,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:02:02,421 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:02:04,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 05:02:04,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 05:02:04,463 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:02:05,664 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-01-09 05:02:05,664 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:20,372 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 85 proven. 4 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-01-09 05:02:20,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:02:20,598 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:20,606 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:21,112 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:21,115 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:21,166 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:21,168 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:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-01-09 05:02:21,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679388289] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:02:21,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:02:21,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 9] total 37 [2025-01-09 05:02:21,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681701548] [2025-01-09 05:02:21,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:02:21,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 05:02:21,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:21,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 05:02:21,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1193, Unknown=1, NotChecked=0, Total=1332 [2025-01-09 05:02:21,355 INFO L87 Difference]: Start difference. First operand 620 states and 946 transitions. Second operand has 37 states, 34 states have (on average 4.529411764705882) internal successors, (154), 35 states have internal predecessors, (154), 13 states have call successors, (42), 11 states have call predecessors, (42), 13 states have return successors, (42), 12 states have call predecessors, (42), 13 states have call successors, (42) [2025-01-09 05:02:24,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 05:02:25,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:02:27,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:02:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:33,409 INFO L93 Difference]: Finished difference Result 1222 states and 1910 transitions. [2025-01-09 05:02:33,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 05:02:33,409 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 4.529411764705882) internal successors, (154), 35 states have internal predecessors, (154), 13 states have call successors, (42), 11 states have call predecessors, (42), 13 states have return successors, (42), 12 states have call predecessors, (42), 13 states have call successors, (42) Word has length 134 [2025-01-09 05:02:33,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:33,415 INFO L225 Difference]: With dead ends: 1222 [2025-01-09 05:02:33,416 INFO L226 Difference]: Without dead ends: 718 [2025-01-09 05:02:33,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 245 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=662, Invalid=3497, Unknown=1, NotChecked=0, Total=4160 [2025-01-09 05:02:33,419 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1421 mSDsluCounter, 2581 mSDsCounter, 0 mSdLazyCounter, 3399 mSolverCounterSat, 1119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 2810 SdHoareTripleChecker+Invalid, 4518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1119 IncrementalHoareTripleChecker+Valid, 3399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:33,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 2810 Invalid, 4518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1119 Valid, 3399 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2025-01-09 05:02:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-01-09 05:02:33,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 669. [2025-01-09 05:02:33,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 437 states have (on average 1.3890160183066362) internal successors, (607), 443 states have internal predecessors, (607), 188 states have call successors, (188), 36 states have call predecessors, (188), 43 states have return successors, (245), 189 states have call predecessors, (245), 188 states have call successors, (245) [2025-01-09 05:02:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1040 transitions. [2025-01-09 05:02:33,502 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1040 transitions. Word has length 134 [2025-01-09 05:02:33,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:33,502 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 1040 transitions. [2025-01-09 05:02:33,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 4.529411764705882) internal successors, (154), 35 states have internal predecessors, (154), 13 states have call successors, (42), 11 states have call predecessors, (42), 13 states have return successors, (42), 12 states have call predecessors, (42), 13 states have call successors, (42) [2025-01-09 05:02:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1040 transitions. [2025-01-09 05:02:33,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 05:02:33,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:33,507 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 05:02:33,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 05:02:33,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 05:02:33,711 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:33,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:33,711 INFO L85 PathProgramCache]: Analyzing trace with hash 915003041, now seen corresponding path program 1 times [2025-01-09 05:02:33,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:33,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430416945] [2025-01-09 05:02:33,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:33,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:33,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 05:02:33,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 05:02:33,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:33,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-01-09 05:02:33,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:33,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430416945] [2025-01-09 05:02:33,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430416945] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:33,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63739994] [2025-01-09 05:02:33,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:33,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:33,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:33,948 INFO L229 MonitoredProcess]: Starting monitored process 7 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:02:33,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 05:02:34,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 05:02:34,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 05:02:34,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:34,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:34,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 1693 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:02:34,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:02:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-01-09 05:02:34,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:02:34,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63739994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:34,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:02:34,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-01-09 05:02:34,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412445035] [2025-01-09 05:02:34,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:34,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:02:34,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:34,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:02:34,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:02:34,604 INFO L87 Difference]: Start difference. First operand 669 states and 1040 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 05:02:34,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:34,683 INFO L93 Difference]: Finished difference Result 1098 states and 1764 transitions. [2025-01-09 05:02:34,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:02:34,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 153 [2025-01-09 05:02:34,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:34,691 INFO L225 Difference]: With dead ends: 1098 [2025-01-09 05:02:34,692 INFO L226 Difference]: Without dead ends: 673 [2025-01-09 05:02:34,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 154 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:02:34,696 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:34,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 470 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:02:34,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-01-09 05:02:34,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2025-01-09 05:02:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 441 states have (on average 1.3854875283446713) internal successors, (611), 447 states have internal predecessors, (611), 188 states have call successors, (188), 36 states have call predecessors, (188), 43 states have return successors, (245), 189 states have call predecessors, (245), 188 states have call successors, (245) [2025-01-09 05:02:34,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1044 transitions. [2025-01-09 05:02:34,777 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1044 transitions. Word has length 153 [2025-01-09 05:02:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:34,779 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 1044 transitions. [2025-01-09 05:02:34,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 05:02:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1044 transitions. [2025-01-09 05:02:34,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 05:02:34,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:34,783 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 05:02:34,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 05:02:34,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 05:02:34,986 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:34,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:34,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1594275295, now seen corresponding path program 1 times [2025-01-09 05:02:34,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:34,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894872650] [2025-01-09 05:02:34,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:34,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:35,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 05:02:35,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 05:02:35,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:35,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:37,741 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2025-01-09 05:02:37,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:37,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894872650] [2025-01-09 05:02:37,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894872650] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:37,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406026283] [2025-01-09 05:02:37,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:37,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:37,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:37,746 INFO L229 MonitoredProcess]: Starting monitored process 8 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:02:37,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 05:02:38,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 05:02:38,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 05:02:38,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:38,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:38,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 1696 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 05:02:38,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:02:38,712 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 23 treesize of output 1 [2025-01-09 05:02:43,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 05:02:43,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 05:02:43,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 50 [2025-01-09 05:02:43,587 INFO L349 Elim1Store]: treesize reduction 58, result has 61.3 percent of original size [2025-01-09 05:02:43,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 122 [2025-01-09 05:02:44,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 05:02:44,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2025-01-09 05:02:44,650 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 75 proven. 62 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-01-09 05:02:44,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:02:44,909 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 28 treesize of output 26 [2025-01-09 05:02:44,913 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 58 treesize of output 54 [2025-01-09 05:02:45,385 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 21 treesize of output 19 [2025-01-09 05:02:45,389 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 30 treesize of output 26 [2025-01-09 05:02:45,510 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 21 treesize of output 19 [2025-01-09 05:02:45,515 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 30 treesize of output 26 [2025-01-09 05:02:45,773 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2025-01-09 05:02:45,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406026283] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:02:45,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:02:45,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 14] total 45 [2025-01-09 05:02:45,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087883824] [2025-01-09 05:02:45,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:02:45,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-09 05:02:45,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:45,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-09 05:02:45,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1812, Unknown=2, NotChecked=0, Total=1980 [2025-01-09 05:02:45,776 INFO L87 Difference]: Start difference. First operand 673 states and 1044 transitions. Second operand has 45 states, 39 states have (on average 4.487179487179487) internal successors, (175), 42 states have internal predecessors, (175), 17 states have call successors, (47), 11 states have call predecessors, (47), 15 states have return successors, (47), 15 states have call predecessors, (47), 17 states have call successors, (47) [2025-01-09 05:02:49,846 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 [0]