./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-barrier.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-barrier.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 b78dfc9c2705d92d2bcea2c224e1a0e17a9d3d516f404185e5eda6bc0d05a15c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:31:19,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:31:19,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:31:19,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:31:19,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:31:19,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:31:19,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:31:19,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:31:19,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:31:19,814 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:31:19,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:31:19,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:31:19,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:31:19,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:31:19,817 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:31:19,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:31:19,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:31:19,817 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:31:19,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:31:19,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:31:19,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:31:19,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:31:19,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:31:19,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:31:19,818 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:31:19,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:31:19,818 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:31:19,818 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:31:19,818 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:31:19,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:31:19,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:31:19,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:31:19,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:31:19,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:31:19,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:31:19,820 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:31:19,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:31:19,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:31:19,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:31:19,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:31:19,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:31:19,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:31:19,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:31:19,820 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 -> b78dfc9c2705d92d2bcea2c224e1a0e17a9d3d516f404185e5eda6bc0d05a15c [2025-03-08 17:31:20,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:31:20,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:31:20,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:31:20,027 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:31:20,028 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:31:20,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2025-03-08 17:31:21,103 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59f481e98/951bd22268384bf8a6ca306fc57111f9/FLAGdfbccd13a [2025-03-08 17:31:21,325 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:31:21,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2025-03-08 17:31:21,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59f481e98/951bd22268384bf8a6ca306fc57111f9/FLAGdfbccd13a [2025-03-08 17:31:21,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59f481e98/951bd22268384bf8a6ca306fc57111f9 [2025-03-08 17:31:21,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:31:21,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:31:21,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:31:21,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:31:21,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:31:21,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:31:21" (1/1) ... [2025-03-08 17:31:21,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b3635b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:21, skipping insertion in model container [2025-03-08 17:31:21,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:31:21" (1/1) ... [2025-03-08 17:31:21,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:31:21,521 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/parallel-barrier.wvr.c[3418,3431] [2025-03-08 17:31:21,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:31:21,536 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:31:21,562 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/parallel-barrier.wvr.c[3418,3431] [2025-03-08 17:31:21,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:31:21,574 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:31:21,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:21 WrapperNode [2025-03-08 17:31:21,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:31:21,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:31:21,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:31:21,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:31:21,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:21" (1/1) ... [2025-03-08 17:31:21,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:21" (1/1) ... [2025-03-08 17:31:21,600 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 210 [2025-03-08 17:31:21,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:31:21,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:31:21,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:31:21,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:31:21,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:21" (1/1) ... [2025-03-08 17:31:21,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:21" (1/1) ... [2025-03-08 17:31:21,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:21" (1/1) ... [2025-03-08 17:31:21,616 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-08 17:31:21,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:21" (1/1) ... [2025-03-08 17:31:21,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:21" (1/1) ... [2025-03-08 17:31:21,620 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:21" (1/1) ... [2025-03-08 17:31:21,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:21" (1/1) ... [2025-03-08 17:31:21,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:21" (1/1) ... [2025-03-08 17:31:21,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:21" (1/1) ... [2025-03-08 17:31:21,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:31:21,624 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:31:21,624 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:31:21,624 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:31:21,624 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:21" (1/1) ... [2025-03-08 17:31:21,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:31:21,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:31:21,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:31:21,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:31:21,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:31:21,663 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:31:21,663 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:31:21,663 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:31:21,663 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:31:21,663 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 17:31:21,663 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 17:31:21,663 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-08 17:31:21,663 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-08 17:31:21,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:31:21,664 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-03-08 17:31:21,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-03-08 17:31:21,664 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-03-08 17:31:21,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-03-08 17:31:21,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:31:21,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:31:21,665 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:31:21,741 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:31:21,744 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:31:22,013 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:31:22,014 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:31:22,144 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:31:22,145 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:31:22,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:31:22 BoogieIcfgContainer [2025-03-08 17:31:22,145 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:31:22,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:31:22,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:31:22,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:31:22,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:31:21" (1/3) ... [2025-03-08 17:31:22,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51816c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:31:22, skipping insertion in model container [2025-03-08 17:31:22,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:21" (2/3) ... [2025-03-08 17:31:22,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51816c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:31:22, skipping insertion in model container [2025-03-08 17:31:22,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:31:22" (3/3) ... [2025-03-08 17:31:22,153 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-barrier.wvr.c [2025-03-08 17:31:22,166 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:31:22,167 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-barrier.wvr.c that has 7 procedures, 73 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 17:31:22,167 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:31:22,250 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-03-08 17:31:22,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 82 transitions, 230 flow [2025-03-08 17:31:22,337 INFO L124 PetriNetUnfolderBase]: 4/70 cut-off events. [2025-03-08 17:31:22,339 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 17:31:22,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 70 events. 4/70 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 117 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 68. Up to 3 conditions per place. [2025-03-08 17:31:22,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 82 transitions, 230 flow [2025-03-08 17:31:22,350 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 69 transitions, 186 flow [2025-03-08 17:31:22,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:31:22,370 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;@6cb43794, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:31:22,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-08 17:31:22,399 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:31:22,402 INFO L124 PetriNetUnfolderBase]: 4/68 cut-off events. [2025-03-08 17:31:22,403 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 17:31:22,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:22,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:22,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 17:31:22,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:22,411 INFO L85 PathProgramCache]: Analyzing trace with hash -279960230, now seen corresponding path program 1 times [2025-03-08 17:31:22,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:22,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072927568] [2025-03-08 17:31:22,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:31:22,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:22,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 17:31:22,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 17:31:22,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:31:22,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:22,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:31:22,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:22,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072927568] [2025-03-08 17:31:22,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072927568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:31:22,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:31:22,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:31:22,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26801896] [2025-03-08 17:31:22,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:31:22,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:31:22,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:31:22,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:31:22,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:31:22,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 86 [2025-03-08 17:31:22,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 69 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:31:22,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:31:22,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 86 [2025-03-08 17:31:22,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:31:28,013 INFO L124 PetriNetUnfolderBase]: 90013/113964 cut-off events. [2025-03-08 17:31:28,013 INFO L125 PetriNetUnfolderBase]: For 7355/7355 co-relation queries the response was YES. [2025-03-08 17:31:28,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239389 conditions, 113964 events. 90013/113964 cut-off events. For 7355/7355 co-relation queries the response was YES. Maximal size of possible extension queue 1739. Compared 564349 event pairs, 53048 based on Foata normal form. 1984/113164 useless extension candidates. Maximal degree in co-relation 238400. Up to 76768 conditions per place. [2025-03-08 17:31:28,721 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 93 selfloop transitions, 4 changer transitions 0/98 dead transitions. [2025-03-08 17:31:28,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 98 transitions, 459 flow [2025-03-08 17:31:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:31:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:31:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-03-08 17:31:28,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46124031007751937 [2025-03-08 17:31:28,747 INFO L175 Difference]: Start difference. First operand has 84 places, 69 transitions, 186 flow. Second operand 3 states and 119 transitions. [2025-03-08 17:31:28,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 98 transitions, 459 flow [2025-03-08 17:31:29,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 98 transitions, 413 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-08 17:31:29,116 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 168 flow [2025-03-08 17:31:29,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2025-03-08 17:31:29,129 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -9 predicate places. [2025-03-08 17:31:29,130 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 168 flow [2025-03-08 17:31:29,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:31:29,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:29,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:29,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:31:29,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 17:31:29,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:29,132 INFO L85 PathProgramCache]: Analyzing trace with hash -744397046, now seen corresponding path program 2 times [2025-03-08 17:31:29,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:29,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368159365] [2025-03-08 17:31:29,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:31:29,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:29,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 1 equivalence classes. [2025-03-08 17:31:29,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 17:31:29,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:31:29,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:31:29,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:29,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368159365] [2025-03-08 17:31:29,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368159365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:31:29,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:31:29,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:31:29,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219374760] [2025-03-08 17:31:29,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:31:29,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:31:29,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:31:29,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:31:29,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:31:29,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 86 [2025-03-08 17:31:29,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:31:29,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:31:29,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 86 [2025-03-08 17:31:29,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:31:33,066 INFO L124 PetriNetUnfolderBase]: 68959/87699 cut-off events. [2025-03-08 17:31:33,066 INFO L125 PetriNetUnfolderBase]: For 4094/4094 co-relation queries the response was YES. [2025-03-08 17:31:33,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182286 conditions, 87699 events. 68959/87699 cut-off events. For 4094/4094 co-relation queries the response was YES. Maximal size of possible extension queue 1272. Compared 420777 event pairs, 40785 based on Foata normal form. 1544/87308 useless extension candidates. Maximal degree in co-relation 80231. Up to 59185 conditions per place. [2025-03-08 17:31:33,527 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 92 selfloop transitions, 4 changer transitions 0/97 dead transitions. [2025-03-08 17:31:33,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 97 transitions, 431 flow [2025-03-08 17:31:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:31:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:31:33,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-03-08 17:31:33,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4573643410852713 [2025-03-08 17:31:33,528 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 168 flow. Second operand 3 states and 118 transitions. [2025-03-08 17:31:33,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 97 transitions, 431 flow [2025-03-08 17:31:33,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 97 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:31:33,565 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 174 flow [2025-03-08 17:31:33,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2025-03-08 17:31:33,566 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -8 predicate places. [2025-03-08 17:31:33,566 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 174 flow [2025-03-08 17:31:33,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:31:33,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:33,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:33,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:31:33,566 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 17:31:33,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:33,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1264244032, now seen corresponding path program 3 times [2025-03-08 17:31:33,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:33,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903150699] [2025-03-08 17:31:33,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:31:33,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:33,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 1 equivalence classes. [2025-03-08 17:31:33,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 17:31:33,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:31:33,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:31:34,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:34,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903150699] [2025-03-08 17:31:34,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903150699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:31:34,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:31:34,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 17:31:34,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94061790] [2025-03-08 17:31:34,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:31:34,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 17:31:34,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:31:34,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 17:31:34,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-03-08 17:31:34,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 86 [2025-03-08 17:31:34,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 174 flow. Second operand has 20 states, 20 states have (on average 10.2) internal successors, (204), 20 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:31:34,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:31:34,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 86 [2025-03-08 17:31:34,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:31:41,166 INFO L124 PetriNetUnfolderBase]: 89726/114031 cut-off events. [2025-03-08 17:31:41,167 INFO L125 PetriNetUnfolderBase]: For 6910/6910 co-relation queries the response was YES. [2025-03-08 17:31:41,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241259 conditions, 114031 events. 89726/114031 cut-off events. For 6910/6910 co-relation queries the response was YES. Maximal size of possible extension queue 1473. Compared 554619 event pairs, 9751 based on Foata normal form. 2/111315 useless extension candidates. Maximal degree in co-relation 107429. Up to 69274 conditions per place. [2025-03-08 17:31:41,561 INFO L140 encePairwiseOnDemand]: 63/86 looper letters, 475 selfloop transitions, 149 changer transitions 40/665 dead transitions. [2025-03-08 17:31:41,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 665 transitions, 2929 flow [2025-03-08 17:31:41,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-08 17:31:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-08 17:31:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 974 transitions. [2025-03-08 17:31:41,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.257399577167019 [2025-03-08 17:31:41,567 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 174 flow. Second operand 44 states and 974 transitions. [2025-03-08 17:31:41,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 665 transitions, 2929 flow [2025-03-08 17:31:41,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 665 transitions, 2879 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:31:41,698 INFO L231 Difference]: Finished difference. Result has 140 places, 217 transitions, 987 flow [2025-03-08 17:31:41,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=987, PETRI_PLACES=140, PETRI_TRANSITIONS=217} [2025-03-08 17:31:41,699 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 56 predicate places. [2025-03-08 17:31:41,699 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 217 transitions, 987 flow [2025-03-08 17:31:41,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.2) internal successors, (204), 20 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:31:41,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:41,699 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:41,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:31:41,700 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 17:31:41,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:41,700 INFO L85 PathProgramCache]: Analyzing trace with hash 242518636, now seen corresponding path program 4 times [2025-03-08 17:31:41,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:41,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323829743] [2025-03-08 17:31:41,700 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:31:41,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:41,708 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-03-08 17:31:41,715 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 17:31:41,716 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:31:41,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:31:41,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:41,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323829743] [2025-03-08 17:31:41,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323829743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:31:41,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:31:41,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:31:41,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226353995] [2025-03-08 17:31:41,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:31:41,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:31:41,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:31:41,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:31:41,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:31:41,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 86 [2025-03-08 17:31:41,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 217 transitions, 987 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:31:41,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:31:41,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 86 [2025-03-08 17:31:41,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:31:47,035 INFO L124 PetriNetUnfolderBase]: 72761/92972 cut-off events. [2025-03-08 17:31:47,035 INFO L125 PetriNetUnfolderBase]: For 200575/200575 co-relation queries the response was YES. [2025-03-08 17:31:47,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285704 conditions, 92972 events. 72761/92972 cut-off events. For 200575/200575 co-relation queries the response was YES. Maximal size of possible extension queue 1144. Compared 449476 event pairs, 34524 based on Foata normal form. 1502/91968 useless extension candidates. Maximal degree in co-relation 258454. Up to 60890 conditions per place. [2025-03-08 17:31:47,644 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 285 selfloop transitions, 5 changer transitions 0/291 dead transitions. [2025-03-08 17:31:47,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 291 transitions, 1915 flow [2025-03-08 17:31:47,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:31:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:31:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-03-08 17:31:47,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2025-03-08 17:31:47,645 INFO L175 Difference]: Start difference. First operand has 140 places, 217 transitions, 987 flow. Second operand 3 states and 120 transitions. [2025-03-08 17:31:47,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 291 transitions, 1915 flow [2025-03-08 17:31:48,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 291 transitions, 1907 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-08 17:31:48,604 INFO L231 Difference]: Finished difference. Result has 142 places, 216 transitions, 1000 flow [2025-03-08 17:31:48,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=977, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1000, PETRI_PLACES=142, PETRI_TRANSITIONS=216} [2025-03-08 17:31:48,605 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 58 predicate places. [2025-03-08 17:31:48,605 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 216 transitions, 1000 flow [2025-03-08 17:31:48,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:31:48,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:48,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:48,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:31:48,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 17:31:48,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:48,606 INFO L85 PathProgramCache]: Analyzing trace with hash -936860973, now seen corresponding path program 1 times [2025-03-08 17:31:48,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:48,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810134397] [2025-03-08 17:31:48,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:31:48,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:48,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 17:31:48,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 17:31:48,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:31:48,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:31:49,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:49,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810134397] [2025-03-08 17:31:49,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810134397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:31:49,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:31:49,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 17:31:49,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220475621] [2025-03-08 17:31:49,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:31:49,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 17:31:49,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:31:49,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 17:31:49,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-03-08 17:31:49,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 86 [2025-03-08 17:31:49,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 216 transitions, 1000 flow. Second operand has 22 states, 22 states have (on average 9.909090909090908) internal successors, (218), 22 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:31:49,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:31:49,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 86 [2025-03-08 17:31:49,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand