./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:56:56,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:56:56,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 00:56:56,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:56:56,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:56:56,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:56:56,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:56:56,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:56:56,119 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:56:56,119 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:56:56,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:56:56,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:56:56,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:56:56,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:56:56,120 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:56:56,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:56:56,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:56:56,120 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 00:56:56,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:56:56,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 00:56:56,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:56:56,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:56:56,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:56:56,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:56:56,120 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 00:56:56,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:56:56,121 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:56:56,121 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:56:56,121 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:56:56,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:56:56,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:56:56,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:56:56,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:56:56,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:56:56,121 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:56:56,121 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:56:56,121 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:56:56,121 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:56:56,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:56:56,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:56:56,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:56:56,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:56:56,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:56:56,122 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-jdk21/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 -> d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d [2025-02-08 00:56:56,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:56:56,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:56:56,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:56:56,353 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:56:56,353 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:56:56,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-02-08 00:56:57,464 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d00113e2/f826f2ae5ef149b087c6cdc825eb82f6/FLAG9014ffc3a [2025-02-08 00:56:57,683 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:56:57,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-02-08 00:56:57,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d00113e2/f826f2ae5ef149b087c6cdc825eb82f6/FLAG9014ffc3a [2025-02-08 00:56:58,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d00113e2/f826f2ae5ef149b087c6cdc825eb82f6 [2025-02-08 00:56:58,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:56:58,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:56:58,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:56:58,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:56:58,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:56:58,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:56:58" (1/1) ... [2025-02-08 00:56:58,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@570e8dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:58, skipping insertion in model container [2025-02-08 00:56:58,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:56:58" (1/1) ... [2025-02-08 00:56:58,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:56:58,280 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i[30640,30653] [2025-02-08 00:56:58,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:56:58,300 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:56:58,337 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i[30640,30653] [2025-02-08 00:56:58,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:56:58,367 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:56:58,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:58 WrapperNode [2025-02-08 00:56:58,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:56:58,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:56:58,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:56:58,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:56:58,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:58" (1/1) ... [2025-02-08 00:56:58,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:58" (1/1) ... [2025-02-08 00:56:58,390 INFO L138 Inliner]: procedures = 162, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2025-02-08 00:56:58,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:56:58,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:56:58,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:56:58,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:56:58,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:58" (1/1) ... [2025-02-08 00:56:58,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:58" (1/1) ... [2025-02-08 00:56:58,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:58" (1/1) ... [2025-02-08 00:56:58,405 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-02-08 00:56:58,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:58" (1/1) ... [2025-02-08 00:56:58,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:58" (1/1) ... [2025-02-08 00:56:58,407 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:58" (1/1) ... [2025-02-08 00:56:58,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:58" (1/1) ... [2025-02-08 00:56:58,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:58" (1/1) ... [2025-02-08 00:56:58,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:58" (1/1) ... [2025-02-08 00:56:58,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:56:58,411 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:56:58,411 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:56:58,411 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:56:58,412 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:58" (1/1) ... [2025-02-08 00:56:58,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:56:58,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:56:58,433 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:56:58,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:56:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-02-08 00:56:58,449 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-02-08 00:56:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 00:56:58,449 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 00:56:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 00:56:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:56:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:56:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 00:56:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 00:56:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:56:58,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:56:58,451 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 00:56:58,538 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:56:58,539 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:56:58,661 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 00:56:58,661 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:56:58,733 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:56:58,734 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:56:58,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:56:58 BoogieIcfgContainer [2025-02-08 00:56:58,737 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:56:58,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:56:58,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:56:58,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:56:58,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:56:58" (1/3) ... [2025-02-08 00:56:58,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7bb03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:56:58, skipping insertion in model container [2025-02-08 00:56:58,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:56:58" (2/3) ... [2025-02-08 00:56:58,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7bb03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:56:58, skipping insertion in model container [2025-02-08 00:56:58,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:56:58" (3/3) ... [2025-02-08 00:56:58,745 INFO L128 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2025-02-08 00:56:58,756 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:56:58,757 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 31_simple_loop5_vs.i that has 3 procedures, 24 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-08 00:56:58,757 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 00:56:58,790 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:56:58,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 62 flow [2025-02-08 00:56:58,839 INFO L124 PetriNetUnfolderBase]: 3/28 cut-off events. [2025-02-08 00:56:58,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:56:58,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 3/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 63 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-02-08 00:56:58,844 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 62 flow [2025-02-08 00:56:58,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 59 flow [2025-02-08 00:56:58,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:56:58,858 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;@3d256e5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:56:58,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 00:56:58,863 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:56:58,863 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2025-02-08 00:56:58,863 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:56:58,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:56:58,864 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 00:56:58,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 00:56:58,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:56:58,867 INFO L85 PathProgramCache]: Analyzing trace with hash -58623215, now seen corresponding path program 1 times [2025-02-08 00:56:58,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:56:58,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316410808] [2025-02-08 00:56:58,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:56:58,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:56:58,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 00:56:58,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 00:56:58,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:58,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:56:58,936 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:56:58,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 00:56:58,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 00:56:58,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:58,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:56:58,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:56:58,959 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:56:58,960 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-02-08 00:56:58,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-02-08 00:56:58,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-02-08 00:56:58,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-02-08 00:56:58,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:56:58,962 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-08 00:56:58,964 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:56:58,964 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 00:56:58,979 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:56:58,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 47 transitions, 114 flow [2025-02-08 00:56:58,994 INFO L124 PetriNetUnfolderBase]: 4/39 cut-off events. [2025-02-08 00:56:58,994 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 00:56:58,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 39 events. 4/39 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 83 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 46. Up to 3 conditions per place. [2025-02-08 00:56:58,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 47 transitions, 114 flow [2025-02-08 00:56:58,995 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 34 transitions, 81 flow [2025-02-08 00:56:58,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:56:58,996 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;@3d256e5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:56:58,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 00:56:59,003 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:56:59,004 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-02-08 00:56:59,004 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 00:56:59,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:56:59,004 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:56:59,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 00:56:59,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:56:59,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1079813189, now seen corresponding path program 1 times [2025-02-08 00:56:59,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:56:59,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985735959] [2025-02-08 00:56:59,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:56:59,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:56:59,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 00:56:59,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 00:56:59,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:59,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:56:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:56:59,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:56:59,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985735959] [2025-02-08 00:56:59,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985735959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:56:59,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:56:59,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 00:56:59,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383838887] [2025-02-08 00:56:59,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:56:59,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 00:56:59,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:56:59,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 00:56:59,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:56:59,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2025-02-08 00:56:59,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-02-08 00:56:59,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:56:59,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2025-02-08 00:56:59,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:56:59,461 INFO L124 PetriNetUnfolderBase]: 1203/2092 cut-off events. [2025-02-08 00:56:59,462 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-02-08 00:56:59,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3877 conditions, 2092 events. 1203/2092 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12175 event pairs, 303 based on Foata normal form. 634/2619 useless extension candidates. Maximal degree in co-relation 3866. Up to 1003 conditions per place. [2025-02-08 00:56:59,487 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 25 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2025-02-08 00:56:59,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 158 flow [2025-02-08 00:56:59,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 00:56:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 00:56:59,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-02-08 00:56:59,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2025-02-08 00:56:59,500 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 81 flow. Second operand 3 states and 93 transitions. [2025-02-08 00:56:59,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 158 flow [2025-02-08 00:56:59,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 00:56:59,507 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 100 flow [2025-02-08 00:56:59,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-02-08 00:56:59,514 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2025-02-08 00:56:59,514 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 100 flow [2025-02-08 00:56:59,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-02-08 00:56:59,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:56:59,514 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 00:56:59,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:56:59,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 00:56:59,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:56:59,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1123799213, now seen corresponding path program 1 times [2025-02-08 00:56:59,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:56:59,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208384565] [2025-02-08 00:56:59,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:56:59,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:56:59,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 00:56:59,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 00:56:59,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:59,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:56:59,533 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:56:59,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 00:56:59,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 00:56:59,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:59,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:56:59,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:56:59,552 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:56:59,553 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-08 00:56:59,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-08 00:56:59,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-02-08 00:56:59,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-02-08 00:56:59,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-02-08 00:56:59,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:56:59,555 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 00:56:59,556 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:56:59,556 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 00:56:59,575 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:56:59,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 67 transitions, 170 flow [2025-02-08 00:56:59,584 INFO L124 PetriNetUnfolderBase]: 5/50 cut-off events. [2025-02-08 00:56:59,584 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 00:56:59,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 50 events. 5/50 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 114 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 61. Up to 4 conditions per place. [2025-02-08 00:56:59,585 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 67 transitions, 170 flow [2025-02-08 00:56:59,585 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 42 transitions, 105 flow [2025-02-08 00:56:59,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:56:59,586 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;@3d256e5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:56:59,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 00:56:59,588 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:56:59,589 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-02-08 00:56:59,589 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 00:56:59,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:56:59,589 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:56:59,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 00:56:59,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:56:59,590 INFO L85 PathProgramCache]: Analyzing trace with hash -880479656, now seen corresponding path program 1 times [2025-02-08 00:56:59,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:56:59,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785245880] [2025-02-08 00:56:59,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:56:59,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:56:59,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 00:56:59,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 00:56:59,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:59,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:56:59,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:56:59,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:56:59,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785245880] [2025-02-08 00:56:59,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785245880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:56:59,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:56:59,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 00:56:59,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301278713] [2025-02-08 00:56:59,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:56:59,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 00:56:59,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:56:59,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 00:56:59,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:56:59,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 67 [2025-02-08 00:56:59,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-02-08 00:56:59,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:56:59,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 67 [2025-02-08 00:56:59,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:57:00,441 INFO L124 PetriNetUnfolderBase]: 6995/10809 cut-off events. [2025-02-08 00:57:00,441 INFO L125 PetriNetUnfolderBase]: For 1030/1030 co-relation queries the response was YES. [2025-02-08 00:57:00,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20440 conditions, 10809 events. 6995/10809 cut-off events. For 1030/1030 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 70791 event pairs, 1712 based on Foata normal form. 3675/13949 useless extension candidates. Maximal degree in co-relation 20428. Up to 5767 conditions per place. [2025-02-08 00:57:00,517 INFO L140 encePairwiseOnDemand]: 55/67 looper letters, 32 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2025-02-08 00:57:00,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 211 flow [2025-02-08 00:57:00,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 00:57:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 00:57:00,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-02-08 00:57:00,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6318407960199005 [2025-02-08 00:57:00,521 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 105 flow. Second operand 3 states and 127 transitions. [2025-02-08 00:57:00,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 211 flow [2025-02-08 00:57:00,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 206 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 00:57:00,525 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 128 flow [2025-02-08 00:57:00,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-02-08 00:57:00,526 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2025-02-08 00:57:00,526 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 128 flow [2025-02-08 00:57:00,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-02-08 00:57:00,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:57:00,526 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:57:00,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:57:00,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 00:57:00,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:57:00,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1665447126, now seen corresponding path program 1 times [2025-02-08 00:57:00,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:57:00,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110986414] [2025-02-08 00:57:00,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:57:00,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:57:00,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 00:57:00,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 00:57:00,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:00,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:57:00,545 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:57:00,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 00:57:00,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 00:57:00,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:00,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:57:00,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:57:00,555 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:57:00,555 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-08 00:57:00,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-02-08 00:57:00,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-02-08 00:57:00,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-02-08 00:57:00,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-02-08 00:57:00,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-08 00:57:00,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:57:00,556 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 00:57:00,558 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:57:00,558 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 00:57:00,588 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:57:00,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 87 transitions, 230 flow [2025-02-08 00:57:00,599 INFO L124 PetriNetUnfolderBase]: 6/61 cut-off events. [2025-02-08 00:57:00,599 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 00:57:00,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 61 events. 6/61 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 138 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 77. Up to 5 conditions per place. [2025-02-08 00:57:00,600 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 87 transitions, 230 flow [2025-02-08 00:57:00,601 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 50 transitions, 131 flow [2025-02-08 00:57:00,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:57:00,603 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;@3d256e5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:57:00,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 00:57:00,606 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:57:00,606 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-02-08 00:57:00,606 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 00:57:00,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:57:00,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:57:00,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:57:00,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:57:00,607 INFO L85 PathProgramCache]: Analyzing trace with hash -857012597, now seen corresponding path program 1 times [2025-02-08 00:57:00,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:57:00,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377471975] [2025-02-08 00:57:00,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:57:00,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:57:00,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 00:57:00,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 00:57:00,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:00,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:57:00,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:57:00,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:57:00,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377471975] [2025-02-08 00:57:00,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377471975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:57:00,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:57:00,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 00:57:00,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295431765] [2025-02-08 00:57:00,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:57:00,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 00:57:00,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:57:00,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 00:57:00,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:57:00,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 87 [2025-02-08 00:57:00,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:57:00,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:57:00,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 87 [2025-02-08 00:57:00,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:57:03,467 INFO L124 PetriNetUnfolderBase]: 36336/51963 cut-off events. [2025-02-08 00:57:03,468 INFO L125 PetriNetUnfolderBase]: For 7744/7744 co-relation queries the response was YES. [2025-02-08 00:57:03,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99688 conditions, 51963 events. 36336/51963 cut-off events. For 7744/7744 co-relation queries the response was YES. Maximal size of possible extension queue 2139. Compared 363371 event pairs, 9261 based on Foata normal form. 18927/68428 useless extension candidates. Maximal degree in co-relation 99675. Up to 29392 conditions per place. [2025-02-08 00:57:03,732 INFO L140 encePairwiseOnDemand]: 73/87 looper letters, 39 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2025-02-08 00:57:03,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 63 transitions, 268 flow [2025-02-08 00:57:03,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 00:57:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 00:57:03,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2025-02-08 00:57:03,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6168582375478927 [2025-02-08 00:57:03,733 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 131 flow. Second operand 3 states and 161 transitions. [2025-02-08 00:57:03,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 63 transitions, 268 flow [2025-02-08 00:57:03,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 63 transitions, 255 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-08 00:57:03,738 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 156 flow [2025-02-08 00:57:03,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2025-02-08 00:57:03,738 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2025-02-08 00:57:03,739 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 156 flow [2025-02-08 00:57:03,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:57:03,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:57:03,739 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:57:03,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:57:03,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:57:03,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:57:03,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1698117103, now seen corresponding path program 1 times [2025-02-08 00:57:03,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:57:03,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378941709] [2025-02-08 00:57:03,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:57:03,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:57:03,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 00:57:03,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 00:57:03,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:03,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:57:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:57:03,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:57:03,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378941709] [2025-02-08 00:57:03,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378941709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:57:03,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:57:03,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:57:03,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422745060] [2025-02-08 00:57:03,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:57:03,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:57:03,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:57:03,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:57:03,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:57:03,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 87 [2025-02-08 00:57:03,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:57:03,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:57:03,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 87 [2025-02-08 00:57:03,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:57:07,015 INFO L124 PetriNetUnfolderBase]: 43697/64283 cut-off events. [2025-02-08 00:57:07,015 INFO L125 PetriNetUnfolderBase]: For 19152/19152 co-relation queries the response was YES. [2025-02-08 00:57:07,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139026 conditions, 64283 events. 43697/64283 cut-off events. For 19152/19152 co-relation queries the response was YES. Maximal size of possible extension queue 2833. Compared 487460 event pairs, 5040 based on Foata normal form. 372/63210 useless extension candidates. Maximal degree in co-relation 139010. Up to 31321 conditions per place. [2025-02-08 00:57:07,373 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 52 selfloop transitions, 14 changer transitions 0/84 dead transitions. [2025-02-08 00:57:07,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 420 flow [2025-02-08 00:57:07,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:57:07,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 00:57:07,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2025-02-08 00:57:07,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2025-02-08 00:57:07,377 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 156 flow. Second operand 4 states and 198 transitions. [2025-02-08 00:57:07,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 420 flow [2025-02-08 00:57:07,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 84 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 00:57:07,403 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 243 flow [2025-02-08 00:57:07,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=243, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2025-02-08 00:57:07,405 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2025-02-08 00:57:07,405 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 243 flow [2025-02-08 00:57:07,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:57:07,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:57:07,405 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:57:07,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:57:07,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:57:07,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:57:07,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1310878858, now seen corresponding path program 1 times [2025-02-08 00:57:07,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:57:07,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740626777] [2025-02-08 00:57:07,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:57:07,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:57:07,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 00:57:07,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 00:57:07,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:07,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:57:07,427 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:57:07,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 00:57:07,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 00:57:07,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:07,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:57:07,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:57:07,441 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:57:07,442 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-02-08 00:57:07,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-02-08 00:57:07,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-02-08 00:57:07,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-02-08 00:57:07,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-02-08 00:57:07,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-02-08 00:57:07,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-02-08 00:57:07,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:57:07,442 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 00:57:07,443 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:57:07,443 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-08 00:57:07,478 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:57:07,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 107 transitions, 294 flow [2025-02-08 00:57:07,486 INFO L124 PetriNetUnfolderBase]: 7/72 cut-off events. [2025-02-08 00:57:07,486 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-08 00:57:07,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 72 events. 7/72 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 163 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 94. Up to 6 conditions per place. [2025-02-08 00:57:07,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 107 transitions, 294 flow [2025-02-08 00:57:07,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 58 transitions, 159 flow [2025-02-08 00:57:07,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:57:07,489 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;@3d256e5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:57:07,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 00:57:07,490 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:57:07,492 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-02-08 00:57:07,492 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 00:57:07,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:57:07,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:57:07,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-08 00:57:07,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:57:07,493 INFO L85 PathProgramCache]: Analyzing trace with hash -151457698, now seen corresponding path program 1 times [2025-02-08 00:57:07,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:57:07,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458408709] [2025-02-08 00:57:07,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:57:07,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:57:07,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 00:57:07,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 00:57:07,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:07,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:57:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:57:07,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:57:07,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458408709] [2025-02-08 00:57:07,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458408709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:57:07,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:57:07,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 00:57:07,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840558053] [2025-02-08 00:57:07,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:57:07,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 00:57:07,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:57:07,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 00:57:07,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:57:07,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 107 [2025-02-08 00:57:07,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-02-08 00:57:07,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:57:07,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 107 [2025-02-08 00:57:07,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:57:19,846 INFO L124 PetriNetUnfolderBase]: 178118/241010 cut-off events. [2025-02-08 00:57:19,846 INFO L125 PetriNetUnfolderBase]: For 49477/49477 co-relation queries the response was YES. [2025-02-08 00:57:20,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467529 conditions, 241010 events. 178118/241010 cut-off events. For 49477/49477 co-relation queries the response was YES. Maximal size of possible extension queue 8196. Compared 1753766 event pairs, 48026 based on Foata normal form. 92131/322550 useless extension candidates. Maximal degree in co-relation 467515. Up to 141658 conditions per place. [2025-02-08 00:57:21,276 INFO L140 encePairwiseOnDemand]: 91/107 looper letters, 46 selfloop transitions, 7 changer transitions 0/74 dead transitions. [2025-02-08 00:57:21,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 329 flow [2025-02-08 00:57:21,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 00:57:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 00:57:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2025-02-08 00:57:21,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6074766355140186 [2025-02-08 00:57:21,277 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 159 flow. Second operand 3 states and 195 transitions. [2025-02-08 00:57:21,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 329 flow [2025-02-08 00:57:21,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 304 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-02-08 00:57:21,295 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 184 flow [2025-02-08 00:57:21,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-02-08 00:57:21,296 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -4 predicate places. [2025-02-08 00:57:21,296 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 184 flow [2025-02-08 00:57:21,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-02-08 00:57:21,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:57:21,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:57:21,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:57:21,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-08 00:57:21,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:57:21,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1627324505, now seen corresponding path program 1 times [2025-02-08 00:57:21,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:57:21,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289140627] [2025-02-08 00:57:21,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:57:21,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:57:21,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 00:57:21,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 00:57:21,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:21,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:57:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:57:21,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:57:21,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289140627] [2025-02-08 00:57:21,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289140627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:57:21,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:57:21,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:57:21,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042276336] [2025-02-08 00:57:21,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:57:21,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:57:21,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:57:21,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:57:21,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:57:21,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 107 [2025-02-08 00:57:21,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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-02-08 00:57:21,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:57:21,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 107 [2025-02-08 00:57:21,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand