./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/test-easy10.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-easy10.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 24421fae56d27ddfd314bb85e4431c40a1e6738a845aa97472d8668d2b4dde52 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:28:15,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:28:15,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:28:15,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:28:15,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:28:15,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:28:15,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:28:15,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:28:15,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:28:15,766 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:28:15,766 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:28:15,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:28:15,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:28:15,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:28:15,766 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:28:15,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:28:15,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:28:15,766 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:28:15,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:28:15,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:28:15,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:28:15,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:28:15,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:28:15,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:28:15,767 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:28:15,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:28:15,767 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:28:15,767 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:28:15,767 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:28:15,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:28:15,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:28:15,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:28:15,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:28:15,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:28:15,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:28:15,767 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:28:15,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:28:15,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:28:15,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:28:15,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:28:15,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:28:15,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:28:15,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:28:15,769 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 -> 24421fae56d27ddfd314bb85e4431c40a1e6738a845aa97472d8668d2b4dde52 [2025-03-04 02:28:15,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:28:16,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:28:16,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:28:16,008 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:28:16,008 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:28:16,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-easy10.wvr.c [2025-03-04 02:28:17,106 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8be53b26f/87b8cb03c4034291b8af5a9266fc13cf/FLAG2fd21ce59 [2025-03-04 02:28:17,362 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:28:17,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-easy10.wvr.c [2025-03-04 02:28:17,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8be53b26f/87b8cb03c4034291b8af5a9266fc13cf/FLAG2fd21ce59 [2025-03-04 02:28:17,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8be53b26f/87b8cb03c4034291b8af5a9266fc13cf [2025-03-04 02:28:17,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:28:17,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:28:17,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:28:17,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:28:17,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:28:17,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:28:17" (1/1) ... [2025-03-04 02:28:17,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@720f751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:17, skipping insertion in model container [2025-03-04 02:28:17,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:28:17" (1/1) ... [2025-03-04 02:28:17,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:28:17,546 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-easy10.wvr.c[2547,2560] [2025-03-04 02:28:17,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:28:17,561 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:28:17,578 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-easy10.wvr.c[2547,2560] [2025-03-04 02:28:17,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:28:17,588 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:28:17,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:17 WrapperNode [2025-03-04 02:28:17,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:28:17,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:28:17,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:28:17,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:28:17,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:17" (1/1) ... [2025-03-04 02:28:17,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:17" (1/1) ... [2025-03-04 02:28:17,623 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-03-04 02:28:17,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:28:17,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:28:17,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:28:17,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:28:17,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:17" (1/1) ... [2025-03-04 02:28:17,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:17" (1/1) ... [2025-03-04 02:28:17,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:17" (1/1) ... [2025-03-04 02:28:17,645 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:28:17,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:17" (1/1) ... [2025-03-04 02:28:17,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:17" (1/1) ... [2025-03-04 02:28:17,650 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:17" (1/1) ... [2025-03-04 02:28:17,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:17" (1/1) ... [2025-03-04 02:28:17,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:17" (1/1) ... [2025-03-04 02:28:17,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:17" (1/1) ... [2025-03-04 02:28:17,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:28:17,661 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:28:17,661 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:28:17,661 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:28:17,661 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:17" (1/1) ... [2025-03-04 02:28:17,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:28:17,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:17,691 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-04 02:28:17,696 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-04 02:28:17,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:28:17,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:28:17,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:28:17,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:28:17,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:28:17,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:28:17,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:28:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 02:28:17,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 02:28:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:28:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:28:17,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:28:17,713 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:28:17,782 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:28:17,783 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:28:17,943 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:28:17,944 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:28:18,064 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:28:18,064 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:28:18,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:28:18 BoogieIcfgContainer [2025-03-04 02:28:18,065 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:28:18,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:28:18,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:28:18,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:28:18,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:28:17" (1/3) ... [2025-03-04 02:28:18,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e412f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:28:18, skipping insertion in model container [2025-03-04 02:28:18,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:17" (2/3) ... [2025-03-04 02:28:18,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e412f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:28:18, skipping insertion in model container [2025-03-04 02:28:18,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:28:18" (3/3) ... [2025-03-04 02:28:18,072 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy10.wvr.c [2025-03-04 02:28:18,081 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:28:18,082 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy10.wvr.c that has 5 procedures, 61 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-04 02:28:18,082 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:28:18,125 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 02:28:18,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 60 transitions, 148 flow [2025-03-04 02:28:18,186 INFO L124 PetriNetUnfolderBase]: 0/56 cut-off events. [2025-03-04 02:28:18,188 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 02:28:18,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 56 events. 0/56 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-04 02:28:18,189 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 60 transitions, 148 flow [2025-03-04 02:28:18,191 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 55 transitions, 134 flow [2025-03-04 02:28:18,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:28:18,207 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;@63f6e89d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:28:18,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 02:28:18,227 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:28:18,228 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2025-03-04 02:28:18,228 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 02:28:18,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:18,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:18,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:28:18,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:18,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1595918204, now seen corresponding path program 1 times [2025-03-04 02:28:18,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:18,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608580868] [2025-03-04 02:28:18,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:18,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:18,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 02:28:18,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 02:28:18,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:18,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:18,698 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-04 02:28:18,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:18,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608580868] [2025-03-04 02:28:18,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608580868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:18,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:18,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:28:18,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455010245] [2025-03-04 02:28:18,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:18,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:28:18,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:18,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:28:18,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:28:18,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 60 [2025-03-04 02:28:18,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-04 02:28:18,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:18,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 60 [2025-03-04 02:28:18,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:20,459 INFO L124 PetriNetUnfolderBase]: 22838/30875 cut-off events. [2025-03-04 02:28:20,459 INFO L125 PetriNetUnfolderBase]: For 835/835 co-relation queries the response was YES. [2025-03-04 02:28:20,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63061 conditions, 30875 events. 22838/30875 cut-off events. For 835/835 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 171470 event pairs, 7169 based on Foata normal form. 440/31303 useless extension candidates. Maximal degree in co-relation 59981. Up to 24496 conditions per place. [2025-03-04 02:28:20,626 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 70 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2025-03-04 02:28:20,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 77 transitions, 328 flow [2025-03-04 02:28:20,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:28:20,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:28:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-03-04 02:28:20,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-04 02:28:20,637 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 134 flow. Second operand 3 states and 100 transitions. [2025-03-04 02:28:20,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 77 transitions, 328 flow [2025-03-04 02:28:20,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 77 transitions, 308 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 02:28:20,668 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 126 flow [2025-03-04 02:28:20,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2025-03-04 02:28:20,673 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -5 predicate places. [2025-03-04 02:28:20,675 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 126 flow [2025-03-04 02:28:20,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-04 02:28:20,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:20,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:20,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:28:20,676 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:28:20,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:20,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1581868704, now seen corresponding path program 2 times [2025-03-04 02:28:20,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:20,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11939202] [2025-03-04 02:28:20,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:20,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:20,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 1 equivalence classes. [2025-03-04 02:28:20,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 02:28:20,704 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:28:20,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:20,876 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-04 02:28:20,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:20,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11939202] [2025-03-04 02:28:20,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11939202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:20,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:20,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:28:20,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267054834] [2025-03-04 02:28:20,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:20,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:28:20,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:20,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:28:20,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:28:20,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 60 [2025-03-04 02:28:20,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-04 02:28:20,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:20,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 60 [2025-03-04 02:28:20,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:22,111 INFO L124 PetriNetUnfolderBase]: 17539/23845 cut-off events. [2025-03-04 02:28:22,112 INFO L125 PetriNetUnfolderBase]: For 1244/1244 co-relation queries the response was YES. [2025-03-04 02:28:22,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49400 conditions, 23845 events. 17539/23845 cut-off events. For 1244/1244 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 123621 event pairs, 6369 based on Foata normal form. 434/24259 useless extension candidates. Maximal degree in co-relation 19340. Up to 17342 conditions per place. [2025-03-04 02:28:22,192 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 68 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-03-04 02:28:22,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 75 transitions, 313 flow [2025-03-04 02:28:22,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:28:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:28:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2025-03-04 02:28:22,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2025-03-04 02:28:22,194 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 126 flow. Second operand 3 states and 98 transitions. [2025-03-04 02:28:22,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 75 transitions, 313 flow [2025-03-04 02:28:22,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 75 transitions, 307 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:28:22,196 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 130 flow [2025-03-04 02:28:22,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-03-04 02:28:22,197 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2025-03-04 02:28:22,197 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 130 flow [2025-03-04 02:28:22,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-04 02:28:22,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:22,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:22,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:28:22,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:28:22,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:22,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1653709342, now seen corresponding path program 3 times [2025-03-04 02:28:22,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:22,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937893967] [2025-03-04 02:28:22,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:22,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:22,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 1 equivalence classes. [2025-03-04 02:28:22,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 02:28:22,309 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:28:22,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:24,055 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-04 02:28:24,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:24,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937893967] [2025-03-04 02:28:24,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937893967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:24,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:24,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 02:28:24,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279302972] [2025-03-04 02:28:24,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:24,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:28:24,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:24,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:28:24,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:28:24,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 60 [2025-03-04 02:28:24,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 130 flow. Second operand has 14 states, 14 states have (on average 12.571428571428571) internal successors, (176), 14 states have internal predecessors, (176), 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-04 02:28:24,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:24,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 60 [2025-03-04 02:28:24,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:27,617 INFO L124 PetriNetUnfolderBase]: 40518/55563 cut-off events. [2025-03-04 02:28:27,618 INFO L125 PetriNetUnfolderBase]: For 4089/4089 co-relation queries the response was YES. [2025-03-04 02:28:27,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117773 conditions, 55563 events. 40518/55563 cut-off events. For 4089/4089 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 333677 event pairs, 5199 based on Foata normal form. 1/55553 useless extension candidates. Maximal degree in co-relation 25344. Up to 14408 conditions per place. [2025-03-04 02:28:27,807 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 251 selfloop transitions, 16 changer transitions 19/291 dead transitions. [2025-03-04 02:28:27,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 291 transitions, 1269 flow [2025-03-04 02:28:27,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:28:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:28:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 422 transitions. [2025-03-04 02:28:27,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4688888888888889 [2025-03-04 02:28:27,814 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 130 flow. Second operand 15 states and 422 transitions. [2025-03-04 02:28:27,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 291 transitions, 1269 flow [2025-03-04 02:28:27,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 291 transitions, 1249 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:28:27,838 INFO L231 Difference]: Finished difference. Result has 89 places, 69 transitions, 250 flow [2025-03-04 02:28:27,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=250, PETRI_PLACES=89, PETRI_TRANSITIONS=69} [2025-03-04 02:28:27,839 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 21 predicate places. [2025-03-04 02:28:27,840 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 69 transitions, 250 flow [2025-03-04 02:28:27,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.571428571428571) internal successors, (176), 14 states have internal predecessors, (176), 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-04 02:28:27,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:27,840 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:27,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:28:27,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:28:27,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:27,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1206019800, now seen corresponding path program 4 times [2025-03-04 02:28:27,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:27,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299383957] [2025-03-04 02:28:27,841 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:27,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:27,850 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-03-04 02:28:27,857 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 02:28:27,857 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:27,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:27,921 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-04 02:28:27,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:27,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299383957] [2025-03-04 02:28:27,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299383957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:27,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:27,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:28:27,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525397910] [2025-03-04 02:28:27,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:27,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:28:27,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:27,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:28:27,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:28:27,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 60 [2025-03-04 02:28:27,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 69 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-04 02:28:27,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:27,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 60 [2025-03-04 02:28:27,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:29,973 INFO L124 PetriNetUnfolderBase]: 32602/45048 cut-off events. [2025-03-04 02:28:29,973 INFO L125 PetriNetUnfolderBase]: For 29815/29815 co-relation queries the response was YES. [2025-03-04 02:28:30,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120816 conditions, 45048 events. 32602/45048 cut-off events. For 29815/29815 co-relation queries the response was YES. Maximal size of possible extension queue 946. Compared 265158 event pairs, 12735 based on Foata normal form. 540/45579 useless extension candidates. Maximal degree in co-relation 120775. Up to 39090 conditions per place. [2025-03-04 02:28:30,193 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 86 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2025-03-04 02:28:30,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 93 transitions, 503 flow [2025-03-04 02:28:30,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:28:30,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:28:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-03-04 02:28:30,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-03-04 02:28:30,194 INFO L175 Difference]: Start difference. First operand has 89 places, 69 transitions, 250 flow. Second operand 3 states and 102 transitions. [2025-03-04 02:28:30,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 93 transitions, 503 flow [2025-03-04 02:28:30,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 93 transitions, 487 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 02:28:30,694 INFO L231 Difference]: Finished difference. Result has 85 places, 67 transitions, 234 flow [2025-03-04 02:28:30,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=85, PETRI_TRANSITIONS=67} [2025-03-04 02:28:30,695 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 17 predicate places. [2025-03-04 02:28:30,695 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 67 transitions, 234 flow [2025-03-04 02:28:30,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-04 02:28:30,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:30,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:30,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:28:30,696 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:28:30,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:30,696 INFO L85 PathProgramCache]: Analyzing trace with hash 147480268, now seen corresponding path program 5 times [2025-03-04 02:28:30,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:30,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905189485] [2025-03-04 02:28:30,696 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:30,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:30,703 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 1 equivalence classes. [2025-03-04 02:28:30,747 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 02:28:30,747 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:28:30,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:32,098 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-04 02:28:32,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:32,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905189485] [2025-03-04 02:28:32,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905189485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:32,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:32,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 02:28:32,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281462106] [2025-03-04 02:28:32,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:32,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:28:32,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:32,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:28:32,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:28:32,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 60 [2025-03-04 02:28:32,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 67 transitions, 234 flow. Second operand has 14 states, 14 states have (on average 12.571428571428571) internal successors, (176), 14 states have internal predecessors, (176), 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-04 02:28:32,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:32,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 60 [2025-03-04 02:28:32,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:37,126 INFO L124 PetriNetUnfolderBase]: 60054/84046 cut-off events. [2025-03-04 02:28:37,127 INFO L125 PetriNetUnfolderBase]: For 48861/48861 co-relation queries the response was YES. [2025-03-04 02:28:37,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221306 conditions, 84046 events. 60054/84046 cut-off events. For 48861/48861 co-relation queries the response was YES. Maximal size of possible extension queue 1897. Compared 545885 event pairs, 9538 based on Foata normal form. 1/84038 useless extension candidates. Maximal degree in co-relation 169958. Up to 24934 conditions per place. [2025-03-04 02:28:37,546 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 291 selfloop transitions, 26 changer transitions 10/332 dead transitions. [2025-03-04 02:28:37,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 332 transitions, 1832 flow [2025-03-04 02:28:37,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:28:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:28:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 416 transitions. [2025-03-04 02:28:37,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4622222222222222 [2025-03-04 02:28:37,548 INFO L175 Difference]: Start difference. First operand has 85 places, 67 transitions, 234 flow. Second operand 15 states and 416 transitions. [2025-03-04 02:28:37,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 332 transitions, 1832 flow [2025-03-04 02:28:38,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 332 transitions, 1812 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:28:38,203 INFO L231 Difference]: Finished difference. Result has 109 places, 87 transitions, 472 flow [2025-03-04 02:28:38,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=472, PETRI_PLACES=109, PETRI_TRANSITIONS=87} [2025-03-04 02:28:38,204 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 41 predicate places. [2025-03-04 02:28:38,204 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 87 transitions, 472 flow [2025-03-04 02:28:38,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.571428571428571) internal successors, (176), 14 states have internal predecessors, (176), 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-04 02:28:38,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:38,204 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:38,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:28:38,204 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:28:38,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:38,205 INFO L85 PathProgramCache]: Analyzing trace with hash -220437026, now seen corresponding path program 6 times [2025-03-04 02:28:38,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:38,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948013662] [2025-03-04 02:28:38,205 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:38,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:38,212 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 1 equivalence classes. [2025-03-04 02:28:38,249 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 02:28:38,250 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:28:38,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:39,320 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-04 02:28:39,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:39,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948013662] [2025-03-04 02:28:39,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948013662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:39,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:39,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 02:28:39,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867921235] [2025-03-04 02:28:39,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:39,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:28:39,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:39,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:28:39,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:28:39,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 60 [2025-03-04 02:28:39,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 87 transitions, 472 flow. Second operand has 14 states, 14 states have (on average 12.571428571428571) internal successors, (176), 14 states have internal predecessors, (176), 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-04 02:28:39,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:39,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 60 [2025-03-04 02:28:39,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:47,522 INFO L124 PetriNetUnfolderBase]: 88783/125108 cut-off events. [2025-03-04 02:28:47,522 INFO L125 PetriNetUnfolderBase]: For 190066/190066 co-relation queries the response was YES. [2025-03-04 02:28:47,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380610 conditions, 125108 events. 88783/125108 cut-off events. For 190066/190066 co-relation queries the response was YES. Maximal size of possible extension queue 2790. Compared 862443 event pairs, 14208 based on Foata normal form. 1/125102 useless extension candidates. Maximal degree in co-relation 380310. Up to 36303 conditions per place. [2025-03-04 02:28:48,243 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 311 selfloop transitions, 48 changer transitions 10/374 dead transitions. [2025-03-04 02:28:48,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 374 transitions, 2595 flow [2025-03-04 02:28:48,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:28:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:28:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 413 transitions. [2025-03-04 02:28:48,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4588888888888889 [2025-03-04 02:28:48,245 INFO L175 Difference]: Start difference. First operand has 109 places, 87 transitions, 472 flow. Second operand 15 states and 413 transitions. [2025-03-04 02:28:48,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 374 transitions, 2595 flow [2025-03-04 02:28:51,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 374 transitions, 2563 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-04 02:28:51,694 INFO L231 Difference]: Finished difference. Result has 131 places, 119 transitions, 972 flow [2025-03-04 02:28:51,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=972, PETRI_PLACES=131, PETRI_TRANSITIONS=119} [2025-03-04 02:28:51,695 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 63 predicate places. [2025-03-04 02:28:51,695 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 119 transitions, 972 flow [2025-03-04 02:28:51,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.571428571428571) internal successors, (176), 14 states have internal predecessors, (176), 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-04 02:28:51,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:51,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:51,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:28:51,695 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:28:51,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1346558056, now seen corresponding path program 7 times [2025-03-04 02:28:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:51,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815063099] [2025-03-04 02:28:51,696 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:28:51,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:51,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 02:28:51,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 02:28:51,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:51,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:52,570 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-04 02:28:52,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:52,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815063099] [2025-03-04 02:28:52,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815063099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:52,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:52,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 02:28:52,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222039105] [2025-03-04 02:28:52,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:52,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:28:52,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:52,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:28:52,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:28:52,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 60 [2025-03-04 02:28:52,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 119 transitions, 972 flow. Second operand has 14 states, 14 states have (on average 12.571428571428571) internal successors, (176), 14 states have internal predecessors, (176), 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-04 02:28:52,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:52,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 60 [2025-03-04 02:28:52,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand