./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_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-?-48c9605-m [2025-02-07 21:25:29,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:25:29,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:25:29,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:25:29,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:25:29,634 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:25:29,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:25:29,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:25:29,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:25:29,635 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:25:29,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:25:29,635 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:25:29,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:25:29,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:25:29,637 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:25:29,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:25:29,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:25:29,637 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:25:29,637 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:25:29,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:25:29,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:25:29,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:25:29,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:25:29,638 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:25:29,638 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:25:29,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:25:29,638 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:25:29,638 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:25:29,638 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:25:29,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:25:29,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:25:29,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:25:29,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:29,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:25:29,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:25:29,639 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:25:29,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:25:29,639 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:25:29,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:25:29,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:25:29,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:25:29,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:25:29,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:25:29,640 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-02-07 21:25:29,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:25:29,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:25:29,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:25:29,851 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:25:29,851 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:25:29,853 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-02-07 21:25:31,019 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61a39fe45/8405da202a264079a4a0cc9c84680cde/FLAG461701677 [2025-02-07 21:25:31,349 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:25:31,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2025-02-07 21:25:31,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61a39fe45/8405da202a264079a4a0cc9c84680cde/FLAG461701677 [2025-02-07 21:25:31,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61a39fe45/8405da202a264079a4a0cc9c84680cde [2025-02-07 21:25:31,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:25:31,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:25:31,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:31,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:25:31,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:25:31,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b4c7b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31, skipping insertion in model container [2025-02-07 21:25:31,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:25:31,638 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i[23400,23413] [2025-02-07 21:25:31,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:31,718 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:25:31,736 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-02-07 21:25:31,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:31,812 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:25:31,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31 WrapperNode [2025-02-07 21:25:31,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:31,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:31,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:25:31,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:25:31,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,866 INFO L138 Inliner]: procedures = 144, calls = 240, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 572 [2025-02-07 21:25:31,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:31,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:25:31,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:25:31,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:25:31,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,887 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,925 INFO L175 MemorySlicer]: Split 120 memory accesses to 17 slices as follows [2, 3, 12, 8, 8, 4, 8, 0, 20, 7, 12, 3, 10, 10, 3, 3, 7]. 17 percent of accesses are in the largest equivalence class. The 31 initializations are split as follows [2, 0, 4, 3, 3, 0, 3, 0, 6, 0, 6, 0, 2, 2, 0, 0, 0]. The 37 writes are split as follows [0, 1, 4, 2, 2, 2, 2, 0, 8, 1, 3, 1, 4, 4, 1, 1, 1]. [2025-02-07 21:25:31,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,959 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:25:31,996 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:25:31,996 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:25:31,996 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:25:31,997 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:32,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:32,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:32,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:25:32,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:25:32,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:25:32,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:25:32,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 21:25:32,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 21:25:32,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 21:25:32,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 21:25:32,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 21:25:32,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 21:25:32,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 21:25:32,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 21:25:32,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 21:25:32,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 21:25:32,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 21:25:32,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 21:25:32,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-07 21:25:32,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-07 21:25:32,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-07 21:25:32,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:25:32,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:25:32,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 21:25:32,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 21:25:32,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 21:25:32,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 21:25:32,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 21:25:32,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 21:25:32,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 21:25:32,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 21:25:32,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 21:25:32,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 21:25:32,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 21:25:32,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 21:25:32,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-07 21:25:32,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2025-02-07 21:25:32,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2025-02-07 21:25:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-02-07 21:25:32,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-07 21:25:32,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-07 21:25:32,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:32,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-07 21:25:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-07 21:25:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-07 21:25:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-07 21:25:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-07 21:25:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-07 21:25:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-07 21:25:32,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-07 21:25:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:25:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:25:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 21:25:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 21:25:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 21:25:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 21:25:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 21:25:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 21:25:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 21:25:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 21:25:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 21:25:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 21:25:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 21:25:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 21:25:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-07 21:25:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-07 21:25:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-07 21:25:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-02-07 21:25:32,063 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-02-07 21:25:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:25:32,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:25:32,280 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:25:32,281 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:25:32,597 INFO L1324 $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-02-07 21:25:32,597 INFO L1324 $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-02-07 21:25:32,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-07 21:25:32,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:32,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-07 21:25:32,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:32,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:36,808 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2025-02-07 21:25:36,808 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:25:36,819 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:25:36,822 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:25:36,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:36 BoogieIcfgContainer [2025-02-07 21:25:36,822 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:25:36,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:25:36,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:25:36,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:25:36,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:25:31" (1/3) ... [2025-02-07 21:25:36,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e40ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:36, skipping insertion in model container [2025-02-07 21:25:36,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (2/3) ... [2025-02-07 21:25:36,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e40ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:36, skipping insertion in model container [2025-02-07 21:25:36,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:36" (3/3) ... [2025-02-07 21:25:36,830 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_stateful-1.i [2025-02-07 21:25:36,843 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:25:36,845 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_stateful-1.i that has 8 procedures, 162 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 21:25:36,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:25:36,902 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;@2ba0ac20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:25:36,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:25:36,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 108 states have (on average 1.537037037037037) internal successors, (166), 112 states have internal predecessors, (166), 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-02-07 21:25:36,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-07 21:25:36,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:36,917 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] [2025-02-07 21:25:36,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:36,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:36,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1075905984, now seen corresponding path program 1 times [2025-02-07 21:25:36,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:36,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051051519] [2025-02-07 21:25:36,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:36,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:37,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-07 21:25:37,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 21:25:37,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:37,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:25:37,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:37,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051051519] [2025-02-07 21:25:37,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051051519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:37,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:37,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 21:25:37,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794453311] [2025-02-07 21:25:37,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:37,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:37,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:37,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:37,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:37,381 INFO L87 Difference]: Start difference. First operand has 162 states, 108 states have (on average 1.537037037037037) internal successors, (166), 112 states have internal predecessors, (166), 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.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:38,072 INFO L93 Difference]: Finished difference Result 323 states and 529 transitions. [2025-02-07 21:25:38,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:38,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 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 30 [2025-02-07 21:25:38,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:38,079 INFO L225 Difference]: With dead ends: 323 [2025-02-07 21:25:38,079 INFO L226 Difference]: Without dead ends: 156 [2025-02-07 21:25:38,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:38,084 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 2 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:38,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 465 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 21:25:38,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-07 21:25:38,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2025-02-07 21:25:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 106 states have (on average 1.169811320754717) internal successors, (124), 106 states have internal predecessors, (124), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-07 21:25:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 206 transitions. [2025-02-07 21:25:38,118 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 206 transitions. Word has length 30 [2025-02-07 21:25:38,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:38,118 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 206 transitions. [2025-02-07 21:25:38,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:38,118 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 206 transitions. [2025-02-07 21:25:38,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-07 21:25:38,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:38,120 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] [2025-02-07 21:25:38,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:25:38,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:38,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash 407226680, now seen corresponding path program 1 times [2025-02-07 21:25:38,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:38,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950869555] [2025-02-07 21:25:38,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:38,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:38,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 21:25:38,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 21:25:38,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:38,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:25:38,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:38,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950869555] [2025-02-07 21:25:38,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950869555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:38,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:38,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:38,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659344025] [2025-02-07 21:25:38,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:38,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:38,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:38,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:38,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:38,263 INFO L87 Difference]: Start difference. First operand 155 states and 206 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:38,293 INFO L93 Difference]: Finished difference Result 309 states and 412 transitions. [2025-02-07 21:25:38,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:38,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 32 [2025-02-07 21:25:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:38,296 INFO L225 Difference]: With dead ends: 309 [2025-02-07 21:25:38,296 INFO L226 Difference]: Without dead ends: 156 [2025-02-07 21:25:38,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:38,297 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:38,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 405 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:38,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-07 21:25:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-02-07 21:25:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 107 states have internal predecessors, (125), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-07 21:25:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 207 transitions. [2025-02-07 21:25:38,307 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 207 transitions. Word has length 32 [2025-02-07 21:25:38,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:38,308 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 207 transitions. [2025-02-07 21:25:38,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:38,308 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 207 transitions. [2025-02-07 21:25:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 21:25:38,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:38,309 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-02-07 21:25:38,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:25:38,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:38,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:38,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1475452497, now seen corresponding path program 1 times [2025-02-07 21:25:38,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:38,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152659366] [2025-02-07 21:25:38,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:38,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:38,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 21:25:38,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 21:25:38,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:38,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:38,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:25:38,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:38,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152659366] [2025-02-07 21:25:38,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152659366] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:38,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533646646] [2025-02-07 21:25:38,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:38,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:38,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:38,545 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:38,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 21:25:38,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 21:25:38,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 21:25:38,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:38,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:38,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:38,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:38,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:25:38,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:25:38,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533646646] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:38,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:38,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-07 21:25:38,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761797024] [2025-02-07 21:25:38,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:38,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:25:38,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:38,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:25:38,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:38,893 INFO L87 Difference]: Start difference. First operand 156 states and 207 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:38,930 INFO L93 Difference]: Finished difference Result 312 states and 416 transitions. [2025-02-07 21:25:38,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:38,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-02-07 21:25:38,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:38,933 INFO L225 Difference]: With dead ends: 312 [2025-02-07 21:25:38,933 INFO L226 Difference]: Without dead ends: 158 [2025-02-07 21:25:38,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:38,934 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:38,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 405 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:38,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-07 21:25:38,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-02-07 21:25:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 109 states have (on average 1.165137614678899) internal successors, (127), 109 states have internal predecessors, (127), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-07 21:25:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 209 transitions. [2025-02-07 21:25:38,948 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 209 transitions. Word has length 33 [2025-02-07 21:25:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:38,948 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 209 transitions. [2025-02-07 21:25:38,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 209 transitions. [2025-02-07 21:25:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 21:25:38,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:38,949 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] [2025-02-07 21:25:38,961 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-02-07 21:25:39,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:39,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:39,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:39,151 INFO L85 PathProgramCache]: Analyzing trace with hash 298540849, now seen corresponding path program 2 times [2025-02-07 21:25:39,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:39,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675453239] [2025-02-07 21:25:39,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:39,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:39,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-07 21:25:39,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 35 statements. [2025-02-07 21:25:39,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:39,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 21:25:39,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:39,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675453239] [2025-02-07 21:25:39,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675453239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:39,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:39,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:39,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467060630] [2025-02-07 21:25:39,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:39,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:39,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:39,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:39,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:39,478 INFO L87 Difference]: Start difference. First operand 158 states and 209 transitions. Second operand has 4 states, 4 states have (on average 8.25) 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-02-07 21:25:39,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:39,536 INFO L93 Difference]: Finished difference Result 307 states and 414 transitions. [2025-02-07 21:25:39,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:39,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) 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 35 [2025-02-07 21:25:39,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:39,543 INFO L225 Difference]: With dead ends: 307 [2025-02-07 21:25:39,543 INFO L226 Difference]: Without dead ends: 281 [2025-02-07 21:25:39,543 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-02-07 21:25:39,546 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 170 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:39,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 755 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:39,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-07 21:25:39,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-02-07 21:25:39,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 185 states have (on average 1.1675675675675676) internal successors, (216), 185 states have internal predecessors, (216), 81 states have call successors, (81), 14 states have call predecessors, (81), 14 states have return successors, (89), 81 states have call predecessors, (89), 81 states have call successors, (89) [2025-02-07 21:25:39,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 386 transitions. [2025-02-07 21:25:39,575 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 386 transitions. Word has length 35 [2025-02-07 21:25:39,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:39,575 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 386 transitions. [2025-02-07 21:25:39,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) 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-02-07 21:25:39,575 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 386 transitions. [2025-02-07 21:25:39,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-07 21:25:39,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:39,579 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 3, 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] [2025-02-07 21:25:39,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:25:39,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:39,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:39,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1894018766, now seen corresponding path program 1 times [2025-02-07 21:25:39,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:39,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333006634] [2025-02-07 21:25:39,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:39,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:39,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-07 21:25:39,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-07 21:25:39,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:39,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-02-07 21:25:39,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:39,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333006634] [2025-02-07 21:25:39,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333006634] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:39,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278493036] [2025-02-07 21:25:39,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:39,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:39,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:39,891 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:39,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 21:25:40,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-07 21:25:40,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-07 21:25:40,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:40,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:40,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:40,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:40,294 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-02-07 21:25:40,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-02-07 21:25:40,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278493036] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:40,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:40,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 5 [2025-02-07 21:25:40,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423691741] [2025-02-07 21:25:40,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:40,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:25:40,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:40,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:25:40,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:40,399 INFO L87 Difference]: Start difference. First operand 281 states and 386 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-07 21:25:40,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:40,506 INFO L93 Difference]: Finished difference Result 560 states and 770 transitions. [2025-02-07 21:25:40,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:40,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 117 [2025-02-07 21:25:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:40,509 INFO L225 Difference]: With dead ends: 560 [2025-02-07 21:25:40,509 INFO L226 Difference]: Without dead ends: 286 [2025-02-07 21:25:40,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 231 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:40,510 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 2 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:40,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 402 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:25:40,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-02-07 21:25:40,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2025-02-07 21:25:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 190 states have (on average 1.168421052631579) internal successors, (222), 190 states have internal predecessors, (222), 81 states have call successors, (81), 14 states have call predecessors, (81), 14 states have return successors, (89), 81 states have call predecessors, (89), 81 states have call successors, (89) [2025-02-07 21:25:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 392 transitions. [2025-02-07 21:25:40,527 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 392 transitions. Word has length 117 [2025-02-07 21:25:40,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:40,527 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 392 transitions. [2025-02-07 21:25:40,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-07 21:25:40,527 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 392 transitions. [2025-02-07 21:25:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-07 21:25:40,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:40,529 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 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] [2025-02-07 21:25:40,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 21:25:40,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:40,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:40,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:40,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1584005747, now seen corresponding path program 2 times [2025-02-07 21:25:40,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:40,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489086513] [2025-02-07 21:25:40,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:40,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:40,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-02-07 21:25:40,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 46 of 122 statements. [2025-02-07 21:25:40,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:40,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-07 21:25:40,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:40,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489086513] [2025-02-07 21:25:40,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489086513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:40,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:40,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:40,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242822915] [2025-02-07 21:25:40,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:40,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:40,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:40,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:40,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:40,941 INFO L87 Difference]: Start difference. First operand 286 states and 392 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-07 21:25:41,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:41,869 INFO L93 Difference]: Finished difference Result 808 states and 1110 transitions. [2025-02-07 21:25:41,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:41,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-02-07 21:25:41,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:41,874 INFO L225 Difference]: With dead ends: 808 [2025-02-07 21:25:41,874 INFO L226 Difference]: Without dead ends: 550 [2025-02-07 21:25:41,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:41,876 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 190 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:41,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 665 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 21:25:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-02-07 21:25:41,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 526. [2025-02-07 21:25:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 338 states have (on average 1.165680473372781) internal successors, (394), 337 states have internal predecessors, (394), 159 states have call successors, (159), 28 states have call predecessors, (159), 28 states have return successors, (182), 160 states have call predecessors, (182), 159 states have call successors, (182) [2025-02-07 21:25:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 735 transitions. [2025-02-07 21:25:41,918 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 735 transitions. Word has length 122 [2025-02-07 21:25:41,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:41,919 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 735 transitions. [2025-02-07 21:25:41,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-07 21:25:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 735 transitions. [2025-02-07 21:25:41,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-07 21:25:41,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:41,922 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 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] [2025-02-07 21:25:41,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:25:41,922 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:41,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:41,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2008544045, now seen corresponding path program 1 times [2025-02-07 21:25:41,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:41,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866905159] [2025-02-07 21:25:41,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:41,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:41,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-07 21:25:42,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-07 21:25:42,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:42,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-07 21:25:42,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:42,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866905159] [2025-02-07 21:25:42,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866905159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:42,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:42,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:42,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190040981] [2025-02-07 21:25:42,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:42,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:42,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:42,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:42,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:42,358 INFO L87 Difference]: Start difference. First operand 526 states and 735 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-07 21:25:43,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:43,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:43,951 INFO L93 Difference]: Finished difference Result 989 states and 1357 transitions. [2025-02-07 21:25:43,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:43,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-02-07 21:25:43,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:43,955 INFO L225 Difference]: With dead ends: 989 [2025-02-07 21:25:43,955 INFO L226 Difference]: Without dead ends: 475 [2025-02-07 21:25:43,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:43,957 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 186 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:43,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 666 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-07 21:25:43,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-02-07 21:25:43,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 451. [2025-02-07 21:25:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 294 states have (on average 1.163265306122449) internal successors, (342), 293 states have internal predecessors, (342), 131 states have call successors, (131), 25 states have call predecessors, (131), 25 states have return successors, (145), 132 states have call predecessors, (145), 131 states have call successors, (145) [2025-02-07 21:25:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 618 transitions. [2025-02-07 21:25:43,982 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 618 transitions. Word has length 122 [2025-02-07 21:25:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:43,982 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 618 transitions. [2025-02-07 21:25:43,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-07 21:25:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 618 transitions. [2025-02-07 21:25:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-07 21:25:43,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:43,984 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 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] [2025-02-07 21:25:43,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:25:43,984 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:43,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:43,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1064972083, now seen corresponding path program 1 times [2025-02-07 21:25:43,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:43,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110751536] [2025-02-07 21:25:43,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:43,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:44,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-07 21:25:44,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-07 21:25:44,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:44,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-07 21:25:44,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:44,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110751536] [2025-02-07 21:25:44,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110751536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:44,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:44,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:25:44,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223439563] [2025-02-07 21:25:44,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:44,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:25:44,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:44,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:25:44,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:44,531 INFO L87 Difference]: Start difference. First operand 451 states and 618 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-07 21:25:45,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:45,028 INFO L93 Difference]: Finished difference Result 514 states and 683 transitions. [2025-02-07 21:25:45,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 21:25:45,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-02-07 21:25:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:45,032 INFO L225 Difference]: With dead ends: 514 [2025-02-07 21:25:45,032 INFO L226 Difference]: Without dead ends: 400 [2025-02-07 21:25:45,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:25:45,033 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 189 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:45,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 789 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 21:25:45,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-02-07 21:25:45,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 376. [2025-02-07 21:25:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 253 states have (on average 1.1660079051383399) internal successors, (295), 254 states have internal predecessors, (295), 99 states have call successors, (99), 21 states have call predecessors, (99), 23 states have return successors, (116), 100 states have call predecessors, (116), 99 states have call successors, (116) [2025-02-07 21:25:45,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 510 transitions. [2025-02-07 21:25:45,068 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 510 transitions. Word has length 122 [2025-02-07 21:25:45,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:45,068 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 510 transitions. [2025-02-07 21:25:45,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-07 21:25:45,068 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 510 transitions. [2025-02-07 21:25:45,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-07 21:25:45,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:45,070 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 6, 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, 1, 1, 1, 1, 1] [2025-02-07 21:25:45,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:25:45,070 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:45,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:45,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1113376617, now seen corresponding path program 1 times [2025-02-07 21:25:45,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:45,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252317291] [2025-02-07 21:25:45,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:45,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:45,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-07 21:25:45,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-07 21:25:45,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:45,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-02-07 21:25:45,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:45,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252317291] [2025-02-07 21:25:45,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252317291] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:45,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391559755] [2025-02-07 21:25:45,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:45,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:45,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:45,535 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:45,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 21:25:45,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-07 21:25:45,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-07 21:25:45,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:45,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:45,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 1491 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 21:25:45,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-02-07 21:25:46,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:46,353 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-02-07 21:25:46,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391559755] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:46,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:46,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-02-07 21:25:46,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465245799] [2025-02-07 21:25:46,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:46,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 21:25:46,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:46,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 21:25:46,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-07 21:25:46,355 INFO L87 Difference]: Start difference. First operand 376 states and 510 transitions. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 7 states have call successors, (35), 4 states have call predecessors, (35), 5 states have return successors, (36), 6 states have call predecessors, (36), 7 states have call successors, (36) [2025-02-07 21:25:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:46,966 INFO L93 Difference]: Finished difference Result 754 states and 1033 transitions. [2025-02-07 21:25:46,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 21:25:46,967 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 7 states have call successors, (35), 4 states have call predecessors, (35), 5 states have return successors, (36), 6 states have call predecessors, (36), 7 states have call successors, (36) Word has length 154 [2025-02-07 21:25:46,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:46,969 INFO L225 Difference]: With dead ends: 754 [2025-02-07 21:25:46,970 INFO L226 Difference]: Without dead ends: 412 [2025-02-07 21:25:46,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 307 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-02-07 21:25:46,971 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 257 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:46,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 705 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 21:25:46,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-02-07 21:25:46,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 406. [2025-02-07 21:25:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 272 states have (on average 1.150735294117647) internal successors, (313), 271 states have internal predecessors, (313), 107 states have call successors, (107), 26 states have call predecessors, (107), 26 states have return successors, (126), 108 states have call predecessors, (126), 107 states have call successors, (126) [2025-02-07 21:25:46,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 546 transitions. [2025-02-07 21:25:46,993 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 546 transitions. Word has length 154 [2025-02-07 21:25:46,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:46,993 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 546 transitions. [2025-02-07 21:25:46,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 7 states have call successors, (35), 4 states have call predecessors, (35), 5 states have return successors, (36), 6 states have call predecessors, (36), 7 states have call successors, (36) [2025-02-07 21:25:46,993 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 546 transitions. [2025-02-07 21:25:46,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-07 21:25:46,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:46,995 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 6, 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, 1, 1, 1, 1, 1] [2025-02-07 21:25:47,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 21:25:47,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:47,195 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:47,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:47,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2080042327, now seen corresponding path program 1 times [2025-02-07 21:25:47,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:47,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699347830] [2025-02-07 21:25:47,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:47,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:47,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-07 21:25:47,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-07 21:25:47,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:47,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-02-07 21:25:48,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:48,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699347830] [2025-02-07 21:25:48,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699347830] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:48,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497148886] [2025-02-07 21:25:48,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:48,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:48,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:48,171 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:48,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 21:25:48,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-07 21:25:48,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-07 21:25:48,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:48,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:48,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 1589 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-07 21:25:48,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:48,810 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-02-07 21:25:55,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 21:25:55,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 21:25:55,158 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-02-07 21:25:57,157 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-02-07 21:25:57,157 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-02-07 21:26:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 145 proven. 4 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-07 21:26:26,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:26:26,764 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-02-07 21:26:26,768 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-02-07 21:26:27,144 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-02-07 21:26:27,146 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-02-07 21:26:27,195 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-02-07 21:26:27,197 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-02-07 21:26:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-02-07 21:26:27,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497148886] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:26:27,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:26:27,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 9] total 33 [2025-02-07 21:26:27,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904810142] [2025-02-07 21:26:27,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:26:27,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-07 21:26:27,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:26:27,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-07 21:26:27,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=929, Unknown=2, NotChecked=0, Total=1056 [2025-02-07 21:26:27,340 INFO L87 Difference]: Start difference. First operand 406 states and 546 transitions. Second operand has 33 states, 30 states have (on average 5.466666666666667) internal successors, (164), 33 states have internal predecessors, (164), 13 states have call successors, (51), 10 states have call predecessors, (51), 13 states have return successors, (51), 12 states have call predecessors, (51), 13 states have call successors, (51) [2025-02-07 21:26:28,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:33,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:36,489 INFO L93 Difference]: Finished difference Result 815 states and 1124 transitions. [2025-02-07 21:26:36,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-07 21:26:36,489 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 5.466666666666667) internal successors, (164), 33 states have internal predecessors, (164), 13 states have call successors, (51), 10 states have call predecessors, (51), 13 states have return successors, (51), 12 states have call predecessors, (51), 13 states have call successors, (51) Word has length 154 [2025-02-07 21:26:36,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:36,494 INFO L225 Difference]: With dead ends: 815 [2025-02-07 21:26:36,494 INFO L226 Difference]: Without dead ends: 470 [2025-02-07 21:26:36,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 281 SyntacticMatches, 14 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 37.8s TimeCoverageRelationStatistics Valid=462, Invalid=2292, Unknown=2, NotChecked=0, Total=2756 [2025-02-07 21:26:36,497 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 922 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 907 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 907 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:36,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1846 Invalid, 3067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [907 Valid, 2159 Invalid, 1 Unknown, 0 Unchecked, 8.4s Time] [2025-02-07 21:26:36,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-02-07 21:26:36,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 440. [2025-02-07 21:26:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 291 states have (on average 1.140893470790378) internal successors, (332), 293 states have internal predecessors, (332), 119 states have call successors, (119), 26 states have call predecessors, (119), 29 states have return successors, (154), 120 states have call predecessors, (154), 119 states have call successors, (154) [2025-02-07 21:26:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 605 transitions. [2025-02-07 21:26:36,550 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 605 transitions. Word has length 154 [2025-02-07 21:26:36,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:36,551 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 605 transitions. [2025-02-07 21:26:36,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 5.466666666666667) internal successors, (164), 33 states have internal predecessors, (164), 13 states have call successors, (51), 10 states have call predecessors, (51), 13 states have return successors, (51), 12 states have call predecessors, (51), 13 states have call successors, (51) [2025-02-07 21:26:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 605 transitions. [2025-02-07 21:26:36,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-02-07 21:26:36,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:26:36,556 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 6, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:26:36,568 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-02-07 21:26:36,761 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,SelfDestructingSolverStorable9 [2025-02-07 21:26:36,761 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:26:36,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:26:36,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2024931627, now seen corresponding path program 1 times [2025-02-07 21:26:36,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:26:36,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103177710] [2025-02-07 21:26:36,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:36,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:26:36,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-02-07 21:26:36,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-02-07 21:26:36,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:36,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-02-07 21:26:38,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:26:38,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103177710] [2025-02-07 21:26:38,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103177710] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:26:38,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523273890] [2025-02-07 21:26:38,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:38,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:26:38,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:26:38,276 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:26:38,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 21:26:38,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-02-07 21:26:38,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-02-07 21:26:38,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:38,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:38,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 2022 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-07 21:26:38,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:26:39,027 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2025-02-07 21:26:39,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 21:26:39,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523273890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:26:39,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 21:26:39,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 22 [2025-02-07 21:26:39,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458590144] [2025-02-07 21:26:39,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:26:39,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 21:26:39,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:26:39,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 21:26:39,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2025-02-07 21:26:39,030 INFO L87 Difference]: Start difference. First operand 440 states and 605 transitions. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 6 states have internal predecessors, (108), 3 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-02-07 21:26:39,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:39,620 INFO L93 Difference]: Finished difference Result 1022 states and 1433 transitions. [2025-02-07 21:26:39,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 21:26:39,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 6 states have internal predecessors, (108), 3 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 238 [2025-02-07 21:26:39,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:39,623 INFO L225 Difference]: With dead ends: 1022 [2025-02-07 21:26:39,623 INFO L226 Difference]: Without dead ends: 544 [2025-02-07 21:26:39,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2025-02-07 21:26:39,625 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 181 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:39,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 537 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 21:26:39,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-02-07 21:26:39,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 522. [2025-02-07 21:26:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 345 states have (on average 1.127536231884058) internal successors, (389), 346 states have internal predecessors, (389), 141 states have call successors, (141), 30 states have call predecessors, (141), 35 states have return successors, (189), 145 states have call predecessors, (189), 141 states have call successors, (189) [2025-02-07 21:26:39,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 719 transitions. [2025-02-07 21:26:39,660 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 719 transitions. Word has length 238 [2025-02-07 21:26:39,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:39,660 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 719 transitions. [2025-02-07 21:26:39,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 6 states have internal predecessors, (108), 3 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-02-07 21:26:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 719 transitions. [2025-02-07 21:26:39,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-02-07 21:26:39,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:26:39,664 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:26:39,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 21:26:39,864 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,SelfDestructingSolverStorable10 [2025-02-07 21:26:39,864 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:26:39,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:26:39,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2134328766, now seen corresponding path program 1 times [2025-02-07 21:26:39,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:26:39,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108774708] [2025-02-07 21:26:39,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:39,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:26:39,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-02-07 21:26:40,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-02-07 21:26:40,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:40,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 68 proven. 17 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2025-02-07 21:26:41,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:26:41,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108774708] [2025-02-07 21:26:41,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108774708] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:26:41,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986448137] [2025-02-07 21:26:41,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:41,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:26:41,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:26:41,026 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-02-07 21:26:41,029 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-02-07 21:26:41,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-02-07 21:26:41,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-02-07 21:26:41,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:41,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:41,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 2057 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-07 21:26:41,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:26:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 286 proven. 2 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2025-02-07 21:26:42,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:26:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 68 proven. 17 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2025-02-07 21:26:42,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986448137] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:26:42,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:26:42,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 7] total 22 [2025-02-07 21:26:42,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607095986] [2025-02-07 21:26:42,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:26:42,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-07 21:26:42,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:26:42,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-07 21:26:42,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-02-07 21:26:42,797 INFO L87 Difference]: Start difference. First operand 522 states and 719 transitions. Second operand has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 20 states have internal predecessors, (205), 13 states have call successors, (66), 7 states have call predecessors, (66), 13 states have return successors, (67), 14 states have call predecessors, (67), 13 states have call successors, (67) [2025-02-07 21:26:46,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:48,485 INFO L93 Difference]: Finished difference Result 587 states and 789 transitions. [2025-02-07 21:26:48,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-07 21:26:48,486 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 20 states have internal predecessors, (205), 13 states have call successors, (66), 7 states have call predecessors, (66), 13 states have return successors, (67), 14 states have call predecessors, (67), 13 states have call successors, (67) Word has length 246 [2025-02-07 21:26:48,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:48,487 INFO L225 Difference]: With dead ends: 587 [2025-02-07 21:26:48,487 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:26:48,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 489 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=332, Invalid=1228, Unknown=0, NotChecked=0, Total=1560 [2025-02-07 21:26:48,490 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 391 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 2013 mSolverCounterSat, 585 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 2013 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:48,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 685 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 2013 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2025-02-07 21:26:48,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:26:48,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:26:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:26:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:26:48,492 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2025-02-07 21:26:48,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:48,492 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:26:48,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 20 states have internal predecessors, (205), 13 states have call successors, (66), 7 states have call predecessors, (66), 13 states have return successors, (67), 14 states have call predecessors, (67), 13 states have call successors, (67) [2025-02-07 21:26:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:26:48,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:26:48,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 21:26:48,505 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-02-07 21:26:48,699 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,SelfDestructingSolverStorable11 [2025-02-07 21:26:48,702 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:26:48,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:27:00,668 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:27:00,689 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#__CS_thread_allocated~0!offset [2025-02-07 21:27:00,690 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-07 21:27:00,690 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-02-07 21:27:00,690 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:27:00,690 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-07 21:27:00,690 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-02-07 21:27:00,690 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:27:00,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#__CS_thread_allocated~0!offset [2025-02-07 21:27:00,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-07 21:27:00,695 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-02-07 21:27:00,695 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:27:00,695 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-07 21:27:00,695 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-02-07 21:27:00,695 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-07 21:27:00,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:27:00 BoogieIcfgContainer [2025-02-07 21:27:00,695 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:27:00,696 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:27:00,696 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:27:00,696 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:27:00,697 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:36" (3/4) ... [2025-02-07 21:27:00,699 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:27:00,704 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_join [2025-02-07 21:27:00,704 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_lock [2025-02-07 21:27:00,704 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:27:00,704 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_unlock [2025-02-07 21:27:00,704 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_create [2025-02-07 21:27:00,704 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_cs [2025-02-07 21:27:00,705 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_init [2025-02-07 21:27:00,721 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 78 nodes and edges [2025-02-07 21:27:00,721 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-02-07 21:27:00,722 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-07 21:27:00,722 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-07 21:27:00,723 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:27:00,843 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:27:00,843 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:27:00,844 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:27:00,844 INFO L158 Benchmark]: Toolchain (without parser) took 89469.81ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 103.5MB in the beginning and 76.9MB in the end (delta: 26.6MB). Peak memory consumption was 125.7MB. Max. memory is 16.1GB. [2025-02-07 21:27:00,844 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:27:00,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.75ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 78.0MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 21:27:00,845 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.57ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 72.8MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:27:00,846 INFO L158 Benchmark]: Boogie Preprocessor took 128.86ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 66.1MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:27:00,846 INFO L158 Benchmark]: IcfgBuilder took 4826.08ms. Allocated memory is still 142.6MB. Free memory was 66.1MB in the beginning and 69.6MB in the end (delta: -3.6MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2025-02-07 21:27:00,847 INFO L158 Benchmark]: TraceAbstraction took 83870.90ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 69.6MB in the beginning and 87.7MB in the end (delta: -18.0MB). Peak memory consumption was 488.6MB. Max. memory is 16.1GB. [2025-02-07 21:27:00,847 INFO L158 Benchmark]: Witness Printer took 147.97ms. Allocated memory is still 243.3MB. Free memory was 87.7MB in the beginning and 76.9MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:27:00,848 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.75ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 78.0MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.57ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 72.8MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 128.86ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 66.1MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 4826.08ms. Allocated memory is still 142.6MB. Free memory was 66.1MB in the beginning and 69.6MB in the end (delta: -3.6MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * TraceAbstraction took 83870.90ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 69.6MB in the beginning and 87.7MB in the end (delta: -18.0MB). Peak memory consumption was 488.6MB. Max. memory is 16.1GB. * Witness Printer took 147.97ms. Allocated memory is still 243.3MB. Free memory was 87.7MB in the beginning and 76.9MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#__CS_thread_allocated~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#__CS_thread_allocated~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 536]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 162 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.8s, OverallIterations: 12, TraceHistogramMax: 17, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 2549 SdHoareTripleChecker+Valid, 18.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2490 mSDsluCounter, 8325 SdHoareTripleChecker+Invalid, 17.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5780 mSDsCounter, 1845 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5642 IncrementalHoareTripleChecker+Invalid, 7489 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1845 mSolverCounterUnsat, 2545 mSDtfsCounter, 5642 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1780 GetRequests, 1617 SyntacticMatches, 18 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 38.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=526occurred in iteration=6, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 131 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 46.0s InterpolantComputationTime, 2347 NumberOfCodeBlocks, 2266 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3028 ConstructedInterpolants, 36 QuantifiedInterpolants, 10275 SizeOfPredicates, 23 NumberOfNonLiveVariables, 8855 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 6022/6098 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 759]: Location Invariant Derived location invariant: (((((2 == __CS_ret_ERROR) && (__CS_ret_PREEMPTED == 1)) && (__CS_thread_index == 0)) && (__CS_error == 0)) && (i <= 1)) - InvariantResult [Line: 758]: Location Invariant Derived location invariant: ((((2 == __CS_ret_ERROR) && (__CS_ret_PREEMPTED == 1)) && (__CS_thread_index == 0)) && (__CS_error == 0)) RESULT: Ultimate proved your program to be correct! [2025-02-07 21:27:00,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE