./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:46:14,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:46:14,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:46:14,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:46:14,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:46:14,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:46:14,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:46:14,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:46:14,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:46:14,207 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:46:14,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:46:14,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:46:14,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:46:14,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:46:14,208 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:46:14,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:46:14,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:46:14,208 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:46:14,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:46:14,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:46:14,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:46:14,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:46:14,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:46:14,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:46:14,209 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:46:14,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:46:14,209 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:46:14,210 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:46:14,210 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:46:14,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:46:14,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:46:14,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:46:14,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:46:14,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:46:14,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:46:14,210 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:46:14,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:46:14,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:46:14,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:46:14,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:46:14,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:46:14,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:46:14,211 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:46:14,211 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/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 -> 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 [2025-03-17 06:46:14,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:46:14,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:46:14,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:46:14,452 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:46:14,452 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:46:14,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-03-17 06:46:15,536 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e01148f/924c81aa68fa4330b0aaecac2e107e36/FLAG21cccfb7f [2025-03-17 06:46:15,745 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:46:15,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-03-17 06:46:15,750 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e01148f/924c81aa68fa4330b0aaecac2e107e36/FLAG21cccfb7f [2025-03-17 06:46:16,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e01148f/924c81aa68fa4330b0aaecac2e107e36 [2025-03-17 06:46:16,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:46:16,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:46:16,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:46:16,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:46:16,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:46:16,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:46:16" (1/1) ... [2025-03-17 06:46:16,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f794e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:16, skipping insertion in model container [2025-03-17 06:46:16,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:46:16" (1/1) ... [2025-03-17 06:46:16,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:46:16,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c[2854,2867] [2025-03-17 06:46:16,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:46:16,275 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:46:16,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c[2854,2867] [2025-03-17 06:46:16,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:46:16,303 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:46:16,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:16 WrapperNode [2025-03-17 06:46:16,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:46:16,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:46:16,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:46:16,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:46:16,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:16" (1/1) ... [2025-03-17 06:46:16,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:16" (1/1) ... [2025-03-17 06:46:16,329 INFO L138 Inliner]: procedures = 25, calls = 42, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 210 [2025-03-17 06:46:16,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:46:16,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:46:16,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:46:16,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:46:16,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:16" (1/1) ... [2025-03-17 06:46:16,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:16" (1/1) ... [2025-03-17 06:46:16,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:16" (1/1) ... [2025-03-17 06:46:16,350 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-03-17 06:46:16,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:16" (1/1) ... [2025-03-17 06:46:16,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:16" (1/1) ... [2025-03-17 06:46:16,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:16" (1/1) ... [2025-03-17 06:46:16,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:16" (1/1) ... [2025-03-17 06:46:16,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:16" (1/1) ... [2025-03-17 06:46:16,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:16" (1/1) ... [2025-03-17 06:46:16,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:46:16,369 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:46:16,369 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:46:16,369 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:46:16,369 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:16" (1/1) ... [2025-03-17 06:46:16,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:46:16,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:16,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:46:16,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:46:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:46:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 06:46:16,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 06:46:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 06:46:16,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 06:46:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 06:46:16,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 06:46:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:46:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:46:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:46:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:46:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 06:46:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 06:46:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 06:46:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:46:16,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:46:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:46:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:46:16,408 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:46:16,489 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:46:16,490 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:46:16,788 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:46:16,788 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:46:17,012 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:46:17,013 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:46:17,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:46:17 BoogieIcfgContainer [2025-03-17 06:46:17,013 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:46:17,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:46:17,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:46:17,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:46:17,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:46:16" (1/3) ... [2025-03-17 06:46:17,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487ac4f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:46:17, skipping insertion in model container [2025-03-17 06:46:17,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:16" (2/3) ... [2025-03-17 06:46:17,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487ac4f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:46:17, skipping insertion in model container [2025-03-17 06:46:17,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:46:17" (3/3) ... [2025-03-17 06:46:17,020 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2025-03-17 06:46:17,031 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:46:17,032 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-min.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-17 06:46:17,033 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:46:17,082 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 06:46:17,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 39 transitions, 99 flow [2025-03-17 06:46:17,138 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2025-03-17 06:46:17,140 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 06:46:17,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 7/36 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/28 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-03-17 06:46:17,147 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 39 transitions, 99 flow [2025-03-17 06:46:17,149 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 35 transitions, 88 flow [2025-03-17 06:46:17,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:46:17,169 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;@58cd8d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:46:17,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 06:46:17,183 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:46:17,184 INFO L124 PetriNetUnfolderBase]: 7/34 cut-off events. [2025-03-17 06:46:17,184 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 06:46:17,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:17,184 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] [2025-03-17 06:46:17,185 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-03-17 06:46:17,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:17,189 INFO L85 PathProgramCache]: Analyzing trace with hash 527908694, now seen corresponding path program 1 times [2025-03-17 06:46:17,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:17,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609375324] [2025-03-17 06:46:17,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:17,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:17,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 06:46:17,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 06:46:17,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:17,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:17,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:17,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609375324] [2025-03-17 06:46:17,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609375324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:17,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:17,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:46:17,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298775175] [2025-03-17 06:46:17,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:17,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:46:17,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:17,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:46:17,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:46:17,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-17 06:46:17,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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-03-17 06:46:17,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:17,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-17 06:46:17,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:17,786 INFO L124 PetriNetUnfolderBase]: 431/697 cut-off events. [2025-03-17 06:46:17,786 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-17 06:46:17,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 697 events. 431/697 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2724 event pairs, 284 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 1140. Up to 590 conditions per place. [2025-03-17 06:46:17,796 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 28 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2025-03-17 06:46:17,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 150 flow [2025-03-17 06:46:17,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:46:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:46:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-17 06:46:17,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49572649572649574 [2025-03-17 06:46:17,809 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 88 flow. Second operand 3 states and 58 transitions. [2025-03-17 06:46:17,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 150 flow [2025-03-17 06:46:17,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 138 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 06:46:17,817 INFO L231 Difference]: Finished difference. Result has 35 places, 36 transitions, 88 flow [2025-03-17 06:46:17,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=36} [2025-03-17 06:46:17,822 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2025-03-17 06:46:17,823 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 36 transitions, 88 flow [2025-03-17 06:46:17,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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-03-17 06:46:17,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:17,824 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] [2025-03-17 06:46:17,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:46:17,824 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-03-17 06:46:17,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash -613828163, now seen corresponding path program 1 times [2025-03-17 06:46:17,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:17,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204029783] [2025-03-17 06:46:17,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:17,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:17,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 06:46:17,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 06:46:17,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:17,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:17,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:46:17,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:17,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204029783] [2025-03-17 06:46:17,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204029783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:17,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:17,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:46:17,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817042213] [2025-03-17 06:46:17,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:17,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:46:17,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:17,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:46:17,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:46:17,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-17 06:46:17,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 36 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-03-17 06:46:17,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:17,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-17 06:46:17,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:18,128 INFO L124 PetriNetUnfolderBase]: 431/699 cut-off events. [2025-03-17 06:46:18,129 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-17 06:46:18,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 699 events. 431/699 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2724 event pairs, 284 based on Foata normal form. 0/615 useless extension candidates. Maximal degree in co-relation 1305. Up to 589 conditions per place. [2025-03-17 06:46:18,136 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 26 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2025-03-17 06:46:18,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 156 flow [2025-03-17 06:46:18,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:46:18,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:46:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-03-17 06:46:18,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2025-03-17 06:46:18,137 INFO L175 Difference]: Start difference. First operand has 35 places, 36 transitions, 88 flow. Second operand 4 states and 70 transitions. [2025-03-17 06:46:18,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 156 flow [2025-03-17 06:46:18,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 152 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 06:46:18,138 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 112 flow [2025-03-17 06:46:18,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2025-03-17 06:46:18,139 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2025-03-17 06:46:18,139 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 112 flow [2025-03-17 06:46:18,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-03-17 06:46:18,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:18,139 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] [2025-03-17 06:46:18,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:46:18,139 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-03-17 06:46:18,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:18,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1889536251, now seen corresponding path program 1 times [2025-03-17 06:46:18,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:18,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107835095] [2025-03-17 06:46:18,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:18,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:18,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 06:46:18,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 06:46:18,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:18,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 06:46:18,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:18,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107835095] [2025-03-17 06:46:18,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107835095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:18,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:18,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:46:18,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784850639] [2025-03-17 06:46:18,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:18,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:46:18,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:18,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:46:18,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:46:18,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-17 06:46:18,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-03-17 06:46:18,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:18,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-17 06:46:18,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:18,399 INFO L124 PetriNetUnfolderBase]: 663/1101 cut-off events. [2025-03-17 06:46:18,399 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-17 06:46:18,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2019 conditions, 1101 events. 663/1101 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4622 event pairs, 226 based on Foata normal form. 1/967 useless extension candidates. Maximal degree in co-relation 1999. Up to 459 conditions per place. [2025-03-17 06:46:18,405 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 42 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2025-03-17 06:46:18,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 52 transitions, 235 flow [2025-03-17 06:46:18,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:46:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:46:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-17 06:46:18,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6068376068376068 [2025-03-17 06:46:18,407 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 112 flow. Second operand 3 states and 71 transitions. [2025-03-17 06:46:18,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 52 transitions, 235 flow [2025-03-17 06:46:18,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:46:18,409 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 123 flow [2025-03-17 06:46:18,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2025-03-17 06:46:18,411 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2025-03-17 06:46:18,411 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 123 flow [2025-03-17 06:46:18,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-03-17 06:46:18,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:18,411 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, 1, 1] [2025-03-17 06:46:18,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:46:18,412 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-03-17 06:46:18,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:18,412 INFO L85 PathProgramCache]: Analyzing trace with hash -278953914, now seen corresponding path program 1 times [2025-03-17 06:46:18,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:18,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945011054] [2025-03-17 06:46:18,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:18,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:18,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 06:46:18,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 06:46:18,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:18,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 06:46:18,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:18,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945011054] [2025-03-17 06:46:18,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945011054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:18,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121606406] [2025-03-17 06:46:18,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:18,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:18,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:18,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:46:18,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:46:18,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 06:46:18,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 06:46:18,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:18,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:18,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 06:46:18,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 06:46:18,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:46:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 06:46:18,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121606406] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:46:18,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:46:18,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 06:46:18,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418432776] [2025-03-17 06:46:18,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:46:18,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:46:18,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:18,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:46:18,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:46:18,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-17 06:46:18,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 123 flow. Second operand has 12 states, 12 states have (on average 11.083333333333334) internal successors, (133), 12 states have internal predecessors, (133), 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-03-17 06:46:18,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:18,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-17 06:46:18,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:19,084 INFO L124 PetriNetUnfolderBase]: 1039/1614 cut-off events. [2025-03-17 06:46:19,085 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-17 06:46:19,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3220 conditions, 1614 events. 1039/1614 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6470 event pairs, 506 based on Foata normal form. 0/1369 useless extension candidates. Maximal degree in co-relation 2435. Up to 877 conditions per place. [2025-03-17 06:46:19,093 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 37 selfloop transitions, 10 changer transitions 41/93 dead transitions. [2025-03-17 06:46:19,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 93 transitions, 457 flow [2025-03-17 06:46:19,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:46:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 06:46:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2025-03-17 06:46:19,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4307692307692308 [2025-03-17 06:46:19,096 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 123 flow. Second operand 10 states and 168 transitions. [2025-03-17 06:46:19,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 93 transitions, 457 flow [2025-03-17 06:46:19,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 93 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:46:19,099 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 179 flow [2025-03-17 06:46:19,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=179, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2025-03-17 06:46:19,100 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2025-03-17 06:46:19,100 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 179 flow [2025-03-17 06:46:19,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.083333333333334) internal successors, (133), 12 states have internal predecessors, (133), 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-03-17 06:46:19,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:19,100 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:19,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 06:46:19,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:19,301 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-03-17 06:46:19,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:19,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1948231225, now seen corresponding path program 2 times [2025-03-17 06:46:19,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:19,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486325609] [2025-03-17 06:46:19,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:46:19,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:19,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-17 06:46:19,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 33 statements. [2025-03-17 06:46:19,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:46:19,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:19,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 06:46:19,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:19,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486325609] [2025-03-17 06:46:19,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486325609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:19,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:19,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:46:19,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059151684] [2025-03-17 06:46:19,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:19,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:46:19,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:19,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:46:19,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:46:19,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-17 06:46:19,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-03-17 06:46:19,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:19,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-17 06:46:19,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:19,627 INFO L124 PetriNetUnfolderBase]: 1355/2058 cut-off events. [2025-03-17 06:46:19,628 INFO L125 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2025-03-17 06:46:19,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4395 conditions, 2058 events. 1355/2058 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9546 event pairs, 550 based on Foata normal form. 13/1835 useless extension candidates. Maximal degree in co-relation 4359. Up to 1082 conditions per place. [2025-03-17 06:46:19,636 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 67 selfloop transitions, 3 changer transitions 14/89 dead transitions. [2025-03-17 06:46:19,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 89 transitions, 475 flow [2025-03-17 06:46:19,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:46:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:46:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-03-17 06:46:19,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5948717948717949 [2025-03-17 06:46:19,639 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 179 flow. Second operand 5 states and 116 transitions. [2025-03-17 06:46:19,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 89 transitions, 475 flow [2025-03-17 06:46:19,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 89 transitions, 443 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-03-17 06:46:19,647 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 177 flow [2025-03-17 06:46:19,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2025-03-17 06:46:19,648 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2025-03-17 06:46:19,648 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 177 flow [2025-03-17 06:46:19,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-03-17 06:46:19,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:19,649 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:19,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:46:19,649 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-03-17 06:46:19,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:19,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1623128301, now seen corresponding path program 3 times [2025-03-17 06:46:19,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:19,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686509941] [2025-03-17 06:46:19,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:46:19,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:19,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-03-17 06:46:19,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 06:46:19,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 06:46:19,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 06:46:19,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:19,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686509941] [2025-03-17 06:46:19,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686509941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:19,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:19,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:46:19,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216078962] [2025-03-17 06:46:19,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:19,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:46:19,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:19,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:46:19,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:46:19,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-17 06:46:19,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-03-17 06:46:19,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:19,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-17 06:46:19,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:20,072 INFO L124 PetriNetUnfolderBase]: 2303/3613 cut-off events. [2025-03-17 06:46:20,073 INFO L125 PetriNetUnfolderBase]: For 1939/1939 co-relation queries the response was YES. [2025-03-17 06:46:20,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8662 conditions, 3613 events. 2303/3613 cut-off events. For 1939/1939 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 19144 event pairs, 992 based on Foata normal form. 14/3366 useless extension candidates. Maximal degree in co-relation 8629. Up to 1828 conditions per place. [2025-03-17 06:46:20,086 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 71 selfloop transitions, 3 changer transitions 13/92 dead transitions. [2025-03-17 06:46:20,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 92 transitions, 522 flow [2025-03-17 06:46:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:46:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:46:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-17 06:46:20,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2025-03-17 06:46:20,088 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 177 flow. Second operand 5 states and 111 transitions. [2025-03-17 06:46:20,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 92 transitions, 522 flow [2025-03-17 06:46:20,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 92 transitions, 500 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-03-17 06:46:20,096 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 193 flow [2025-03-17 06:46:20,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2025-03-17 06:46:20,096 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2025-03-17 06:46:20,096 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 193 flow [2025-03-17 06:46:20,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-03-17 06:46:20,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:20,096 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:20,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:46:20,097 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-03-17 06:46:20,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:20,097 INFO L85 PathProgramCache]: Analyzing trace with hash -722786377, now seen corresponding path program 4 times [2025-03-17 06:46:20,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:20,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528046326] [2025-03-17 06:46:20,097 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:46:20,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:20,106 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-17 06:46:20,108 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 33 statements. [2025-03-17 06:46:20,108 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 06:46:20,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:20,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 06:46:20,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:20,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528046326] [2025-03-17 06:46:20,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528046326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:20,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:20,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:46:20,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363697262] [2025-03-17 06:46:20,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:20,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:46:20,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:20,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:46:20,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:46:20,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-17 06:46:20,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-03-17 06:46:20,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:20,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-17 06:46:20,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:20,626 INFO L124 PetriNetUnfolderBase]: 3107/4795 cut-off events. [2025-03-17 06:46:20,627 INFO L125 PetriNetUnfolderBase]: For 3395/3395 co-relation queries the response was YES. [2025-03-17 06:46:20,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12253 conditions, 4795 events. 3107/4795 cut-off events. For 3395/3395 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 26079 event pairs, 890 based on Foata normal form. 46/4485 useless extension candidates. Maximal degree in co-relation 12218. Up to 2234 conditions per place. [2025-03-17 06:46:20,646 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 102 selfloop transitions, 16 changer transitions 0/123 dead transitions. [2025-03-17 06:46:20,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 123 transitions, 719 flow [2025-03-17 06:46:20,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:46:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:46:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2025-03-17 06:46:20,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5096153846153846 [2025-03-17 06:46:20,648 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 193 flow. Second operand 8 states and 159 transitions. [2025-03-17 06:46:20,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 123 transitions, 719 flow [2025-03-17 06:46:20,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 123 transitions, 699 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-17 06:46:20,656 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 301 flow [2025-03-17 06:46:20,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=301, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2025-03-17 06:46:20,657 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2025-03-17 06:46:20,657 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 301 flow [2025-03-17 06:46:20,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-03-17 06:46:20,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:20,657 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:20,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:46:20,657 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-03-17 06:46:20,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:20,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2140729205, now seen corresponding path program 5 times [2025-03-17 06:46:20,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:20,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601932516] [2025-03-17 06:46:20,658 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:46:20,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:20,671 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-17 06:46:20,681 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 06:46:20,681 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:46:20,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 06:46:20,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:20,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601932516] [2025-03-17 06:46:20,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601932516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:20,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013443288] [2025-03-17 06:46:20,785 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:46:20,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:20,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:20,787 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:46:20,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:46:20,848 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-17 06:46:20,881 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 06:46:20,882 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:46:20,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:20,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 06:46:20,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:20,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 06:46:20,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:46:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 06:46:20,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013443288] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:20,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:46:20,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-17 06:46:20,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089165610] [2025-03-17 06:46:20,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:20,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:46:20,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:20,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:46:20,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:46:21,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-17 06:46:21,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 301 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-03-17 06:46:21,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:21,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-17 06:46:21,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:21,371 INFO L124 PetriNetUnfolderBase]: 3120/4852 cut-off events. [2025-03-17 06:46:21,371 INFO L125 PetriNetUnfolderBase]: For 7357/7431 co-relation queries the response was YES. [2025-03-17 06:46:21,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13514 conditions, 4852 events. 3120/4852 cut-off events. For 7357/7431 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 26384 event pairs, 777 based on Foata normal form. 156/4762 useless extension candidates. Maximal degree in co-relation 13477. Up to 2585 conditions per place. [2025-03-17 06:46:21,399 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 75 selfloop transitions, 7 changer transitions 0/87 dead transitions. [2025-03-17 06:46:21,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 87 transitions, 623 flow [2025-03-17 06:46:21,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:46:21,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:46:21,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2025-03-17 06:46:21,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4017094017094017 [2025-03-17 06:46:21,400 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 301 flow. Second operand 6 states and 94 transitions. [2025-03-17 06:46:21,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 87 transitions, 623 flow [2025-03-17 06:46:21,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 87 transitions, 591 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-17 06:46:21,413 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 302 flow [2025-03-17 06:46:21,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2025-03-17 06:46:21,415 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 26 predicate places. [2025-03-17 06:46:21,415 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 302 flow [2025-03-17 06:46:21,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-03-17 06:46:21,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:21,415 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:21,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 06:46:21,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-17 06:46:21,616 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:46:21,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:21,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1252895154, now seen corresponding path program 1 times [2025-03-17 06:46:21,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:21,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581930531] [2025-03-17 06:46:21,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:21,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:21,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 06:46:21,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 06:46:21,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:21,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 06:46:21,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:21,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581930531] [2025-03-17 06:46:21,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581930531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:21,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353994900] [2025-03-17 06:46:21,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:21,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:21,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:21,738 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:46:21,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:46:21,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 06:46:21,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 06:46:21,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:21,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:21,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 06:46:21,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 06:46:21,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:46:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 06:46:21,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353994900] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:21,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:46:21,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-17 06:46:21,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323837813] [2025-03-17 06:46:21,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:21,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:46:21,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:21,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:46:21,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:46:21,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-17 06:46:21,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-03-17 06:46:21,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:21,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-17 06:46:21,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:22,205 INFO L124 PetriNetUnfolderBase]: 1550/2480 cut-off events. [2025-03-17 06:46:22,205 INFO L125 PetriNetUnfolderBase]: For 4492/4521 co-relation queries the response was YES. [2025-03-17 06:46:22,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7278 conditions, 2480 events. 1550/2480 cut-off events. For 4492/4521 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12448 event pairs, 599 based on Foata normal form. 220/2626 useless extension candidates. Maximal degree in co-relation 7237. Up to 1533 conditions per place. [2025-03-17 06:46:22,222 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 52 selfloop transitions, 9 changer transitions 0/68 dead transitions. [2025-03-17 06:46:22,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 68 transitions, 437 flow [2025-03-17 06:46:22,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:46:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:46:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2025-03-17 06:46:22,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43162393162393164 [2025-03-17 06:46:22,223 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 302 flow. Second operand 6 states and 101 transitions. [2025-03-17 06:46:22,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 68 transitions, 437 flow [2025-03-17 06:46:22,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 68 transitions, 423 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-17 06:46:22,231 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 271 flow [2025-03-17 06:46:22,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2025-03-17 06:46:22,232 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 26 predicate places. [2025-03-17 06:46:22,233 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 271 flow [2025-03-17 06:46:22,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-03-17 06:46:22,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:22,233 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:22,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 06:46:22,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:22,434 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:46:22,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:22,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1336482996, now seen corresponding path program 1 times [2025-03-17 06:46:22,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:22,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842667563] [2025-03-17 06:46:22,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:22,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:22,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 06:46:22,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 06:46:22,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:22,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:46:24,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:24,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842667563] [2025-03-17 06:46:24,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842667563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:24,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308205389] [2025-03-17 06:46:24,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:24,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:24,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:24,481 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:46:24,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 06:46:24,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 06:46:24,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 06:46:24,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:24,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:24,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 06:46:24,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:24,585 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-03-17 06:46:24,616 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 06:46:24,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 06:46:24,659 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-17 06:46:24,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-03-17 06:46:24,953 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2025-03-17 06:46:24,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 55 [2025-03-17 06:46:32,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:46:32,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 408 treesize of output 1830