./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/weaver/popl20-more-array-sum2.wvr.c -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 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:39:41,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:39:42,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:39:42,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:39:42,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:39:42,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:39:42,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:39:42,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:39:42,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:39:42,082 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:39:42,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:39:42,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:39:42,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:39:42,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:39:42,083 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:39:42,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:39:42,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:39:42,083 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:39:42,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:39:42,083 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:39:42,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:39:42,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:39:42,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:39:42,083 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:39:42,084 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:39:42,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:39:42,084 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:39:42,084 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:39:42,084 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:39:42,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:39:42,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:39:42,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:39:42,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:39:42,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:39:42,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:39:42,084 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:39:42,084 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:39:42,084 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:39:42,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:39:42,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:39:42,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:39:42,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:39:42,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:39:42,084 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 -> 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 [2025-02-06 04:39:42,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:39:42,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:39:42,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:39:42,362 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:39:42,362 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:39:42,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-02-06 04:39:43,475 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d198da4d/84826cf46d714c1f9245c73ca7125044/FLAGdb1cb0e0f [2025-02-06 04:39:43,812 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:39:43,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-02-06 04:39:43,820 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d198da4d/84826cf46d714c1f9245c73ca7125044/FLAGdb1cb0e0f [2025-02-06 04:39:43,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d198da4d/84826cf46d714c1f9245c73ca7125044 [2025-02-06 04:39:43,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:39:43,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:39:43,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:39:43,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:39:43,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:39:43,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:39:43" (1/1) ... [2025-02-06 04:39:43,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ae78835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:43, skipping insertion in model container [2025-02-06 04:39:43,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:39:43" (1/1) ... [2025-02-06 04:39:43,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:39:44,017 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/weaver/popl20-more-array-sum2.wvr.c[2638,2651] [2025-02-06 04:39:44,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:39:44,039 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:39:44,055 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/weaver/popl20-more-array-sum2.wvr.c[2638,2651] [2025-02-06 04:39:44,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:39:44,075 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:39:44,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:44 WrapperNode [2025-02-06 04:39:44,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:39:44,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:39:44,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:39:44,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:39:44,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:44" (1/1) ... [2025-02-06 04:39:44,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:44" (1/1) ... [2025-02-06 04:39:44,113 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 249 [2025-02-06 04:39:44,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:39:44,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:39:44,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:39:44,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:39:44,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:44" (1/1) ... [2025-02-06 04:39:44,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:44" (1/1) ... [2025-02-06 04:39:44,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:44" (1/1) ... [2025-02-06 04:39:44,154 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-06 04:39:44,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:44" (1/1) ... [2025-02-06 04:39:44,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:44" (1/1) ... [2025-02-06 04:39:44,160 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:44" (1/1) ... [2025-02-06 04:39:44,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:44" (1/1) ... [2025-02-06 04:39:44,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:44" (1/1) ... [2025-02-06 04:39:44,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:44" (1/1) ... [2025-02-06 04:39:44,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:39:44,172 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:39:44,172 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:39:44,172 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:39:44,173 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:44" (1/1) ... [2025-02-06 04:39:44,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:39:44,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:39:44,201 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-06 04:39:44,210 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-06 04:39:44,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:39:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:39:44,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:39:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:39:44,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:39:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 04:39:44,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 04:39:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:39:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:39:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:39:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:39:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:39:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:39:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:39:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:39:44,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:39:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:39:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:39:44,242 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:39:44,338 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:39:44,340 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:39:44,732 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:39:44,733 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:39:44,964 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:39:44,965 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:39:44,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:39:44 BoogieIcfgContainer [2025-02-06 04:39:44,965 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:39:44,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:39:44,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:39:44,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:39:44,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:39:43" (1/3) ... [2025-02-06 04:39:44,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132060c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:39:44, skipping insertion in model container [2025-02-06 04:39:44,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:44" (2/3) ... [2025-02-06 04:39:44,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132060c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:39:44, skipping insertion in model container [2025-02-06 04:39:44,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:39:44" (3/3) ... [2025-02-06 04:39:44,972 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2025-02-06 04:39:44,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:39:44,983 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum2.wvr.c that has 4 procedures, 31 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-06 04:39:44,983 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:39:45,034 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 04:39:45,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 91 flow [2025-02-06 04:39:45,083 INFO L124 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-02-06 04:39:45,085 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:39:45,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 5/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-02-06 04:39:45,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 91 flow [2025-02-06 04:39:45,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 31 transitions, 80 flow [2025-02-06 04:39:45,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:39:45,112 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;@1ff9c6db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:39:45,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 04:39:45,127 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:39:45,130 INFO L124 PetriNetUnfolderBase]: 5/30 cut-off events. [2025-02-06 04:39:45,130 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:39:45,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:39:45,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:39:45,133 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:39:45,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:39:45,139 INFO L85 PathProgramCache]: Analyzing trace with hash -341138598, now seen corresponding path program 1 times [2025-02-06 04:39:45,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:39:45,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561395874] [2025-02-06 04:39:45,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:39:45,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:39:45,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:39:45,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:39:45,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:39:45,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:45,415 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-06 04:39:45,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:39:45,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561395874] [2025-02-06 04:39:45,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561395874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:39:45,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:39:45,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:39:45,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831017799] [2025-02-06 04:39:45,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:39:45,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:39:45,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:39:45,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:39:45,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:39:45,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:39:45,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-06 04:39:45,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:39:45,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:39:45,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:39:45,661 INFO L124 PetriNetUnfolderBase]: 618/958 cut-off events. [2025-02-06 04:39:45,662 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-02-06 04:39:45,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1955 conditions, 958 events. 618/958 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3829 event pairs, 126 based on Foata normal form. 1/953 useless extension candidates. Maximal degree in co-relation 1717. Up to 677 conditions per place. [2025-02-06 04:39:45,674 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 39 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2025-02-06 04:39:45,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 217 flow [2025-02-06 04:39:45,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:39:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:39:45,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-02-06 04:39:45,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-02-06 04:39:45,686 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 80 flow. Second operand 3 states and 66 transitions. [2025-02-06 04:39:45,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 217 flow [2025-02-06 04:39:45,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 48 transitions, 195 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 04:39:45,694 INFO L231 Difference]: Finished difference. Result has 33 places, 34 transitions, 94 flow [2025-02-06 04:39:45,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=33, PETRI_TRANSITIONS=34} [2025-02-06 04:39:45,699 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2025-02-06 04:39:45,700 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 34 transitions, 94 flow [2025-02-06 04:39:45,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-06 04:39:45,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:39:45,701 INFO L206 CegarLoopForPetriNet]: 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] [2025-02-06 04:39:45,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:39:45,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:39:45,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:39:45,702 INFO L85 PathProgramCache]: Analyzing trace with hash -426723595, now seen corresponding path program 1 times [2025-02-06 04:39:45,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:39:45,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787381324] [2025-02-06 04:39:45,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:39:45,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:39:45,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:39:45,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:39:45,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:39:45,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:45,936 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-06 04:39:45,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:39:45,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787381324] [2025-02-06 04:39:45,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787381324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:39:45,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:39:45,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:39:45,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384078326] [2025-02-06 04:39:45,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:39:45,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:39:45,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:39:45,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:39:45,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:39:45,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:39:45,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 34 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-06 04:39:45,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:39:45,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:39:45,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:39:46,092 INFO L124 PetriNetUnfolderBase]: 618/969 cut-off events. [2025-02-06 04:39:46,095 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2025-02-06 04:39:46,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 969 events. 618/969 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4055 event pairs, 407 based on Foata normal form. 1/960 useless extension candidates. Maximal degree in co-relation 812. Up to 897 conditions per place. [2025-02-06 04:39:46,102 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 28 selfloop transitions, 4 changer transitions 1/37 dead transitions. [2025-02-06 04:39:46,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 166 flow [2025-02-06 04:39:46,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:39:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:39:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-02-06 04:39:46,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2025-02-06 04:39:46,105 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 94 flow. Second operand 4 states and 61 transitions. [2025-02-06 04:39:46,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 166 flow [2025-02-06 04:39:46,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:39:46,107 INFO L231 Difference]: Finished difference. Result has 37 places, 36 transitions, 116 flow [2025-02-06 04:39:46,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=37, PETRI_TRANSITIONS=36} [2025-02-06 04:39:46,108 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2025-02-06 04:39:46,108 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 36 transitions, 116 flow [2025-02-06 04:39:46,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-06 04:39:46,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:39:46,109 INFO L206 CegarLoopForPetriNet]: 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] [2025-02-06 04:39:46,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:39:46,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:39:46,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:39:46,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1703795047, now seen corresponding path program 1 times [2025-02-06 04:39:46,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:39:46,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704566948] [2025-02-06 04:39:46,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:39:46,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:39:46,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:39:46,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:39:46,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:39:46,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:39:46,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:39:46,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704566948] [2025-02-06 04:39:46,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704566948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:39:46,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:39:46,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:39:46,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333310433] [2025-02-06 04:39:46,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:39:46,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:39:46,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:39:46,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:39:46,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:39:46,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-02-06 04:39:46,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-06 04:39:46,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:39:46,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-02-06 04:39:46,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:39:46,369 INFO L124 PetriNetUnfolderBase]: 791/1162 cut-off events. [2025-02-06 04:39:46,369 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-02-06 04:39:46,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2586 conditions, 1162 events. 791/1162 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4524 event pairs, 246 based on Foata normal form. 0/1117 useless extension candidates. Maximal degree in co-relation 2562. Up to 576 conditions per place. [2025-02-06 04:39:46,375 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 43 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2025-02-06 04:39:46,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 248 flow [2025-02-06 04:39:46,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:39:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:39:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-02-06 04:39:46,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-02-06 04:39:46,376 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 116 flow. Second operand 4 states and 65 transitions. [2025-02-06 04:39:46,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 248 flow [2025-02-06 04:39:46,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 238 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-06 04:39:46,378 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 127 flow [2025-02-06 04:39:46,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-02-06 04:39:46,379 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2025-02-06 04:39:46,379 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 127 flow [2025-02-06 04:39:46,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-06 04:39:46,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:39:46,379 INFO L206 CegarLoopForPetriNet]: 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] [2025-02-06 04:39:46,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:39:46,380 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:39:46,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:39:46,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2012892907, now seen corresponding path program 1 times [2025-02-06 04:39:46,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:39:46,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156939744] [2025-02-06 04:39:46,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:39:46,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:39:46,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:39:46,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:39:46,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:39:46,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:39:46,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:39:46,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156939744] [2025-02-06 04:39:46,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156939744] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:39:46,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49173537] [2025-02-06 04:39:46,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:39:46,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:39:46,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:39:46,520 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-06 04:39:46,522 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-06 04:39:46,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:39:46,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:39:46,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:39:46,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:46,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:39:46,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:39:46,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:39:46,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:39:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:39:46,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49173537] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:39:46,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:39:46,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-02-06 04:39:46,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895289494] [2025-02-06 04:39:46,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:39:46,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:39:46,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:39:46,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:39:46,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:39:46,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-02-06 04:39:46,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-06 04:39:46,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:39:46,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-02-06 04:39:46,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:39:46,864 INFO L124 PetriNetUnfolderBase]: 847/1272 cut-off events. [2025-02-06 04:39:46,864 INFO L125 PetriNetUnfolderBase]: For 512/512 co-relation queries the response was YES. [2025-02-06 04:39:46,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3171 conditions, 1272 events. 847/1272 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5382 event pairs, 228 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 3141. Up to 666 conditions per place. [2025-02-06 04:39:46,871 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 44 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-02-06 04:39:46,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 277 flow [2025-02-06 04:39:46,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:39:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:39:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-02-06 04:39:46,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4228571428571429 [2025-02-06 04:39:46,873 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 127 flow. Second operand 5 states and 74 transitions. [2025-02-06 04:39:46,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 277 flow [2025-02-06 04:39:46,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:39:46,875 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 146 flow [2025-02-06 04:39:46,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-02-06 04:39:46,876 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2025-02-06 04:39:46,876 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 146 flow [2025-02-06 04:39:46,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-06 04:39:46,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:39:46,876 INFO L206 CegarLoopForPetriNet]: 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] [2025-02-06 04:39:46,883 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-06 04:39:47,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:39:47,077 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:39:47,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:39:47,078 INFO L85 PathProgramCache]: Analyzing trace with hash 631004318, now seen corresponding path program 1 times [2025-02-06 04:39:47,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:39:47,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317720230] [2025-02-06 04:39:47,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:39:47,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:39:47,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 04:39:47,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:39:47,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:39:47,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:39:48,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:39:48,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317720230] [2025-02-06 04:39:48,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317720230] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:39:48,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755149971] [2025-02-06 04:39:48,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:39:48,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:39:48,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:39:48,025 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-06 04:39:48,029 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-06 04:39:48,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 04:39:48,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:39:48,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:39:48,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:48,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 04:39:48,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:39:48,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-06 04:39:48,166 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 15 treesize of output 1 [2025-02-06 04:39:48,203 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 04:39:48,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 04:39:48,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 04:39:48,472 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 04:39:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:39:48,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:40:01,013 INFO L349 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2025-02-06 04:40:01,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1530 treesize of output 1100 [2025-02-06 04:40:01,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:40:01,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 692 treesize of output 640 [2025-02-06 04:40:21,782 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 221 treesize of output 185 [2025-02-06 04:40:21,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:21,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:21,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:21,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:21,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:21,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:21,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:21,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:21,894 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 108 treesize of output 90 [2025-02-06 04:40:21,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:21,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:21,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:21,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:21,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:21,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:21,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:21,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:21,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:21,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,080 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 94 treesize of output 76 [2025-02-06 04:40:22,094 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 126 treesize of output 102 [2025-02-06 04:40:22,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,199 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 83 treesize of output 71 [2025-02-06 04:40:22,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,242 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 173 treesize of output 143 [2025-02-06 04:40:22,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,353 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 217 treesize of output 181 [2025-02-06 04:40:22,371 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 36 treesize of output 30 [2025-02-06 04:40:22,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,458 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 141 treesize of output 117 [2025-02-06 04:40:22,477 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 253 treesize of output 211 [2025-02-06 04:40:22,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:22,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:40:23,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:40:23,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 43 [2025-02-06 04:40:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:27,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755149971] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:40:27,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:40:27,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2025-02-06 04:40:27,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85596177] [2025-02-06 04:40:27,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:40:27,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 04:40:27,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:27,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 04:40:27,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=746, Unknown=4, NotChecked=0, Total=870 [2025-02-06 04:40:31,328 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 [1] [2025-02-06 04:40:35,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:40:35,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2025-02-06 04:40:35,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 146 flow. Second operand has 30 states, 30 states have (on average 6.3) internal successors, (189), 30 states have internal predecessors, (189), 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-06 04:40:35,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:35,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2025-02-06 04:40:35,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:39,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:40:41,386 INFO L124 PetriNetUnfolderBase]: 2584/3696 cut-off events. [2025-02-06 04:40:41,386 INFO L125 PetriNetUnfolderBase]: For 2332/2332 co-relation queries the response was YES. [2025-02-06 04:40:41,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10266 conditions, 3696 events. 2584/3696 cut-off events. For 2332/2332 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 15454 event pairs, 517 based on Foata normal form. 2/3452 useless extension candidates. Maximal degree in co-relation 8365. Up to 1979 conditions per place. [2025-02-06 04:40:41,406 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 141 selfloop transitions, 52 changer transitions 2/196 dead transitions. [2025-02-06 04:40:41,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 196 transitions, 1064 flow [2025-02-06 04:40:41,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 04:40:41,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-06 04:40:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 270 transitions. [2025-02-06 04:40:41,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2025-02-06 04:40:41,411 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 146 flow. Second operand 20 states and 270 transitions. [2025-02-06 04:40:41,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 196 transitions, 1064 flow [2025-02-06 04:40:41,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 196 transitions, 1046 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 04:40:41,420 INFO L231 Difference]: Finished difference. Result has 67 places, 83 transitions, 499 flow [2025-02-06 04:40:41,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=499, PETRI_PLACES=67, PETRI_TRANSITIONS=83} [2025-02-06 04:40:41,422 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 31 predicate places. [2025-02-06 04:40:41,423 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 83 transitions, 499 flow [2025-02-06 04:40:41,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.3) internal successors, (189), 30 states have internal predecessors, (189), 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-06 04:40:41,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:41,423 INFO L206 CegarLoopForPetriNet]: 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] [2025-02-06 04:40:41,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 04:40:41,625 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-06 04:40:41,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:40:41,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:41,626 INFO L85 PathProgramCache]: Analyzing trace with hash -716895094, now seen corresponding path program 2 times [2025-02-06 04:40:41,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:41,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852601953] [2025-02-06 04:40:41,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:40:41,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:41,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-06 04:40:41,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:40:41,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:40:41,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:42,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:42,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852601953] [2025-02-06 04:40:42,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852601953] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:40:42,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765006603] [2025-02-06 04:40:42,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:40:42,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:40:42,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:40:42,464 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-06 04:40:42,469 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-06 04:40:42,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-06 04:40:42,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:40:42,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:40:42,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:42,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 04:40:42,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:40:42,634 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 15 treesize of output 1 [2025-02-06 04:40:42,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:40:42,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-02-06 04:40:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:42,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:40:43,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:40:43,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 240 [2025-02-06 04:40:43,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:40:43,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 104 [2025-02-06 04:40:43,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:40:43,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 68 [2025-02-06 04:40:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:43,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765006603] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:40:43,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:40:43,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2025-02-06 04:40:43,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783686645] [2025-02-06 04:40:43,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:40:43,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 04:40:43,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:43,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 04:40:43,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2025-02-06 04:40:43,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-02-06 04:40:43,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 83 transitions, 499 flow. Second operand has 30 states, 30 states have (on average 8.266666666666667) internal successors, (248), 30 states have internal predecessors, (248), 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-06 04:40:43,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:43,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-02-06 04:40:43,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:45,617 INFO L124 PetriNetUnfolderBase]: 2148/3289 cut-off events. [2025-02-06 04:40:45,618 INFO L125 PetriNetUnfolderBase]: For 4614/4619 co-relation queries the response was YES. [2025-02-06 04:40:45,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10547 conditions, 3289 events. 2148/3289 cut-off events. For 4614/4619 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16229 event pairs, 141 based on Foata normal form. 5/3292 useless extension candidates. Maximal degree in co-relation 9868. Up to 1870 conditions per place. [2025-02-06 04:40:45,640 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 141 selfloop transitions, 68 changer transitions 1/214 dead transitions. [2025-02-06 04:40:45,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 214 transitions, 1446 flow [2025-02-06 04:40:45,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 04:40:45,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 04:40:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 306 transitions. [2025-02-06 04:40:45,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3974025974025974 [2025-02-06 04:40:45,642 INFO L175 Difference]: Start difference. First operand has 67 places, 83 transitions, 499 flow. Second operand 22 states and 306 transitions. [2025-02-06 04:40:45,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 214 transitions, 1446 flow [2025-02-06 04:40:45,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 214 transitions, 1356 flow, removed 44 selfloop flow, removed 1 redundant places. [2025-02-06 04:40:45,654 INFO L231 Difference]: Finished difference. Result has 92 places, 118 transitions, 827 flow [2025-02-06 04:40:45,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=827, PETRI_PLACES=92, PETRI_TRANSITIONS=118} [2025-02-06 04:40:45,656 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 56 predicate places. [2025-02-06 04:40:45,657 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 118 transitions, 827 flow [2025-02-06 04:40:45,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.266666666666667) internal successors, (248), 30 states have internal predecessors, (248), 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-06 04:40:45,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:45,657 INFO L206 CegarLoopForPetriNet]: 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] [2025-02-06 04:40:45,667 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-06 04:40:45,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:40:45,862 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:40:45,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:45,863 INFO L85 PathProgramCache]: Analyzing trace with hash 666809064, now seen corresponding path program 3 times [2025-02-06 04:40:45,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:45,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753312180] [2025-02-06 04:40:45,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:40:45,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:45,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-02-06 04:40:45,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 28 statements. [2025-02-06 04:40:45,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:40:45,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:40:46,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:46,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753312180] [2025-02-06 04:40:46,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753312180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:46,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:46,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 04:40:46,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780732696] [2025-02-06 04:40:46,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:46,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:40:46,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:46,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:40:46,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:40:46,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 04:40:46,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 118 transitions, 827 flow. Second operand has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 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-06 04:40:46,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:46,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 04:40:46,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:46,700 INFO L124 PetriNetUnfolderBase]: 1695/2742 cut-off events. [2025-02-06 04:40:46,700 INFO L125 PetriNetUnfolderBase]: For 6437/6449 co-relation queries the response was YES. [2025-02-06 04:40:46,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9744 conditions, 2742 events. 1695/2742 cut-off events. For 6437/6449 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14258 event pairs, 264 based on Foata normal form. 13/2755 useless extension candidates. Maximal degree in co-relation 9222. Up to 2112 conditions per place. [2025-02-06 04:40:46,717 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 126 selfloop transitions, 73 changer transitions 1/206 dead transitions. [2025-02-06 04:40:46,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 206 transitions, 1798 flow [2025-02-06 04:40:46,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 04:40:46,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 04:40:46,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 185 transitions. [2025-02-06 04:40:46,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4065934065934066 [2025-02-06 04:40:46,719 INFO L175 Difference]: Start difference. First operand has 92 places, 118 transitions, 827 flow. Second operand 13 states and 185 transitions. [2025-02-06 04:40:46,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 206 transitions, 1798 flow [2025-02-06 04:40:46,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 206 transitions, 1682 flow, removed 26 selfloop flow, removed 7 redundant places. [2025-02-06 04:40:46,732 INFO L231 Difference]: Finished difference. Result has 101 places, 164 transitions, 1283 flow [2025-02-06 04:40:46,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1283, PETRI_PLACES=101, PETRI_TRANSITIONS=164} [2025-02-06 04:40:46,733 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 65 predicate places. [2025-02-06 04:40:46,733 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 164 transitions, 1283 flow [2025-02-06 04:40:46,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 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-06 04:40:46,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:46,733 INFO L206 CegarLoopForPetriNet]: 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] [2025-02-06 04:40:46,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:40:46,733 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:40:46,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:46,734 INFO L85 PathProgramCache]: Analyzing trace with hash -375054712, now seen corresponding path program 4 times [2025-02-06 04:40:46,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:46,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018300990] [2025-02-06 04:40:46,734 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:40:46,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:46,740 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-02-06 04:40:46,751 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:40:46,751 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:40:46,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:40:47,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:47,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018300990] [2025-02-06 04:40:47,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018300990] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:40:47,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877512680] [2025-02-06 04:40:47,272 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:40:47,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:40:47,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:40:47,275 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-06 04:40:47,280 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-06 04:40:47,331 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-02-06 04:40:47,354 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:40:47,354 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:40:47,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:47,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 04:40:47,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:40:47,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-06 04:40:47,386 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 15 treesize of output 1 [2025-02-06 04:40:47,407 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 04:40:47,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 04:40:47,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 04:40:47,622 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 04:40:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:47,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:40:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:40:51,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877512680] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:40:51,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:40:51,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2025-02-06 04:40:51,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117491999] [2025-02-06 04:40:51,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:40:51,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 04:40:51,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:51,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 04:40:51,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=604, Unknown=1, NotChecked=0, Total=702 [2025-02-06 04:40:56,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:41:00,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:41:04,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:41:04,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2025-02-06 04:41:04,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 164 transitions, 1283 flow. Second operand has 27 states, 27 states have (on average 6.407407407407407) internal successors, (173), 27 states have internal predecessors, (173), 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-06 04:41:04,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:04,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2025-02-06 04:41:04,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:08,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:41:13,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:41:17,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:41:21,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]