./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/test-context1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/test-context1.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 d63a80d2bfe8ff8bb62e6b5083cee589f2cb0f37dc67867654ab7601d82af23e --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:52:17,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:52:17,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:52:17,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:52:17,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:52:17,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:52:17,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:52:17,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:52:17,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:52:17,531 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:52:17,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:52:17,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:52:17,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:52:17,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:52:17,532 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:52:17,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:52:17,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:52:17,533 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:52:17,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:52:17,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:52:17,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:52:17,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:52:17,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:52:17,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:52:17,533 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:52:17,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:52:17,533 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:52:17,533 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:52:17,533 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:52:17,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:52:17,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:52:17,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:52:17,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:52:17,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:52:17,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:52:17,534 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:52:17,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:52:17,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:52:17,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:52:17,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:52:17,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:52:17,534 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:52:17,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:52:17,534 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 -> d63a80d2bfe8ff8bb62e6b5083cee589f2cb0f37dc67867654ab7601d82af23e [2025-03-13 21:52:17,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:52:17,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:52:17,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:52:17,758 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:52:17,758 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:52:17,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-context1.wvr.c [2025-03-13 21:52:18,908 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6468c0712/f8b642da817b4d329699d3b7e30ff821/FLAG0b639eb02 [2025-03-13 21:52:19,153 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:52:19,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-context1.wvr.c [2025-03-13 21:52:19,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6468c0712/f8b642da817b4d329699d3b7e30ff821/FLAG0b639eb02 [2025-03-13 21:52:19,178 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6468c0712/f8b642da817b4d329699d3b7e30ff821 [2025-03-13 21:52:19,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:52:19,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:52:19,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:52:19,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:52:19,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:52:19,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:52:19" (1/1) ... [2025-03-13 21:52:19,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1c6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:19, skipping insertion in model container [2025-03-13 21:52:19,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:52:19" (1/1) ... [2025-03-13 21:52:19,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:52:19,333 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/test-context1.wvr.c[2459,2472] [2025-03-13 21:52:19,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:52:19,350 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:52:19,365 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/test-context1.wvr.c[2459,2472] [2025-03-13 21:52:19,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:52:19,378 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:52:19,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:19 WrapperNode [2025-03-13 21:52:19,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:52:19,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:52:19,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:52:19,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:52:19,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:19" (1/1) ... [2025-03-13 21:52:19,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:19" (1/1) ... [2025-03-13 21:52:19,413 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 122 [2025-03-13 21:52:19,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:52:19,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:52:19,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:52:19,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:52:19,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:19" (1/1) ... [2025-03-13 21:52:19,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:19" (1/1) ... [2025-03-13 21:52:19,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:19" (1/1) ... [2025-03-13 21:52:19,440 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-13 21:52:19,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:19" (1/1) ... [2025-03-13 21:52:19,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:19" (1/1) ... [2025-03-13 21:52:19,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:19" (1/1) ... [2025-03-13 21:52:19,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:19" (1/1) ... [2025-03-13 21:52:19,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:19" (1/1) ... [2025-03-13 21:52:19,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:19" (1/1) ... [2025-03-13 21:52:19,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:52:19,455 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:52:19,455 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:52:19,455 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:52:19,456 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:19" (1/1) ... [2025-03-13 21:52:19,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:52:19,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:19,481 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-13 21:52:19,484 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-13 21:52:19,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:52:19,504 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:52:19,504 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:52:19,504 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:52:19,504 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:52:19,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:52:19,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:52:19,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:52:19,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:52:19,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:52:19,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:52:19,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:52:19,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:52:19,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:52:19,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:52:19,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:52:19,507 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:52:19,611 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:52:19,613 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:52:19,842 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:52:19,842 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:52:19,842 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:52:20,013 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:52:20,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:52:20 BoogieIcfgContainer [2025-03-13 21:52:20,015 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:52:20,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:52:20,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:52:20,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:52:20,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:52:19" (1/3) ... [2025-03-13 21:52:20,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f7d965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:52:20, skipping insertion in model container [2025-03-13 21:52:20,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:19" (2/3) ... [2025-03-13 21:52:20,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f7d965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:52:20, skipping insertion in model container [2025-03-13 21:52:20,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:52:20" (3/3) ... [2025-03-13 21:52:20,022 INFO L128 eAbstractionObserver]: Analyzing ICFG test-context1.wvr.c [2025-03-13 21:52:20,034 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:52:20,036 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-context1.wvr.c that has 3 procedures, 24 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-13 21:52:20,036 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:52:20,073 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:52:20,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 70 flow [2025-03-13 21:52:20,123 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2025-03-13 21:52:20,128 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:52:20,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 5/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-03-13 21:52:20,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 28 transitions, 70 flow [2025-03-13 21:52:20,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 25 transitions, 62 flow [2025-03-13 21:52:20,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:52:20,162 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;@409311ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:52:20,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-13 21:52:20,170 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:52:20,170 INFO L124 PetriNetUnfolderBase]: 5/24 cut-off events. [2025-03-13 21:52:20,170 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:52:20,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:20,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:20,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:20,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:20,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1452471426, now seen corresponding path program 1 times [2025-03-13 21:52:20,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:20,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947134449] [2025-03-13 21:52:20,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:52:20,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:20,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 21:52:20,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:52:20,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:20,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:20,348 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-13 21:52:20,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:20,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947134449] [2025-03-13 21:52:20,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947134449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:20,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:20,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:52:20,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703254434] [2025-03-13 21:52:20,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:20,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:52:20,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:20,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:52:20,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:52:20,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:52:20,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 62 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-13 21:52:20,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:20,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:52:20,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:20,475 INFO L124 PetriNetUnfolderBase]: 122/217 cut-off events. [2025-03-13 21:52:20,475 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-13 21:52:20,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 217 events. 122/217 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 711 event pairs, 94 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 405. Up to 214 conditions per place. [2025-03-13 21:52:20,480 INFO L140 encePairwiseOnDemand]: 26/28 looper letters, 20 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2025-03-13 21:52:20,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 23 transitions, 98 flow [2025-03-13 21:52:20,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:52:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:52:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2025-03-13 21:52:20,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-13 21:52:20,491 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 62 flow. Second operand 2 states and 32 transitions. [2025-03-13 21:52:20,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 23 transitions, 98 flow [2025-03-13 21:52:20,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 90 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 21:52:20,498 INFO L231 Difference]: Finished difference. Result has 24 places, 23 transitions, 50 flow [2025-03-13 21:52:20,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=50, PETRI_PLACES=24, PETRI_TRANSITIONS=23} [2025-03-13 21:52:20,504 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2025-03-13 21:52:20,505 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 23 transitions, 50 flow [2025-03-13 21:52:20,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-13 21:52:20,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:20,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:20,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:52:20,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:20,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:20,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2006393121, now seen corresponding path program 1 times [2025-03-13 21:52:20,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:20,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703742350] [2025-03-13 21:52:20,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:52:20,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:20,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:52:20,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:52:20,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:20,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:20,608 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-13 21:52:20,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:20,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703742350] [2025-03-13 21:52:20,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703742350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:20,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:20,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:52:20,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352348505] [2025-03-13 21:52:20,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:20,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:52:20,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:20,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:52:20,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:52:20,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:52:20,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 23 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:52:20,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:20,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:52:20,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:20,693 INFO L124 PetriNetUnfolderBase]: 203/353 cut-off events. [2025-03-13 21:52:20,693 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 21:52:20,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 353 events. 203/353 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1272 event pairs, 82 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 709. Up to 176 conditions per place. [2025-03-13 21:52:20,696 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 28 selfloop transitions, 2 changer transitions 3/36 dead transitions. [2025-03-13 21:52:20,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 36 transitions, 144 flow [2025-03-13 21:52:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:52:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:52:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-03-13 21:52:20,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-13 21:52:20,698 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 50 flow. Second operand 3 states and 49 transitions. [2025-03-13 21:52:20,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 36 transitions, 144 flow [2025-03-13 21:52:20,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 144 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:52:20,700 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 62 flow [2025-03-13 21:52:20,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2025-03-13 21:52:20,700 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2025-03-13 21:52:20,700 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 62 flow [2025-03-13 21:52:20,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:52:20,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:20,701 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:20,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:52:20,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:20,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:20,702 INFO L85 PathProgramCache]: Analyzing trace with hash -351831662, now seen corresponding path program 1 times [2025-03-13 21:52:20,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:20,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121463183] [2025-03-13 21:52:20,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:52:20,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:20,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:52:20,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:52:20,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:20,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:20,826 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-13 21:52:20,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:20,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121463183] [2025-03-13 21:52:20,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121463183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:20,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:20,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:52:20,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604942768] [2025-03-13 21:52:20,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:20,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:52:20,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:20,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:52:20,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:52:20,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:52:20,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:52:20,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:20,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:52:20,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:20,930 INFO L124 PetriNetUnfolderBase]: 251/446 cut-off events. [2025-03-13 21:52:20,930 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-13 21:52:20,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 446 events. 251/446 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1678 event pairs, 113 based on Foata normal form. 11/387 useless extension candidates. Maximal degree in co-relation 934. Up to 306 conditions per place. [2025-03-13 21:52:20,933 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 27 selfloop transitions, 2 changer transitions 6/38 dead transitions. [2025-03-13 21:52:20,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 38 transitions, 163 flow [2025-03-13 21:52:20,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:52:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:52:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-03-13 21:52:20,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-03-13 21:52:20,935 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 62 flow. Second operand 3 states and 50 transitions. [2025-03-13 21:52:20,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 38 transitions, 163 flow [2025-03-13 21:52:20,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:52:20,936 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 72 flow [2025-03-13 21:52:20,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2025-03-13 21:52:20,936 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2025-03-13 21:52:20,937 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 72 flow [2025-03-13 21:52:20,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:52:20,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:20,937 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:20,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:52:20,938 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:20,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:20,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1184158308, now seen corresponding path program 1 times [2025-03-13 21:52:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:20,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357566246] [2025-03-13 21:52:20,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:52:20,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:20,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:52:20,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:52:20,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:20,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:21,166 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-13 21:52:21,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:21,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357566246] [2025-03-13 21:52:21,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357566246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:21,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:21,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:52:21,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129858460] [2025-03-13 21:52:21,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:21,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:52:21,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:21,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:52:21,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:52:21,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:52:21,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-13 21:52:21,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:21,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:52:21,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:21,274 INFO L124 PetriNetUnfolderBase]: 319/585 cut-off events. [2025-03-13 21:52:21,275 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-13 21:52:21,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 585 events. 319/585 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2405 event pairs, 285 based on Foata normal form. 12/503 useless extension candidates. Maximal degree in co-relation 1262. Up to 443 conditions per place. [2025-03-13 21:52:21,282 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 21 selfloop transitions, 2 changer transitions 15/41 dead transitions. [2025-03-13 21:52:21,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 184 flow [2025-03-13 21:52:21,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:52:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:52:21,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-03-13 21:52:21,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2025-03-13 21:52:21,283 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 72 flow. Second operand 4 states and 57 transitions. [2025-03-13 21:52:21,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 184 flow [2025-03-13 21:52:21,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:52:21,284 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 84 flow [2025-03-13 21:52:21,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2025-03-13 21:52:21,285 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2025-03-13 21:52:21,285 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 84 flow [2025-03-13 21:52:21,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-13 21:52:21,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:21,285 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:21,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:52:21,286 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:21,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:21,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1137062934, now seen corresponding path program 1 times [2025-03-13 21:52:21,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:21,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091138016] [2025-03-13 21:52:21,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:52:21,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:21,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:52:21,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:52:21,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:21,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:21,617 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-13 21:52:21,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:21,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091138016] [2025-03-13 21:52:21,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091138016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:21,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:21,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:52:21,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110830403] [2025-03-13 21:52:21,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:21,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:52:21,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:21,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:52:21,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:52:21,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:52:21,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 84 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-13 21:52:21,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:21,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:52:21,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:21,799 INFO L124 PetriNetUnfolderBase]: 331/583 cut-off events. [2025-03-13 21:52:21,799 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-03-13 21:52:21,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1289 conditions, 583 events. 331/583 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2176 event pairs, 68 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 1281. Up to 157 conditions per place. [2025-03-13 21:52:21,803 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 44 selfloop transitions, 5 changer transitions 12/64 dead transitions. [2025-03-13 21:52:21,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 64 transitions, 295 flow [2025-03-13 21:52:21,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:52:21,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:52:21,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2025-03-13 21:52:21,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-13 21:52:21,804 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 84 flow. Second operand 6 states and 91 transitions. [2025-03-13 21:52:21,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 64 transitions, 295 flow [2025-03-13 21:52:21,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 64 transitions, 289 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-13 21:52:21,810 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 98 flow [2025-03-13 21:52:21,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2025-03-13 21:52:21,810 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2025-03-13 21:52:21,810 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 98 flow [2025-03-13 21:52:21,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-13 21:52:21,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:21,811 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:21,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:52:21,812 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:21,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:21,813 INFO L85 PathProgramCache]: Analyzing trace with hash -72371257, now seen corresponding path program 2 times [2025-03-13 21:52:21,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:21,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460894610] [2025-03-13 21:52:21,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:52:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:21,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:52:21,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:52:21,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:52:21,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:21,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:21,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460894610] [2025-03-13 21:52:21,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460894610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:21,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:21,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:52:21,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844882865] [2025-03-13 21:52:21,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:21,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:52:21,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:21,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:52:21,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:52:21,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:52:21,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:52:21,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:21,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:52:21,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:22,039 INFO L124 PetriNetUnfolderBase]: 719/1265 cut-off events. [2025-03-13 21:52:22,039 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-03-13 21:52:22,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1265 events. 719/1265 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5603 event pairs, 280 based on Foata normal form. 22/1090 useless extension candidates. Maximal degree in co-relation 2837. Up to 462 conditions per place. [2025-03-13 21:52:22,044 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 50 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2025-03-13 21:52:22,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 312 flow [2025-03-13 21:52:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:52:22,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:52:22,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-03-13 21:52:22,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-03-13 21:52:22,045 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 98 flow. Second operand 4 states and 72 transitions. [2025-03-13 21:52:22,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 312 flow [2025-03-13 21:52:22,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 60 transitions, 298 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-13 21:52:22,047 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 152 flow [2025-03-13 21:52:22,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-03-13 21:52:22,048 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2025-03-13 21:52:22,048 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 152 flow [2025-03-13 21:52:22,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:52:22,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:22,048 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:22,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:52:22,048 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:22,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:22,051 INFO L85 PathProgramCache]: Analyzing trace with hash -570701833, now seen corresponding path program 3 times [2025-03-13 21:52:22,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:22,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364944477] [2025-03-13 21:52:22,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:52:22,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:22,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:52:22,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:52:22,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:52:22,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:22,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:22,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364944477] [2025-03-13 21:52:22,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364944477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:22,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901678993] [2025-03-13 21:52:22,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:52:22,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:22,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:22,223 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-13 21:52:22,225 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-13 21:52:22,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:52:22,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:52:22,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:52:22,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:22,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:52:22,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:22,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:22,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:22,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:22,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901678993] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:22,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:22,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-13 21:52:22,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840484913] [2025-03-13 21:52:22,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:22,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:52:22,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:22,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:52:22,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:52:22,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:52:22,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 152 flow. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 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-13 21:52:22,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:22,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:52:22,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:22,976 INFO L124 PetriNetUnfolderBase]: 1255/2228 cut-off events. [2025-03-13 21:52:22,977 INFO L125 PetriNetUnfolderBase]: For 1347/1347 co-relation queries the response was YES. [2025-03-13 21:52:22,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5331 conditions, 2228 events. 1255/2228 cut-off events. For 1347/1347 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 11602 event pairs, 404 based on Foata normal form. 33/1909 useless extension candidates. Maximal degree in co-relation 5321. Up to 1122 conditions per place. [2025-03-13 21:52:22,988 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 33 selfloop transitions, 4 changer transitions 65/105 dead transitions. [2025-03-13 21:52:22,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 105 transitions, 574 flow [2025-03-13 21:52:22,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:52:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:52:22,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2025-03-13 21:52:22,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-03-13 21:52:22,992 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 152 flow. Second operand 9 states and 138 transitions. [2025-03-13 21:52:22,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 105 transitions, 574 flow [2025-03-13 21:52:22,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 105 transitions, 564 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-03-13 21:52:22,998 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 180 flow [2025-03-13 21:52:22,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=180, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2025-03-13 21:52:22,999 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 22 predicate places. [2025-03-13 21:52:23,000 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 180 flow [2025-03-13 21:52:23,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 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-13 21:52:23,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:23,000 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:23,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:52:23,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:23,203 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:23,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash 817461091, now seen corresponding path program 4 times [2025-03-13 21:52:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:23,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184186596] [2025-03-13 21:52:23,204 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:52:23,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:23,217 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-13 21:52:23,227 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-13 21:52:23,227 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:52:23,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:23,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:23,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184186596] [2025-03-13 21:52:23,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184186596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:23,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939550089] [2025-03-13 21:52:23,453 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:52:23,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:23,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:23,455 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-13 21:52:23,456 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-13 21:52:23,497 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-13 21:52:23,517 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-13 21:52:23,518 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:52:23,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:23,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:52:23,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:23,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:23,619 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-13 21:52:23,620 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 28 treesize of output 11 [2025-03-13 21:52:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:23,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939550089] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:23,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:23,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-13 21:52:23,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617622197] [2025-03-13 21:52:23,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:23,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:52:23,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:23,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:52:23,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:52:23,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:52:23,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 180 flow. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 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-13 21:52:23,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:23,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:52:23,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:24,118 INFO L124 PetriNetUnfolderBase]: 1998/3447 cut-off events. [2025-03-13 21:52:24,119 INFO L125 PetriNetUnfolderBase]: For 3512/3512 co-relation queries the response was YES. [2025-03-13 21:52:24,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8738 conditions, 3447 events. 1998/3447 cut-off events. For 3512/3512 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 18302 event pairs, 251 based on Foata normal form. 24/2935 useless extension candidates. Maximal degree in co-relation 8723. Up to 625 conditions per place. [2025-03-13 21:52:24,132 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 98 selfloop transitions, 31 changer transitions 54/186 dead transitions. [2025-03-13 21:52:24,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 186 transitions, 1073 flow [2025-03-13 21:52:24,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 21:52:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 21:52:24,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 245 transitions. [2025-03-13 21:52:24,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6730769230769231 [2025-03-13 21:52:24,134 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 180 flow. Second operand 13 states and 245 transitions. [2025-03-13 21:52:24,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 186 transitions, 1073 flow [2025-03-13 21:52:24,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 186 transitions, 1043 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-13 21:52:24,141 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 554 flow [2025-03-13 21:52:24,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=554, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2025-03-13 21:52:24,142 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 36 predicate places. [2025-03-13 21:52:24,142 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 554 flow [2025-03-13 21:52:24,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 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-13 21:52:24,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:24,143 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:24,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 21:52:24,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-13 21:52:24,344 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:24,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:24,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1021840888, now seen corresponding path program 5 times [2025-03-13 21:52:24,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:24,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839667088] [2025-03-13 21:52:24,344 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:52:24,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:24,352 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-03-13 21:52:24,366 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:52:24,366 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-13 21:52:24,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-13 21:52:24,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:24,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839667088] [2025-03-13 21:52:24,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839667088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:24,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783627876] [2025-03-13 21:52:24,491 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:52:24,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:24,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:24,494 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-13 21:52:24,496 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-13 21:52:24,533 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-03-13 21:52:24,554 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:52:24,554 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-13 21:52:24,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:24,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:52:24,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-13 21:52:24,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-13 21:52:24,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783627876] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:24,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:24,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-03-13 21:52:24,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241874689] [2025-03-13 21:52:24,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:24,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-13 21:52:24,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:24,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-13 21:52:24,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-03-13 21:52:24,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:52:24,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 554 flow. Second operand has 20 states, 20 states have (on average 8.25) internal successors, (165), 20 states have internal predecessors, (165), 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-13 21:52:24,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:24,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:52:24,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:25,444 INFO L124 PetriNetUnfolderBase]: 2573/4505 cut-off events. [2025-03-13 21:52:25,444 INFO L125 PetriNetUnfolderBase]: For 7959/7959 co-relation queries the response was YES. [2025-03-13 21:52:25,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12066 conditions, 4505 events. 2573/4505 cut-off events. For 7959/7959 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 26523 event pairs, 1832 based on Foata normal form. 52/3846 useless extension candidates. Maximal degree in co-relation 12042. Up to 3442 conditions per place. [2025-03-13 21:52:25,462 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 53 selfloop transitions, 4 changer transitions 81/141 dead transitions. [2025-03-13 21:52:25,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 141 transitions, 1093 flow [2025-03-13 21:52:25,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:52:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:52:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2025-03-13 21:52:25,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-03-13 21:52:25,464 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 554 flow. Second operand 11 states and 161 transitions. [2025-03-13 21:52:25,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 141 transitions, 1093 flow [2025-03-13 21:52:25,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 141 transitions, 905 flow, removed 89 selfloop flow, removed 2 redundant places. [2025-03-13 21:52:25,490 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 424 flow [2025-03-13 21:52:25,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=424, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2025-03-13 21:52:25,491 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 51 predicate places. [2025-03-13 21:52:25,491 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 424 flow [2025-03-13 21:52:25,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.25) internal successors, (165), 20 states have internal predecessors, (165), 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-13 21:52:25,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:25,491 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:25,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 21:52:25,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:25,693 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:25,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:25,694 INFO L85 PathProgramCache]: Analyzing trace with hash 972261912, now seen corresponding path program 6 times [2025-03-13 21:52:25,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:25,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243821254] [2025-03-13 21:52:25,694 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:52:25,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:25,703 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 3 equivalence classes. [2025-03-13 21:52:25,746 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:52:25,746 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-13 21:52:25,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:26,044 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:52:26,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:26,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243821254] [2025-03-13 21:52:26,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243821254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:26,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031110834] [2025-03-13 21:52:26,045 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:52:26,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:26,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:26,047 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-13 21:52:26,049 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-13 21:52:26,089 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 3 equivalence classes. [2025-03-13 21:52:26,112 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:52:26,113 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-13 21:52:26,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:26,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-13 21:52:26,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:52:26,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:26,255 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-13 21:52:26,256 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 28 treesize of output 11 [2025-03-13 21:52:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:52:26,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031110834] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:26,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:26,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2025-03-13 21:52:26,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457437848] [2025-03-13 21:52:26,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:26,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-13 21:52:26,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:26,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-13 21:52:26,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-13 21:52:26,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:52:26,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 60 transitions, 424 flow. Second operand has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 17 states have internal predecessors, (145), 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-13 21:52:26,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:26,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:52:26,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:28,104 INFO L124 PetriNetUnfolderBase]: 7765/13320 cut-off events. [2025-03-13 21:52:28,104 INFO L125 PetriNetUnfolderBase]: For 10620/10620 co-relation queries the response was YES. [2025-03-13 21:52:28,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32060 conditions, 13320 events. 7765/13320 cut-off events. For 10620/10620 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 87744 event pairs, 718 based on Foata normal form. 15/11276 useless extension candidates. Maximal degree in co-relation 32030. Up to 2425 conditions per place. [2025-03-13 21:52:28,156 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 351 selfloop transitions, 139 changer transitions 135/628 dead transitions. [2025-03-13 21:52:28,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 628 transitions, 3716 flow [2025-03-13 21:52:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-13 21:52:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-13 21:52:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 778 transitions. [2025-03-13 21:52:28,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6314935064935064 [2025-03-13 21:52:28,160 INFO L175 Difference]: Start difference. First operand has 78 places, 60 transitions, 424 flow. Second operand 44 states and 778 transitions. [2025-03-13 21:52:28,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 628 transitions, 3716 flow [2025-03-13 21:52:28,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 628 transitions, 3652 flow, removed 29 selfloop flow, removed 9 redundant places. [2025-03-13 21:52:28,197 INFO L231 Difference]: Finished difference. Result has 126 places, 179 transitions, 1652 flow [2025-03-13 21:52:28,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=1652, PETRI_PLACES=126, PETRI_TRANSITIONS=179} [2025-03-13 21:52:28,198 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 99 predicate places. [2025-03-13 21:52:28,198 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 179 transitions, 1652 flow [2025-03-13 21:52:28,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 17 states have internal predecessors, (145), 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-13 21:52:28,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:28,199 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:28,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:52:28,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:28,400 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:28,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:28,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1966107783, now seen corresponding path program 7 times [2025-03-13 21:52:28,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:28,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237400393] [2025-03-13 21:52:28,402 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:52:28,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:28,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-13 21:52:28,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-13 21:52:28,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:28,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-13 21:52:28,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:28,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237400393] [2025-03-13 21:52:28,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237400393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:28,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062574041] [2025-03-13 21:52:28,583 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:52:28,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:28,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:28,585 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-13 21:52:28,588 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-13 21:52:28,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-13 21:52:28,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-13 21:52:28,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:28,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:28,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-13 21:52:28,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:28,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:52:29,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062574041] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:29,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:29,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 28 [2025-03-13 21:52:29,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218481442] [2025-03-13 21:52:29,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:29,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-13 21:52:29,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:29,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-13 21:52:29,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 [2025-03-13 21:52:29,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:52:29,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 179 transitions, 1652 flow. Second operand has 29 states, 29 states have (on average 8.379310344827585) internal successors, (243), 29 states have internal predecessors, (243), 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-13 21:52:29,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:29,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:52:29,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:30,575 INFO L124 PetriNetUnfolderBase]: 5930/10301 cut-off events. [2025-03-13 21:52:30,575 INFO L125 PetriNetUnfolderBase]: For 14042/14042 co-relation queries the response was YES. [2025-03-13 21:52:30,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26375 conditions, 10301 events. 5930/10301 cut-off events. For 14042/14042 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 67972 event pairs, 3993 based on Foata normal form. 133/8816 useless extension candidates. Maximal degree in co-relation 26331. Up to 7683 conditions per place. [2025-03-13 21:52:30,620 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 108 selfloop transitions, 5 changer transitions 163/279 dead transitions. [2025-03-13 21:52:30,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 279 transitions, 2150 flow [2025-03-13 21:52:30,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 21:52:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 21:52:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 277 transitions. [2025-03-13 21:52:30,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5496031746031746 [2025-03-13 21:52:30,622 INFO L175 Difference]: Start difference. First operand has 126 places, 179 transitions, 1652 flow. Second operand 18 states and 277 transitions. [2025-03-13 21:52:30,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 279 transitions, 2150 flow [2025-03-13 21:52:30,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 279 transitions, 2012 flow, removed 54 selfloop flow, removed 9 redundant places. [2025-03-13 21:52:30,679 INFO L231 Difference]: Finished difference. Result has 126 places, 116 transitions, 929 flow [2025-03-13 21:52:30,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=929, PETRI_PLACES=126, PETRI_TRANSITIONS=116} [2025-03-13 21:52:30,680 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 99 predicate places. [2025-03-13 21:52:30,680 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 116 transitions, 929 flow [2025-03-13 21:52:30,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.379310344827585) internal successors, (243), 29 states have internal predecessors, (243), 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-13 21:52:30,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:30,680 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:30,687 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-13 21:52:30,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-13 21:52:30,881 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:30,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:30,881 INFO L85 PathProgramCache]: Analyzing trace with hash -177962915, now seen corresponding path program 8 times [2025-03-13 21:52:30,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:30,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230631516] [2025-03-13 21:52:30,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:52:30,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:30,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-13 21:52:30,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 21:52:30,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:52:30,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:31,327 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:52:31,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:31,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230631516] [2025-03-13 21:52:31,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230631516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:31,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349908879] [2025-03-13 21:52:31,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:52:31,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:31,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:31,330 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-13 21:52:31,332 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-13 21:52:31,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-13 21:52:31,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 21:52:31,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:52:31,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:31,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-13 21:52:31,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 21:52:31,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:31,765 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-13 21:52:31,766 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 28 treesize of output 11 [2025-03-13 21:52:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 21:52:31,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349908879] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:31,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:31,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 29 [2025-03-13 21:52:31,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399244609] [2025-03-13 21:52:31,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:31,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-13 21:52:31,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:31,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-13 21:52:31,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2025-03-13 21:52:31,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:52:31,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 116 transitions, 929 flow. Second operand has 30 states, 30 states have (on average 8.5) internal successors, (255), 30 states have internal predecessors, (255), 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-13 21:52:31,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:31,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:52:31,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:37,698 INFO L124 PetriNetUnfolderBase]: 24235/41411 cut-off events. [2025-03-13 21:52:37,699 INFO L125 PetriNetUnfolderBase]: For 48571/48571 co-relation queries the response was YES. [2025-03-13 21:52:37,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100332 conditions, 41411 events. 24235/41411 cut-off events. For 48571/48571 co-relation queries the response was YES. Maximal size of possible extension queue 971. Compared 321553 event pairs, 1756 based on Foata normal form. 181/35182 useless extension candidates. Maximal degree in co-relation 100291. Up to 7600 conditions per place. [2025-03-13 21:52:38,027 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 722 selfloop transitions, 505 changer transitions 348/1578 dead transitions. [2025-03-13 21:52:38,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 1578 transitions, 10121 flow [2025-03-13 21:52:38,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-13 21:52:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2025-03-13 21:52:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 1708 transitions. [2025-03-13 21:52:38,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6421052631578947 [2025-03-13 21:52:38,039 INFO L175 Difference]: Start difference. First operand has 126 places, 116 transitions, 929 flow. Second operand 95 states and 1708 transitions. [2025-03-13 21:52:38,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 1578 transitions, 10121 flow [2025-03-13 21:52:38,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 1578 transitions, 9881 flow, removed 79 selfloop flow, removed 10 redundant places. [2025-03-13 21:52:38,315 INFO L231 Difference]: Finished difference. Result has 237 places, 580 transitions, 6037 flow [2025-03-13 21:52:38,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=95, PETRI_FLOW=6037, PETRI_PLACES=237, PETRI_TRANSITIONS=580} [2025-03-13 21:52:38,316 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 210 predicate places. [2025-03-13 21:52:38,316 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 580 transitions, 6037 flow [2025-03-13 21:52:38,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.5) internal successors, (255), 30 states have internal predecessors, (255), 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-13 21:52:38,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:38,316 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:38,324 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-13 21:52:38,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:38,517 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:38,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:38,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2131947524, now seen corresponding path program 9 times [2025-03-13 21:52:38,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:38,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361304329] [2025-03-13 21:52:38,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:52:38,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:38,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-03-13 21:52:38,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 40 of 52 statements. [2025-03-13 21:52:38,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-13 21:52:38,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-13 21:52:38,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:38,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361304329] [2025-03-13 21:52:38,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361304329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:38,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487505091] [2025-03-13 21:52:38,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:52:38,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:38,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:38,832 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-13 21:52:38,833 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-13 21:52:38,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-03-13 21:52:38,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 40 of 52 statements. [2025-03-13 21:52:38,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-13 21:52:38,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:38,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-13 21:52:38,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:38,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-13 21:52:43,319 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-13 21:52:43,320 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 10 [2025-03-13 21:52:43,328 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 20 refuted. 1 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-13 21:52:43,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:44,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2025-03-13 21:52:44,075 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-13 21:52:44,075 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 58 treesize of output 45 [2025-03-13 21:52:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-13 21:52:44,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487505091] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:44,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:44,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2025-03-13 21:52:44,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622109940] [2025-03-13 21:52:44,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:44,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-13 21:52:44,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:44,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-13 21:52:44,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=758, Unknown=1, NotChecked=0, Total=930 [2025-03-13 21:52:44,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:52:44,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 580 transitions, 6037 flow. Second operand has 31 states, 31 states have (on average 7.741935483870968) internal successors, (240), 31 states have internal predecessors, (240), 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-13 21:52:44,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:44,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:52:44,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:52,752 INFO L124 PetriNetUnfolderBase]: 34409/58741 cut-off events. [2025-03-13 21:52:52,752 INFO L125 PetriNetUnfolderBase]: For 112416/112416 co-relation queries the response was YES. [2025-03-13 21:52:53,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157274 conditions, 58741 events. 34409/58741 cut-off events. For 112416/112416 co-relation queries the response was YES. Maximal size of possible extension queue 1539. Compared 495602 event pairs, 12327 based on Foata normal form. 6/49650 useless extension candidates. Maximal degree in co-relation 157190. Up to 22144 conditions per place. [2025-03-13 21:52:53,619 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 331 selfloop transitions, 11 changer transitions 577/922 dead transitions. [2025-03-13 21:52:53,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 922 transitions, 10916 flow [2025-03-13 21:52:53,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 21:52:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 21:52:53,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 191 transitions. [2025-03-13 21:52:53,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4872448979591837 [2025-03-13 21:52:53,620 INFO L175 Difference]: Start difference. First operand has 237 places, 580 transitions, 6037 flow. Second operand 14 states and 191 transitions. [2025-03-13 21:52:53,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 922 transitions, 10916 flow [2025-03-13 21:52:55,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 922 transitions, 10195 flow, removed 315 selfloop flow, removed 9 redundant places. [2025-03-13 21:52:55,570 INFO L231 Difference]: Finished difference. Result has 242 places, 336 transitions, 3213 flow [2025-03-13 21:52:55,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5497, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3213, PETRI_PLACES=242, PETRI_TRANSITIONS=336} [2025-03-13 21:52:55,571 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 215 predicate places. [2025-03-13 21:52:55,571 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 336 transitions, 3213 flow [2025-03-13 21:52:55,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.741935483870968) internal successors, (240), 31 states have internal predecessors, (240), 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-13 21:52:55,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:55,571 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:55,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-13 21:52:55,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:55,772 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:55,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:55,773 INFO L85 PathProgramCache]: Analyzing trace with hash 129372408, now seen corresponding path program 10 times [2025-03-13 21:52:55,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:55,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133885040] [2025-03-13 21:52:55,773 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:52:55,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:55,781 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-13 21:52:55,793 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 21:52:55,793 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:52:55,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-13 21:52:56,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:56,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133885040] [2025-03-13 21:52:56,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133885040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:56,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087553160] [2025-03-13 21:52:56,180 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:52:56,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:56,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:56,182 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:52:56,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-13 21:52:56,230 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-13 21:52:56,257 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 21:52:56,257 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:52:56,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:56,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-13 21:52:56,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:56,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:56,794 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-13 21:52:56,794 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 28 treesize of output 11 [2025-03-13 21:52:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-13 21:52:56,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087553160] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:56,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:56,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 12] total 37 [2025-03-13 21:52:56,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678040534] [2025-03-13 21:52:56,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:56,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-13 21:52:56,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:56,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-13 21:52:56,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1195, Unknown=0, NotChecked=0, Total=1406 [2025-03-13 21:52:56,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:52:56,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 336 transitions, 3213 flow. Second operand has 38 states, 38 states have (on average 8.473684210526315) internal successors, (322), 38 states have internal predecessors, (322), 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-13 21:52:56,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:56,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:52:56,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:10,248 INFO L124 PetriNetUnfolderBase]: 44798/76412 cut-off events. [2025-03-13 21:53:10,248 INFO L125 PetriNetUnfolderBase]: For 374057/374057 co-relation queries the response was YES. [2025-03-13 21:53:11,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191045 conditions, 76412 events. 44798/76412 cut-off events. For 374057/374057 co-relation queries the response was YES. Maximal size of possible extension queue 1574. Compared 635817 event pairs, 1562 based on Foata normal form. 140/64755 useless extension candidates. Maximal degree in co-relation 190962. Up to 14025 conditions per place. [2025-03-13 21:53:11,428 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 1265 selfloop transitions, 987 changer transitions 312/2567 dead transitions. [2025-03-13 21:53:11,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 2567 transitions, 22852 flow [2025-03-13 21:53:11,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2025-03-13 21:53:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2025-03-13 21:53:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 2458 transitions. [2025-03-13 21:53:11,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6551172707889126 [2025-03-13 21:53:11,434 INFO L175 Difference]: Start difference. First operand has 242 places, 336 transitions, 3213 flow. Second operand 134 states and 2458 transitions. [2025-03-13 21:53:11,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 2567 transitions, 22852 flow [2025-03-13 21:53:13,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 2567 transitions, 20588 flow, removed 1111 selfloop flow, removed 31 redundant places. [2025-03-13 21:53:13,159 INFO L231 Difference]: Finished difference. Result has 358 places, 1112 transitions, 12130 flow [2025-03-13 21:53:13,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3123, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=307, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=134, PETRI_FLOW=12130, PETRI_PLACES=358, PETRI_TRANSITIONS=1112} [2025-03-13 21:53:13,160 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 331 predicate places. [2025-03-13 21:53:13,160 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 1112 transitions, 12130 flow [2025-03-13 21:53:13,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 8.473684210526315) internal successors, (322), 38 states have internal predecessors, (322), 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-13 21:53:13,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:13,161 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:13,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-13 21:53:13,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-13 21:53:13,361 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:13,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:13,362 INFO L85 PathProgramCache]: Analyzing trace with hash -356452724, now seen corresponding path program 11 times [2025-03-13 21:53:13,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:13,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620242263] [2025-03-13 21:53:13,362 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:53:13,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:13,368 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 6 equivalence classes. [2025-03-13 21:53:13,378 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 21:53:13,378 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-13 21:53:13,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:13,578 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-13 21:53:13,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:13,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620242263] [2025-03-13 21:53:13,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620242263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:13,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062088451] [2025-03-13 21:53:13,579 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:53:13,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:13,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:13,581 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:53:13,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-13 21:53:13,628 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 6 equivalence classes. [2025-03-13 21:53:13,674 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 21:53:13,674 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-13 21:53:13,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:13,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-13 21:53:13,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-13 21:53:13,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 32 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-13 21:53:14,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062088451] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:14,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:14,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 40 [2025-03-13 21:53:14,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84934902] [2025-03-13 21:53:14,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:14,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-13 21:53:14,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:14,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-13 21:53:14,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1298, Unknown=0, NotChecked=0, Total=1640 [2025-03-13 21:53:14,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:53:14,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 1112 transitions, 12130 flow. Second operand has 41 states, 41 states have (on average 7.853658536585366) internal successors, (322), 41 states have internal predecessors, (322), 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-13 21:53:14,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:14,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:53:14,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand