./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-more-array-sum.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 e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:35:00,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:35:00,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:35:00,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:35:00,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:35:00,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:35:00,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:35:00,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:35:00,806 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:35:00,806 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:35:00,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:35:00,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:35:00,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:35:00,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:35:00,807 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:35:00,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:35:00,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:35:00,808 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:35:00,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:35:00,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:35:00,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:35:00,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:35:00,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:35:00,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:35:00,808 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:35:00,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:35:00,808 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:35:00,808 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:35:00,809 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:35:00,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:35:00,809 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:35:00,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:35:00,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:35:00,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:35:00,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:35:00,809 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:35:00,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:35:00,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:35:00,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:35:00,810 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:35:00,810 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:35:00,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:35:00,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:35:00,810 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 -> e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 [2025-03-08 17:35:01,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:35:01,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:35:01,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:35:01,039 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:35:01,040 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:35:01,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-03-08 17:35:02,195 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1adb9f40a/895dc765a2a649de98bb6662a8a3bdc2/FLAG56937a161 [2025-03-08 17:35:02,406 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:35:02,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-03-08 17:35:02,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1adb9f40a/895dc765a2a649de98bb6662a8a3bdc2/FLAG56937a161 [2025-03-08 17:35:02,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1adb9f40a/895dc765a2a649de98bb6662a8a3bdc2 [2025-03-08 17:35:02,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:35:02,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:35:02,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:35:02,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:35:02,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:35:02,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:35:02" (1/1) ... [2025-03-08 17:35:02,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d5931dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:02, skipping insertion in model container [2025-03-08 17:35:02,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:35:02" (1/1) ... [2025-03-08 17:35:02,452 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:35:02,561 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-more-array-sum.wvr.c[2423,2436] [2025-03-08 17:35:02,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:35:02,575 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:35:02,588 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-more-array-sum.wvr.c[2423,2436] [2025-03-08 17:35:02,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:35:02,599 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:35:02,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:02 WrapperNode [2025-03-08 17:35:02,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:35:02,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:35:02,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:35:02,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:35:02,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:02" (1/1) ... [2025-03-08 17:35:02,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:02" (1/1) ... [2025-03-08 17:35:02,638 INFO L138 Inliner]: procedures = 22, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 249 [2025-03-08 17:35:02,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:35:02,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:35:02,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:35:02,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:35:02,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:02" (1/1) ... [2025-03-08 17:35:02,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:02" (1/1) ... [2025-03-08 17:35:02,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:02" (1/1) ... [2025-03-08 17:35:02,666 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-08 17:35:02,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:02" (1/1) ... [2025-03-08 17:35:02,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:02" (1/1) ... [2025-03-08 17:35:02,673 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:02" (1/1) ... [2025-03-08 17:35:02,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:02" (1/1) ... [2025-03-08 17:35:02,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:02" (1/1) ... [2025-03-08 17:35:02,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:02" (1/1) ... [2025-03-08 17:35:02,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:35:02,681 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:35:02,681 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:35:02,681 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:35:02,682 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:02" (1/1) ... [2025-03-08 17:35:02,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:35:02,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:35:02,709 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-08 17:35:02,711 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-08 17:35:02,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:35:02,725 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:35:02,725 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:35:02,725 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:35:02,725 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:35:02,725 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 17:35:02,725 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 17:35:02,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:35:02,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:35:02,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:35:02,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:35:02,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 17:35:02,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:35:02,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:35:02,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:35:02,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:35:02,726 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:35:02,806 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:35:02,807 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:35:03,115 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:35:03,115 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:35:03,413 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:35:03,413 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:35:03,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:35:03 BoogieIcfgContainer [2025-03-08 17:35:03,414 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:35:03,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:35:03,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:35:03,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:35:03,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:35:02" (1/3) ... [2025-03-08 17:35:03,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b34b938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:35:03, skipping insertion in model container [2025-03-08 17:35:03,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:02" (2/3) ... [2025-03-08 17:35:03,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b34b938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:35:03, skipping insertion in model container [2025-03-08 17:35:03,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:35:03" (3/3) ... [2025-03-08 17:35:03,423 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2025-03-08 17:35:03,436 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:35:03,437 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum.wvr.c that has 4 procedures, 29 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-08 17:35:03,437 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:35:03,485 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 17:35:03,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 87 flow [2025-03-08 17:35:03,535 INFO L124 PetriNetUnfolderBase]: 5/30 cut-off events. [2025-03-08 17:35:03,537 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:35:03,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 5/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 27 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-03-08 17:35:03,542 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 33 transitions, 87 flow [2025-03-08 17:35:03,544 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 29 transitions, 76 flow [2025-03-08 17:35:03,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:35:03,561 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;@692beb2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:35:03,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 17:35:03,575 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:35:03,575 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2025-03-08 17:35:03,575 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:35:03,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:35:03,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:35:03,576 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-08 17:35:03,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:35:03,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1915494120, now seen corresponding path program 1 times [2025-03-08 17:35:03,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:35:03,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316779537] [2025-03-08 17:35:03,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:35:03,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:35:03,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 17:35:03,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 17:35:03,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:35:03,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:35:03,845 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-08 17:35:03,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:35:03,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316779537] [2025-03-08 17:35:03,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316779537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:35:03,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:35:03,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:35:03,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159251313] [2025-03-08 17:35:03,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:35:03,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:35:03,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:35:03,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:35:03,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:35:03,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-08 17:35:03,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:35:03,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:35:03,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-08 17:35:03,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:35:04,102 INFO L124 PetriNetUnfolderBase]: 818/1181 cut-off events. [2025-03-08 17:35:04,103 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-03-08 17:35:04,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2482 conditions, 1181 events. 818/1181 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4425 event pairs, 226 based on Foata normal form. 1/936 useless extension candidates. Maximal degree in co-relation 2122. Up to 803 conditions per place. [2025-03-08 17:35:04,112 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 42 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2025-03-08 17:35:04,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 223 flow [2025-03-08 17:35:04,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:35:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:35:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-03-08 17:35:04,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-03-08 17:35:04,124 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 76 flow. Second operand 3 states and 60 transitions. [2025-03-08 17:35:04,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 223 flow [2025-03-08 17:35:04,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 48 transitions, 201 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 17:35:04,131 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 90 flow [2025-03-08 17:35:04,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2025-03-08 17:35:04,136 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2025-03-08 17:35:04,136 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 90 flow [2025-03-08 17:35:04,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:35:04,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:35:04,136 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-08 17:35:04,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:35:04,136 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-08 17:35:04,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:35:04,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1071297909, now seen corresponding path program 1 times [2025-03-08 17:35:04,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:35:04,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482800591] [2025-03-08 17:35:04,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:35:04,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:35:04,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 17:35:04,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 17:35:04,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:35:04,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:35:04,323 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-08 17:35:04,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:35:04,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482800591] [2025-03-08 17:35:04,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482800591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:35:04,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:35:04,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:35:04,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621274419] [2025-03-08 17:35:04,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:35:04,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:35:04,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:35:04,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:35:04,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:35:04,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-08 17:35:04,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-08 17:35:04,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:35:04,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-08 17:35:04,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:35:04,517 INFO L124 PetriNetUnfolderBase]: 819/1186 cut-off events. [2025-03-08 17:35:04,518 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2025-03-08 17:35:04,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2758 conditions, 1186 events. 819/1186 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4186 event pairs, 577 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 780. Up to 1181 conditions per place. [2025-03-08 17:35:04,526 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 29 selfloop transitions, 4 changer transitions 3/37 dead transitions. [2025-03-08 17:35:04,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 172 flow [2025-03-08 17:35:04,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:35:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:35:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2025-03-08 17:35:04,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2025-03-08 17:35:04,528 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 90 flow. Second operand 5 states and 56 transitions. [2025-03-08 17:35:04,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 172 flow [2025-03-08 17:35:04,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:35:04,531 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 114 flow [2025-03-08 17:35:04,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2025-03-08 17:35:04,532 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2025-03-08 17:35:04,532 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 114 flow [2025-03-08 17:35:04,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-08 17:35:04,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:35:04,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:35:04,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:35:04,532 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-08 17:35:04,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:35:04,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1022037181, now seen corresponding path program 1 times [2025-03-08 17:35:04,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:35:04,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569467296] [2025-03-08 17:35:04,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:35:04,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:35:04,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 17:35:04,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:35:04,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:35:04,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:35:04,632 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-08 17:35:04,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:35:04,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569467296] [2025-03-08 17:35:04,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569467296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:35:04,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:35:04,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:35:04,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530394423] [2025-03-08 17:35:04,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:35:04,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:35:04,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:35:04,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:35:04,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:35:04,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-08 17:35:04,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:35:04,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:35:04,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-08 17:35:04,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:35:04,793 INFO L124 PetriNetUnfolderBase]: 830/1199 cut-off events. [2025-03-08 17:35:04,794 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2025-03-08 17:35:04,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2696 conditions, 1199 events. 830/1199 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4165 event pairs, 270 based on Foata normal form. 0/1088 useless extension candidates. Maximal degree in co-relation 2671. Up to 618 conditions per place. [2025-03-08 17:35:04,799 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 43 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2025-03-08 17:35:04,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 246 flow [2025-03-08 17:35:04,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:35:04,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:35:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-03-08 17:35:04,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-03-08 17:35:04,801 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 114 flow. Second operand 4 states and 57 transitions. [2025-03-08 17:35:04,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 246 flow [2025-03-08 17:35:04,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 234 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-08 17:35:04,802 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 123 flow [2025-03-08 17:35:04,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-03-08 17:35:04,803 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2025-03-08 17:35:04,804 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 123 flow [2025-03-08 17:35:04,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:35:04,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:35:04,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:35:04,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:35:04,805 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-08 17:35:04,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:35:04,806 INFO L85 PathProgramCache]: Analyzing trace with hash 266988034, now seen corresponding path program 1 times [2025-03-08 17:35:04,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:35:04,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870349470] [2025-03-08 17:35:04,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:35:04,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:35:04,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:35:04,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:35:04,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:35:04,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:35:04,919 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-08 17:35:04,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:35:04,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870349470] [2025-03-08 17:35:04,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870349470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:35:04,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036135517] [2025-03-08 17:35:04,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:35:04,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:35:04,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:35:04,922 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-08 17:35:04,923 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-08 17:35:04,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:35:04,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:35:04,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:35:04,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:35:04,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 17:35:05,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:35:05,056 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-08 17:35:05,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:35:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:35:05,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036135517] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:35:05,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:35:05,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-08 17:35:05,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333865732] [2025-03-08 17:35:05,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:35:05,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:35:05,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:35:05,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:35:05,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:35:05,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-08 17:35:05,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-08 17:35:05,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:35:05,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-08 17:35:05,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:35:05,273 INFO L124 PetriNetUnfolderBase]: 881/1265 cut-off events. [2025-03-08 17:35:05,273 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2025-03-08 17:35:05,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3290 conditions, 1265 events. 881/1265 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4550 event pairs, 411 based on Foata normal form. 98/1284 useless extension candidates. Maximal degree in co-relation 3260. Up to 931 conditions per place. [2025-03-08 17:35:05,282 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 48 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-03-08 17:35:05,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 295 flow [2025-03-08 17:35:05,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:35:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:35:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-03-08 17:35:05,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-08 17:35:05,285 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 123 flow. Second operand 5 states and 66 transitions. [2025-03-08 17:35:05,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 295 flow [2025-03-08 17:35:05,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:35:05,290 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 140 flow [2025-03-08 17:35:05,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2025-03-08 17:35:05,290 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2025-03-08 17:35:05,291 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 140 flow [2025-03-08 17:35:05,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-08 17:35:05,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:35:05,291 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] [2025-03-08 17:35:05,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 17:35:05,496 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-08 17:35:05,496 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-08 17:35:05,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:35:05,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1715171265, now seen corresponding path program 1 times [2025-03-08 17:35:05,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:35:05,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667174472] [2025-03-08 17:35:05,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:35:05,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:35:05,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 17:35:05,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:35:05,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:35:05,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:35:06,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:35:06,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:35:06,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667174472] [2025-03-08 17:35:06,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667174472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:35:06,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396631372] [2025-03-08 17:35:06,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:35:06,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:35:06,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:35:06,445 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-08 17:35:06,447 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-08 17:35:06,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 17:35:06,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:35:06,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:35:06,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:35:06,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 17:35:06,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:35:06,562 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-08 17:35:06,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:35:06,640 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 17:35:06,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 17:35:06,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:35:06,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 17:35:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:35:06,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:35:19,860 INFO L349 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2025-03-08 17:35:19,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1610 treesize of output 1180 [2025-03-08 17:35:19,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:35:19,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 640 treesize of output 598 [2025-03-08 17:35:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:35:26,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396631372] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:35:26,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:35:26,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-08 17:35:26,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582475868] [2025-03-08 17:35:26,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:35:26,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 17:35:26,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:35:26,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 17:35:26,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=642, Unknown=3, NotChecked=0, Total=756 [2025-03-08 17:35:26,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-08 17:35:26,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 140 flow. Second operand has 28 states, 28 states have (on average 6.178571428571429) internal successors, (173), 28 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:35:26,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:35:26,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-08 17:35:26,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:35:30,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 17:35:48,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 17:36:01,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 17:36:05,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 17:36:09,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 17:36:14,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 17:36:18,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 17:36:23,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 17:36:23,281 INFO L124 PetriNetUnfolderBase]: 1968/2832 cut-off events. [2025-03-08 17:36:23,282 INFO L125 PetriNetUnfolderBase]: For 1979/1979 co-relation queries the response was YES. [2025-03-08 17:36:23,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8052 conditions, 2832 events. 1968/2832 cut-off events. For 1979/1979 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 11612 event pairs, 233 based on Foata normal form. 2/2643 useless extension candidates. Maximal degree in co-relation 5941. Up to 1465 conditions per place. [2025-03-08 17:36:23,293 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 137 selfloop transitions, 48 changer transitions 2/188 dead transitions. [2025-03-08 17:36:23,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 188 transitions, 1023 flow [2025-03-08 17:36:23,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 17:36:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-08 17:36:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 259 transitions. [2025-03-08 17:36:23,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4130781499202552 [2025-03-08 17:36:23,297 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 140 flow. Second operand 19 states and 259 transitions. [2025-03-08 17:36:23,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 188 transitions, 1023 flow [2025-03-08 17:36:23,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 188 transitions, 1003 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-08 17:36:23,303 INFO L231 Difference]: Finished difference. Result has 65 places, 78 transitions, 488 flow [2025-03-08 17:36:23,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=488, PETRI_PLACES=65, PETRI_TRANSITIONS=78} [2025-03-08 17:36:23,305 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2025-03-08 17:36:23,305 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 78 transitions, 488 flow [2025-03-08 17:36:23,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.178571428571429) internal successors, (173), 28 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:36:23,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:23,306 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] [2025-03-08 17:36:23,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 17:36:23,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:23,507 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-08 17:36:23,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:23,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2134543719, now seen corresponding path program 2 times [2025-03-08 17:36:23,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:23,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704607430] [2025-03-08 17:36:23,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:36:23,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:23,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 17:36:23,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:36:23,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:36:23,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:24,030 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-08 17:36:24,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:24,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704607430] [2025-03-08 17:36:24,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704607430] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:36:24,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792336967] [2025-03-08 17:36:24,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:36:24,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:24,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:36:24,033 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-08 17:36:24,034 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-08 17:36:24,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 17:36:24,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:36:24,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:36:24,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:24,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 17:36:24,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:36:24,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:36:24,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:36:24,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-03-08 17:36:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:36:24,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:36:24,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:36:24,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2025-03-08 17:36:24,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:36:24,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2025-03-08 17:36:24,896 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 17:36:24,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 283 treesize of output 238 [2025-03-08 17:36:24,905 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:36:24,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 92 [2025-03-08 17:36:24,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:36:24,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 369 treesize of output 313 [2025-03-08 17:36:24,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:36:24,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 192 [2025-03-08 17:36:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:36:25,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792336967] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:36:25,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:36:25,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 21 [2025-03-08 17:36:25,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432326814] [2025-03-08 17:36:25,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:36:25,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 17:36:25,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:25,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 17:36:25,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-03-08 17:36:25,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-08 17:36:25,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 78 transitions, 488 flow. Second operand has 22 states, 22 states have (on average 6.454545454545454) internal successors, (142), 22 states have internal predecessors, (142), 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-08 17:36:25,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:25,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-08 17:36:25,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:26,501 INFO L124 PetriNetUnfolderBase]: 2562/3703 cut-off events. [2025-03-08 17:36:26,502 INFO L125 PetriNetUnfolderBase]: For 4487/4487 co-relation queries the response was YES. [2025-03-08 17:36:26,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12268 conditions, 3703 events. 2562/3703 cut-off events. For 4487/4487 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16258 event pairs, 490 based on Foata normal form. 1/3490 useless extension candidates. Maximal degree in co-relation 11355. Up to 2508 conditions per place. [2025-03-08 17:36:26,518 INFO L140 encePairwiseOnDemand]: 17/33 looper letters, 144 selfloop transitions, 106 changer transitions 1/252 dead transitions. [2025-03-08 17:36:26,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 252 transitions, 1818 flow [2025-03-08 17:36:26,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 17:36:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-08 17:36:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 275 transitions. [2025-03-08 17:36:26,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2025-03-08 17:36:26,522 INFO L175 Difference]: Start difference. First operand has 65 places, 78 transitions, 488 flow. Second operand 24 states and 275 transitions. [2025-03-08 17:36:26,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 252 transitions, 1818 flow [2025-03-08 17:36:26,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 252 transitions, 1752 flow, removed 29 selfloop flow, removed 2 redundant places. [2025-03-08 17:36:26,536 INFO L231 Difference]: Finished difference. Result has 103 places, 161 transitions, 1353 flow [2025-03-08 17:36:26,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1353, PETRI_PLACES=103, PETRI_TRANSITIONS=161} [2025-03-08 17:36:26,537 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 69 predicate places. [2025-03-08 17:36:26,537 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 161 transitions, 1353 flow [2025-03-08 17:36:26,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.454545454545454) internal successors, (142), 22 states have internal predecessors, (142), 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-08 17:36:26,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:26,538 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] [2025-03-08 17:36:26,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 17:36:26,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:26,739 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-08 17:36:26,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:26,739 INFO L85 PathProgramCache]: Analyzing trace with hash 764666973, now seen corresponding path program 3 times [2025-03-08 17:36:26,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:26,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707613248] [2025-03-08 17:36:26,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:36:26,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:26,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-08 17:36:26,767 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:36:26,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 17:36:26,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:27,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:27,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707613248] [2025-03-08 17:36:27,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707613248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:36:27,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537568748] [2025-03-08 17:36:27,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:36:27,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:27,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:36:27,665 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-08 17:36:27,666 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-08 17:36:27,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-08 17:36:27,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:36:27,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 17:36:27,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:27,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 17:36:27,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:36:27,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:36:28,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:36:28,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-03-08 17:36:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:28,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:36:28,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:36:28,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 240 [2025-03-08 17:36:28,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:36:28,758 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 156 treesize of output 144 [2025-03-08 17:36:28,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:36:28,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 211 [2025-03-08 17:36:28,921 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 17:36:28,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:36:28,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 104 [2025-03-08 17:36:28,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:36:28,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 72 [2025-03-08 17:36:29,053 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 17:36:29,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 300 treesize of output 255 [2025-03-08 17:36:29,060 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:36:29,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 188 [2025-03-08 17:36:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:29,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537568748] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:36:29,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:36:29,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2025-03-08 17:36:29,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988928645] [2025-03-08 17:36:29,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:36:29,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 17:36:29,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:29,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 17:36:29,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2025-03-08 17:36:29,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-08 17:36:29,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 161 transitions, 1353 flow. Second operand has 30 states, 30 states have (on average 5.933333333333334) internal successors, (178), 30 states have internal predecessors, (178), 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-08 17:36:29,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:29,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-08 17:36:29,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:31,087 INFO L124 PetriNetUnfolderBase]: 3244/4674 cut-off events. [2025-03-08 17:36:31,089 INFO L125 PetriNetUnfolderBase]: For 20647/20647 co-relation queries the response was YES. [2025-03-08 17:36:31,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22058 conditions, 4674 events. 3244/4674 cut-off events. For 20647/20647 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 21516 event pairs, 680 based on Foata normal form. 13/4687 useless extension candidates. Maximal degree in co-relation 20972. Up to 3375 conditions per place. [2025-03-08 17:36:31,147 INFO L140 encePairwiseOnDemand]: 17/33 looper letters, 186 selfloop transitions, 191 changer transitions 1/379 dead transitions. [2025-03-08 17:36:31,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 379 transitions, 3818 flow [2025-03-08 17:36:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 17:36:31,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-08 17:36:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 290 transitions. [2025-03-08 17:36:31,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3515151515151515 [2025-03-08 17:36:31,149 INFO L175 Difference]: Start difference. First operand has 103 places, 161 transitions, 1353 flow. Second operand 25 states and 290 transitions. [2025-03-08 17:36:31,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 379 transitions, 3818 flow [2025-03-08 17:36:31,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 379 transitions, 3586 flow, removed 53 selfloop flow, removed 2 redundant places. [2025-03-08 17:36:31,187 INFO L231 Difference]: Finished difference. Result has 136 places, 278 transitions, 2874 flow [2025-03-08 17:36:31,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2874, PETRI_PLACES=136, PETRI_TRANSITIONS=278} [2025-03-08 17:36:31,187 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 102 predicate places. [2025-03-08 17:36:31,188 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 278 transitions, 2874 flow [2025-03-08 17:36:31,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.933333333333334) internal successors, (178), 30 states have internal predecessors, (178), 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-08 17:36:31,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:31,188 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] [2025-03-08 17:36:31,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 17:36:31,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:31,388 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-08 17:36:31,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:31,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1751657719, now seen corresponding path program 4 times [2025-03-08 17:36:31,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:31,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312953975] [2025-03-08 17:36:31,389 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:36:31,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:31,395 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-08 17:36:31,418 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:36:31,418 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:36:31,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:32,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:32,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312953975] [2025-03-08 17:36:32,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312953975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:36:32,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977306879] [2025-03-08 17:36:32,039 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:36:32,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:32,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:36:32,041 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:36:32,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 17:36:32,088 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-08 17:36:32,110 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:36:32,110 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:36:32,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:32,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 17:36:32,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:36:32,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:36:32,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:36:32,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2025-03-08 17:36:32,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:36:32,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:36:32,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:36:32,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 240 [2025-03-08 17:36:32,975 INFO L349 Elim1Store]: treesize reduction 8, result has 70.4 percent of original size [2025-03-08 17:36:32,975 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 117 treesize of output 81 [2025-03-08 17:36:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:36:33,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977306879] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:36:33,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:36:33,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 29 [2025-03-08 17:36:33,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766402922] [2025-03-08 17:36:33,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:36:33,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 17:36:33,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:33,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 17:36:33,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2025-03-08 17:36:33,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-08 17:36:33,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 278 transitions, 2874 flow. Second operand has 30 states, 30 states have (on average 6.1) internal successors, (183), 30 states have internal predecessors, (183), 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-08 17:36:33,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:33,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-08 17:36:33,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:34,923 INFO L124 PetriNetUnfolderBase]: 3524/5075 cut-off events. [2025-03-08 17:36:34,923 INFO L125 PetriNetUnfolderBase]: For 33065/33065 co-relation queries the response was YES. [2025-03-08 17:36:34,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27273 conditions, 5075 events. 3524/5075 cut-off events. For 33065/33065 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 23652 event pairs, 708 based on Foata normal form. 1/5076 useless extension candidates. Maximal degree in co-relation 26828. Up to 3925 conditions per place. [2025-03-08 17:36:34,962 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 177 selfloop transitions, 204 changer transitions 1/383 dead transitions. [2025-03-08 17:36:34,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 383 transitions, 4550 flow [2025-03-08 17:36:34,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 17:36:34,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-08 17:36:34,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 266 transitions. [2025-03-08 17:36:34,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33585858585858586 [2025-03-08 17:36:34,964 INFO L175 Difference]: Start difference. First operand has 136 places, 278 transitions, 2874 flow. Second operand 24 states and 266 transitions. [2025-03-08 17:36:34,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 383 transitions, 4550 flow [2025-03-08 17:36:35,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 383 transitions, 4386 flow, removed 68 selfloop flow, removed 7 redundant places. [2025-03-08 17:36:35,038 INFO L231 Difference]: Finished difference. Result has 161 places, 307 transitions, 3658 flow [2025-03-08 17:36:35,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2744, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3658, PETRI_PLACES=161, PETRI_TRANSITIONS=307} [2025-03-08 17:36:35,039 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 127 predicate places. [2025-03-08 17:36:35,039 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 307 transitions, 3658 flow [2025-03-08 17:36:35,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.1) internal successors, (183), 30 states have internal predecessors, (183), 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-08 17:36:35,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:35,039 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] [2025-03-08 17:36:35,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 17:36:35,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:35,240 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-08 17:36:35,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:35,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2032782215, now seen corresponding path program 5 times [2025-03-08 17:36:35,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:35,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828974246] [2025-03-08 17:36:35,240 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:36:35,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:35,246 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 17:36:35,262 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:36:35,262 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:36:35,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:35,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:35,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828974246] [2025-03-08 17:36:35,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828974246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:36:35,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681478294] [2025-03-08 17:36:35,838 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:36:35,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:35,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:36:35,840 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:36:35,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 17:36:35,888 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 17:36:35,936 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:36:35,936 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:36:35,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:35,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 17:36:35,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:36:36,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:36:36,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:36:36,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2025-03-08 17:36:36,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:36,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:36:36,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:36:36,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2025-03-08 17:36:36,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:36:36,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 369 treesize of output 313 [2025-03-08 17:36:36,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:36:36,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 192 [2025-03-08 17:36:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:36,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681478294] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:36:36,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:36:36,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2025-03-08 17:36:36,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683366268] [2025-03-08 17:36:36,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:36:36,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 17:36:36,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:36,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 17:36:36,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2025-03-08 17:36:36,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-08 17:36:36,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 307 transitions, 3658 flow. Second operand has 29 states, 29 states have (on average 6.0344827586206895) internal successors, (175), 29 states have internal predecessors, (175), 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-08 17:36:36,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:36,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-08 17:36:36,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:38,916 INFO L124 PetriNetUnfolderBase]: 3822/5514 cut-off events. [2025-03-08 17:36:38,916 INFO L125 PetriNetUnfolderBase]: For 40714/40714 co-relation queries the response was YES. [2025-03-08 17:36:38,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30797 conditions, 5514 events. 3822/5514 cut-off events. For 40714/40714 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 26230 event pairs, 855 based on Foata normal form. 21/5535 useless extension candidates. Maximal degree in co-relation 30277. Up to 4091 conditions per place. [2025-03-08 17:36:38,956 INFO L140 encePairwiseOnDemand]: 17/33 looper letters, 234 selfloop transitions, 222 changer transitions 1/458 dead transitions. [2025-03-08 17:36:38,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 458 transitions, 5896 flow [2025-03-08 17:36:38,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 17:36:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-08 17:36:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 293 transitions. [2025-03-08 17:36:38,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3414918414918415 [2025-03-08 17:36:38,958 INFO L175 Difference]: Start difference. First operand has 161 places, 307 transitions, 3658 flow. Second operand 26 states and 293 transitions. [2025-03-08 17:36:38,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 458 transitions, 5896 flow [2025-03-08 17:36:39,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 458 transitions, 5584 flow, removed 89 selfloop flow, removed 8 redundant places. [2025-03-08 17:36:39,061 INFO L231 Difference]: Finished difference. Result has 189 places, 357 transitions, 4774 flow [2025-03-08 17:36:39,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3338, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=4774, PETRI_PLACES=189, PETRI_TRANSITIONS=357} [2025-03-08 17:36:39,062 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 155 predicate places. [2025-03-08 17:36:39,062 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 357 transitions, 4774 flow [2025-03-08 17:36:39,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.0344827586206895) internal successors, (175), 29 states have internal predecessors, (175), 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-08 17:36:39,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:39,062 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] [2025-03-08 17:36:39,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 17:36:39,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:39,263 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-08 17:36:39,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:39,263 INFO L85 PathProgramCache]: Analyzing trace with hash -848212307, now seen corresponding path program 6 times [2025-03-08 17:36:39,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:39,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970342926] [2025-03-08 17:36:39,263 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:36:39,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:39,271 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-08 17:36:39,283 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:36:39,283 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-08 17:36:39,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:39,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:39,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970342926] [2025-03-08 17:36:39,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970342926] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:36:39,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067159200] [2025-03-08 17:36:39,924 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:36:39,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:39,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:36:39,925 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:36:39,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 17:36:39,975 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-08 17:36:39,997 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:36:39,997 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-08 17:36:39,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:39,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 17:36:40,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:36:40,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1