./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/46_monabsex2_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 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:25:00,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:25:00,580 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:25:00,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:25:00,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:25:00,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:25:00,607 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:25:00,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:25:00,607 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:25:00,607 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:25:00,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:25:00,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:25:00,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:25:00,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:25:00,608 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:25:00,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:25:00,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:25:00,608 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:25:00,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:25:00,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:25:00,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:25:00,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:25:00,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:25:00,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:25:00,608 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:25:00,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:25:00,608 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:25:00,609 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:25:00,609 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:25:00,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:25:00,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:25:00,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:25:00,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:25:00,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:25:00,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:25:00,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:25:00,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:25:00,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:25:00,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:25:00,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:25:00,609 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:25:00,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:25:00,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:25:00,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:25:00,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:25:00,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:25:00,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:25:00,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:25:00,611 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 -> 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 [2025-01-09 16:25:00,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:25:00,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:25:00,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:25:00,831 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:25:00,831 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:25:00,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i [2025-01-09 16:25:01,966 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b78a05cd3/54aa2a9beed84d6c8f459a5a979a5ecf/FLAG02a3b1498 [2025-01-09 16:25:02,274 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:25:02,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i [2025-01-09 16:25:02,289 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b78a05cd3/54aa2a9beed84d6c8f459a5a979a5ecf/FLAG02a3b1498 [2025-01-09 16:25:02,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b78a05cd3/54aa2a9beed84d6c8f459a5a979a5ecf [2025-01-09 16:25:02,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:25:02,545 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:25:02,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:25:02,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:25:02,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:25:02,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:25:02" (1/1) ... [2025-01-09 16:25:02,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5a3562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:02, skipping insertion in model container [2025-01-09 16:25:02,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:25:02" (1/1) ... [2025-01-09 16:25:02,575 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:25:02,782 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/46_monabsex2_vs.i[30494,30507] [2025-01-09 16:25:02,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:25:02,798 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:25:02,834 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/46_monabsex2_vs.i[30494,30507] [2025-01-09 16:25:02,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:25:02,868 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:25:02,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:02 WrapperNode [2025-01-09 16:25:02,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:25:02,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:25:02,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:25:02,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:25:02,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:02" (1/1) ... [2025-01-09 16:25:02,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:02" (1/1) ... [2025-01-09 16:25:02,898 INFO L138 Inliner]: procedures = 168, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 16 [2025-01-09 16:25:02,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:25:02,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:25:02,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:25:02,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:25:02,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:02" (1/1) ... [2025-01-09 16:25:02,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:02" (1/1) ... [2025-01-09 16:25:02,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:02" (1/1) ... [2025-01-09 16:25:02,914 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-01-09 16:25:02,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:02" (1/1) ... [2025-01-09 16:25:02,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:02" (1/1) ... [2025-01-09 16:25:02,916 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:02" (1/1) ... [2025-01-09 16:25:02,917 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:02" (1/1) ... [2025-01-09 16:25:02,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:02" (1/1) ... [2025-01-09 16:25:02,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:02" (1/1) ... [2025-01-09 16:25:02,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:02" (1/1) ... [2025-01-09 16:25:02,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:25:02,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:25:02,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:25:02,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:25:02,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:02" (1/1) ... [2025-01-09 16:25:02,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:25:02,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:25:02,944 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-01-09 16:25:02,952 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-01-09 16:25:02,966 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 16:25:02,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 16:25:02,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:25:02,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:25:02,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:25:02,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:25:02,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:25:02,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:25:02,968 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:25:03,051 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:25:03,052 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:25:03,124 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:25:03,124 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:25:03,166 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:25:03,167 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:25:03,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:25:03 BoogieIcfgContainer [2025-01-09 16:25:03,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:25:03,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:25:03,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:25:03,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:25:03,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:25:02" (1/3) ... [2025-01-09 16:25:03,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b015a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:25:03, skipping insertion in model container [2025-01-09 16:25:03,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:25:02" (2/3) ... [2025-01-09 16:25:03,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b015a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:25:03, skipping insertion in model container [2025-01-09 16:25:03,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:25:03" (3/3) ... [2025-01-09 16:25:03,173 INFO L128 eAbstractionObserver]: Analyzing ICFG 46_monabsex2_vs.i [2025-01-09 16:25:03,183 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:25:03,184 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 46_monabsex2_vs.i that has 2 procedures, 11 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:25:03,184 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:25:03,214 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:25:03,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 14 places, 11 transitions, 26 flow [2025-01-09 16:25:03,258 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 16:25:03,261 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:25:03,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17 conditions, 13 events. 0/13 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-01-09 16:25:03,266 INFO L82 GeneralOperation]: Start removeDead. Operand has 14 places, 11 transitions, 26 flow [2025-01-09 16:25:03,267 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 14 places, 11 transitions, 26 flow [2025-01-09 16:25:03,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:25:03,283 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;@6e285d0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:25:03,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:25:03,288 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:25:03,288 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-01-09 16:25:03,288 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:25:03,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:25:03,289 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-09 16:25:03,289 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:25:03,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:25:03,293 INFO L85 PathProgramCache]: Analyzing trace with hash 95412222, now seen corresponding path program 1 times [2025-01-09 16:25:03,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:25:03,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101199645] [2025-01-09 16:25:03,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:25:03,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:25:03,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 16:25:03,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 16:25:03,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:03,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:25:03,357 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:25:03,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 16:25:03,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 16:25:03,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:03,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:25:03,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:25:03,387 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:25:03,388 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-01-09 16:25:03,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-01-09 16:25:03,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-01-09 16:25:03,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:25:03,391 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-09 16:25:03,394 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:25:03,394 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 16:25:03,409 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:25:03,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 18 transitions, 46 flow [2025-01-09 16:25:03,419 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-01-09 16:25:03,420 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:25:03,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-01-09 16:25:03,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 18 transitions, 46 flow [2025-01-09 16:25:03,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 46 flow [2025-01-09 16:25:03,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:25:03,423 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;@6e285d0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:25:03,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:25:03,430 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:25:03,430 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-01-09 16:25:03,430 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:25:03,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:25:03,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 16:25:03,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:25:03,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:25:03,430 INFO L85 PathProgramCache]: Analyzing trace with hash 112595851, now seen corresponding path program 1 times [2025-01-09 16:25:03,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:25:03,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894215595] [2025-01-09 16:25:03,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:25:03,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:25:03,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 16:25:03,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 16:25:03,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:03,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:25:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:25:03,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:25:03,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894215595] [2025-01-09 16:25:03,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894215595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:25:03,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:25:03,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 16:25:03,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193572048] [2025-01-09 16:25:03,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:25:03,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:25:03,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:25:03,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:25:03,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:25:03,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2025-01-09 16:25:03,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-01-09 16:25:03,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:25:03,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2025-01-09 16:25:03,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:25:03,657 INFO L124 PetriNetUnfolderBase]: 47/107 cut-off events. [2025-01-09 16:25:03,659 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-09 16:25:03,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 107 events. 47/107 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 361 event pairs, 15 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 111. Up to 77 conditions per place. [2025-01-09 16:25:03,662 INFO L140 encePairwiseOnDemand]: 12/18 looper letters, 15 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2025-01-09 16:25:03,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 23 transitions, 97 flow [2025-01-09 16:25:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:25:03,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:25:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-01-09 16:25:03,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2025-01-09 16:25:03,670 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 3 states and 37 transitions. [2025-01-09 16:25:03,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 23 transitions, 97 flow [2025-01-09 16:25:03,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 97 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:25:03,674 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 65 flow [2025-01-09 16:25:03,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2025-01-09 16:25:03,678 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2025-01-09 16:25:03,678 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 65 flow [2025-01-09 16:25:03,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-01-09 16:25:03,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:25:03,678 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2025-01-09 16:25:03,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:25:03,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:25:03,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:25:03,679 INFO L85 PathProgramCache]: Analyzing trace with hash 830082448, now seen corresponding path program 1 times [2025-01-09 16:25:03,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:25:03,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614973116] [2025-01-09 16:25:03,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:25:03,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:25:03,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 16:25:03,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 16:25:03,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:03,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:25:03,720 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:25:03,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 16:25:03,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 16:25:03,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:03,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:25:03,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:25:03,726 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:25:03,726 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-01-09 16:25:03,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-01-09 16:25:03,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-01-09 16:25:03,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-01-09 16:25:03,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:25:03,727 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 16:25:03,727 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:25:03,727 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 16:25:03,737 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:25:03,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 68 flow [2025-01-09 16:25:03,742 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-01-09 16:25:03,743 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 16:25:03,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 0/31 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 71 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2025-01-09 16:25:03,743 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 25 transitions, 68 flow [2025-01-09 16:25:03,743 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 68 flow [2025-01-09 16:25:03,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:25:03,744 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;@6e285d0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:25:03,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:25:03,746 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:25:03,746 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-01-09 16:25:03,746 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:25:03,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:25:03,746 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 16:25:03,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:25:03,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:25:03,747 INFO L85 PathProgramCache]: Analyzing trace with hash 136459242, now seen corresponding path program 1 times [2025-01-09 16:25:03,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:25:03,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226293476] [2025-01-09 16:25:03,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:25:03,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:25:03,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 16:25:03,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 16:25:03,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:03,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:25:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:25:03,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:25:03,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226293476] [2025-01-09 16:25:03,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226293476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:25:03,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:25:03,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 16:25:03,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062325574] [2025-01-09 16:25:03,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:25:03,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:25:03,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:25:03,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:25:03,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:25:03,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-01-09 16:25:03,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-01-09 16:25:03,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:25:03,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-01-09 16:25:03,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:25:03,963 INFO L124 PetriNetUnfolderBase]: 447/731 cut-off events. [2025-01-09 16:25:03,963 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-01-09 16:25:03,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 731 events. 447/731 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3385 event pairs, 161 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 464. Up to 653 conditions per place. [2025-01-09 16:25:03,968 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 22 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2025-01-09 16:25:03,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 148 flow [2025-01-09 16:25:03,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:25:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:25:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-01-09 16:25:03,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6933333333333334 [2025-01-09 16:25:03,970 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 68 flow. Second operand 3 states and 52 transitions. [2025-01-09 16:25:03,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 148 flow [2025-01-09 16:25:03,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 144 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-01-09 16:25:03,971 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 94 flow [2025-01-09 16:25:03,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2025-01-09 16:25:03,972 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2025-01-09 16:25:03,972 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 94 flow [2025-01-09 16:25:03,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-01-09 16:25:03,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:25:03,972 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2025-01-09 16:25:03,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:25:03,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:25:03,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:25:03,973 INFO L85 PathProgramCache]: Analyzing trace with hash -282838410, now seen corresponding path program 1 times [2025-01-09 16:25:03,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:25:03,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13447520] [2025-01-09 16:25:03,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:25:03,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:25:03,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:25:03,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:25:03,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:03,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:25:03,985 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:25:03,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:25:03,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:25:03,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:03,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:25:03,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:25:03,992 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:25:03,992 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-01-09 16:25:03,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-01-09 16:25:03,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-01-09 16:25:03,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-01-09 16:25:03,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-01-09 16:25:03,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:25:03,993 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 16:25:03,993 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:25:03,993 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 16:25:04,005 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:25:04,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 92 flow [2025-01-09 16:25:04,010 INFO L124 PetriNetUnfolderBase]: 0/40 cut-off events. [2025-01-09 16:25:04,010 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 16:25:04,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 40 events. 0/40 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 99 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-01-09 16:25:04,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 32 transitions, 92 flow [2025-01-09 16:25:04,010 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 32 transitions, 92 flow [2025-01-09 16:25:04,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:25:04,011 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;@6e285d0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:25:04,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 16:25:04,012 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:25:04,012 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-01-09 16:25:04,012 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:25:04,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:25:04,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 16:25:04,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:25:04,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:25:04,013 INFO L85 PathProgramCache]: Analyzing trace with hash 167002960, now seen corresponding path program 1 times [2025-01-09 16:25:04,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:25:04,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969525884] [2025-01-09 16:25:04,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:25:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:25:04,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 16:25:04,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 16:25:04,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:04,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:25:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:25:04,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:25:04,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969525884] [2025-01-09 16:25:04,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969525884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:25:04,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:25:04,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 16:25:04,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996402307] [2025-01-09 16:25:04,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:25:04,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:25:04,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:25:04,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:25:04,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:25:04,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-01-09 16:25:04,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:25:04,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:25:04,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-01-09 16:25:04,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:25:04,417 INFO L124 PetriNetUnfolderBase]: 3473/4901 cut-off events. [2025-01-09 16:25:04,417 INFO L125 PetriNetUnfolderBase]: For 1240/1240 co-relation queries the response was YES. [2025-01-09 16:25:04,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10386 conditions, 4901 events. 3473/4901 cut-off events. For 1240/1240 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 25236 event pairs, 1433 based on Foata normal form. 0/3983 useless extension candidates. Maximal degree in co-relation 1769. Up to 4711 conditions per place. [2025-01-09 16:25:04,447 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 29 selfloop transitions, 5 changer transitions 0/43 dead transitions. [2025-01-09 16:25:04,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 203 flow [2025-01-09 16:25:04,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:25:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:25:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-01-09 16:25:04,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2025-01-09 16:25:04,450 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 92 flow. Second operand 3 states and 67 transitions. [2025-01-09 16:25:04,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 203 flow [2025-01-09 16:25:04,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 191 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-01-09 16:25:04,452 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 123 flow [2025-01-09 16:25:04,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2025-01-09 16:25:04,453 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2025-01-09 16:25:04,453 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 123 flow [2025-01-09 16:25:04,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:25:04,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:25:04,453 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2025-01-09 16:25:04,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:25:04,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:25:04,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:25:04,456 INFO L85 PathProgramCache]: Analyzing trace with hash -301949104, now seen corresponding path program 1 times [2025-01-09 16:25:04,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:25:04,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567760301] [2025-01-09 16:25:04,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:25:04,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:25:04,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:25:04,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:25:04,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:04,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:25:04,469 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:25:04,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:25:04,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:25:04,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:04,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:25:04,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:25:04,481 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:25:04,481 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-09 16:25:04,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-01-09 16:25:04,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-01-09 16:25:04,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-01-09 16:25:04,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-01-09 16:25:04,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-01-09 16:25:04,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:25:04,482 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 16:25:04,482 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:25:04,482 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-09 16:25:04,499 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:25:04,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 39 transitions, 118 flow [2025-01-09 16:25:04,507 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2025-01-09 16:25:04,507 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-09 16:25:04,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 49 events. 0/49 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 123 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2025-01-09 16:25:04,508 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 39 transitions, 118 flow [2025-01-09 16:25:04,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 39 transitions, 118 flow [2025-01-09 16:25:04,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:25:04,510 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;@6e285d0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:25:04,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 16:25:04,511 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:25:04,511 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-01-09 16:25:04,511 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:25:04,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:25:04,511 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 16:25:04,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:25:04,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:25:04,512 INFO L85 PathProgramCache]: Analyzing trace with hash 204226429, now seen corresponding path program 1 times [2025-01-09 16:25:04,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:25:04,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870580757] [2025-01-09 16:25:04,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:25:04,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:25:04,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 16:25:04,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 16:25:04,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:04,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:25:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:25:04,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:25:04,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870580757] [2025-01-09 16:25:04,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870580757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:25:04,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:25:04,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 16:25:04,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745175902] [2025-01-09 16:25:04,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:25:04,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:25:04,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:25:04,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:25:04,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:25:04,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2025-01-09 16:25:04,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-01-09 16:25:04,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:25:04,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2025-01-09 16:25:04,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:25:06,300 INFO L124 PetriNetUnfolderBase]: 24009/31313 cut-off events. [2025-01-09 16:25:06,301 INFO L125 PetriNetUnfolderBase]: For 9784/9784 co-relation queries the response was YES. [2025-01-09 16:25:06,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66523 conditions, 31313 events. 24009/31313 cut-off events. For 9784/9784 co-relation queries the response was YES. Maximal size of possible extension queue 1441. Compared 169650 event pairs, 11031 based on Foata normal form. 0/24923 useless extension candidates. Maximal degree in co-relation 10509. Up to 30867 conditions per place. [2025-01-09 16:25:06,498 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 36 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2025-01-09 16:25:06,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 262 flow [2025-01-09 16:25:06,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:25:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:25:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2025-01-09 16:25:06,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7008547008547008 [2025-01-09 16:25:06,500 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 118 flow. Second operand 3 states and 82 transitions. [2025-01-09 16:25:06,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 262 flow [2025-01-09 16:25:06,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 238 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-01-09 16:25:06,510 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 152 flow [2025-01-09 16:25:06,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2025-01-09 16:25:06,511 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-01-09 16:25:06,513 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 152 flow [2025-01-09 16:25:06,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-01-09 16:25:06,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:25:06,513 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:25:06,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:25:06,513 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:25:06,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:25:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash 836515652, now seen corresponding path program 1 times [2025-01-09 16:25:06,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:25:06,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776517685] [2025-01-09 16:25:06,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:25:06,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:25:06,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:25:06,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:25:06,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:06,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:25:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:25:06,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:25:06,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776517685] [2025-01-09 16:25:06,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776517685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:25:06,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:25:06,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:25:06,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906438978] [2025-01-09 16:25:06,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:25:06,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:25:06,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:25:06,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:25:06,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:25:06,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2025-01-09 16:25:06,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-01-09 16:25:06,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:25:06,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2025-01-09 16:25:06,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:25:07,663 INFO L124 PetriNetUnfolderBase]: 13439/19846 cut-off events. [2025-01-09 16:25:07,664 INFO L125 PetriNetUnfolderBase]: For 7894/7894 co-relation queries the response was YES. [2025-01-09 16:25:07,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41509 conditions, 19846 events. 13439/19846 cut-off events. For 7894/7894 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 134982 event pairs, 5255 based on Foata normal form. 5668/24391 useless extension candidates. Maximal degree in co-relation 32130. Up to 15240 conditions per place. [2025-01-09 16:25:07,750 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 32 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-01-09 16:25:07,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 256 flow [2025-01-09 16:25:07,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:25:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:25:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-01-09 16:25:07,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2025-01-09 16:25:07,754 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 152 flow. Second operand 3 states and 75 transitions. [2025-01-09 16:25:07,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 256 flow [2025-01-09 16:25:07,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:25:07,757 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 161 flow [2025-01-09 16:25:07,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2025-01-09 16:25:07,758 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2025-01-09 16:25:07,758 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 161 flow [2025-01-09 16:25:07,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-01-09 16:25:07,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:25:07,758 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:25:07,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:25:07,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:25:07,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:25:07,759 INFO L85 PathProgramCache]: Analyzing trace with hash -895003458, now seen corresponding path program 1 times [2025-01-09 16:25:07,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:25:07,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733216913] [2025-01-09 16:25:07,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:25:07,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:25:07,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 16:25:07,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 16:25:07,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:07,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:25:07,769 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:25:07,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 16:25:07,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 16:25:07,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:07,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:25:07,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:25:07,778 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:25:07,778 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-01-09 16:25:07,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-01-09 16:25:07,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-01-09 16:25:07,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-01-09 16:25:07,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-01-09 16:25:07,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-01-09 16:25:07,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-01-09 16:25:07,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:25:07,779 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 16:25:07,780 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:25:07,780 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-01-09 16:25:07,797 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:25:07,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 46 transitions, 146 flow [2025-01-09 16:25:07,802 INFO L124 PetriNetUnfolderBase]: 0/58 cut-off events. [2025-01-09 16:25:07,802 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-09 16:25:07,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 58 events. 0/58 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 151 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2025-01-09 16:25:07,803 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 46 transitions, 146 flow [2025-01-09 16:25:07,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 46 transitions, 146 flow [2025-01-09 16:25:07,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:25:07,804 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;@6e285d0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:25:07,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-09 16:25:07,805 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:25:07,805 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-01-09 16:25:07,805 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:25:07,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:25:07,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 16:25:07,806 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:25:07,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:25:07,807 INFO L85 PathProgramCache]: Analyzing trace with hash 248130225, now seen corresponding path program 1 times [2025-01-09 16:25:07,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:25:07,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374041494] [2025-01-09 16:25:07,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:25:07,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:25:07,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 16:25:07,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 16:25:07,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:07,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:25:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:25:07,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:25:07,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374041494] [2025-01-09 16:25:07,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374041494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:25:07,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:25:07,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 16:25:07,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794036044] [2025-01-09 16:25:07,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:25:07,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:25:07,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:25:07,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:25:07,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:25:07,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-01-09 16:25:07,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-01-09 16:25:07,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:25:07,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-01-09 16:25:07,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:25:15,598 INFO L124 PetriNetUnfolderBase]: 153983/191303 cut-off events. [2025-01-09 16:25:15,598 INFO L125 PetriNetUnfolderBase]: For 71426/71426 co-relation queries the response was YES. [2025-01-09 16:25:15,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406806 conditions, 191303 events. 153983/191303 cut-off events. For 71426/71426 co-relation queries the response was YES. Maximal size of possible extension queue 6618. Compared 1069192 event pairs, 76663 based on Foata normal form. 0/150265 useless extension candidates. Maximal degree in co-relation 67205. Up to 190281 conditions per place. [2025-01-09 16:25:16,761 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 43 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-01-09 16:25:16,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 325 flow [2025-01-09 16:25:16,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:25:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:25:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-01-09 16:25:16,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7028985507246377 [2025-01-09 16:25:16,763 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 146 flow. Second operand 3 states and 97 transitions. [2025-01-09 16:25:16,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 325 flow [2025-01-09 16:25:16,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 63 transitions, 285 flow, removed 20 selfloop flow, removed 0 redundant places. [2025-01-09 16:25:16,801 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 181 flow [2025-01-09 16:25:16,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2025-01-09 16:25:16,802 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2025-01-09 16:25:16,802 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 181 flow [2025-01-09 16:25:16,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-01-09 16:25:16,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:25:16,802 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:25:16,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:25:16,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:25:16,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:25:16,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1935727870, now seen corresponding path program 1 times [2025-01-09 16:25:16,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:25:16,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338527136] [2025-01-09 16:25:16,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:25:16,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:25:16,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:25:16,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:25:16,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:16,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:25:16,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:25:16,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:25:16,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338527136] [2025-01-09 16:25:16,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338527136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:25:16,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:25:16,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:25:16,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120057345] [2025-01-09 16:25:16,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:25:16,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:25:16,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:25:16,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:25:16,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:25:16,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-01-09 16:25:16,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-01-09 16:25:16,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:25:16,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-01-09 16:25:16,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:25:21,735 INFO L124 PetriNetUnfolderBase]: 78146/108409 cut-off events. [2025-01-09 16:25:21,735 INFO L125 PetriNetUnfolderBase]: For 48322/48322 co-relation queries the response was YES. [2025-01-09 16:25:22,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224306 conditions, 108409 events. 78146/108409 cut-off events. For 48322/48322 co-relation queries the response was YES. Maximal size of possible extension queue 4489. Compared 791079 event pairs, 35211 based on Foata normal form. 34312/134944 useless extension candidates. Maximal degree in co-relation 175157. Up to 83683 conditions per place. [2025-01-09 16:25:22,736 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 38 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2025-01-09 16:25:22,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 63 transitions, 306 flow [2025-01-09 16:25:22,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:25:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:25:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-01-09 16:25:22,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.644927536231884 [2025-01-09 16:25:22,738 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 181 flow. Second operand 3 states and 89 transitions. [2025-01-09 16:25:22,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 63 transitions, 306 flow [2025-01-09 16:25:22,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:25:22,748 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 192 flow [2025-01-09 16:25:22,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2025-01-09 16:25:22,749 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2025-01-09 16:25:22,750 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 192 flow [2025-01-09 16:25:22,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-01-09 16:25:22,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:25:22,750 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:25:22,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:25:22,750 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:25:22,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:25:22,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1244549984, now seen corresponding path program 1 times [2025-01-09 16:25:22,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:25:22,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799391095] [2025-01-09 16:25:22,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:25:22,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:25:22,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 16:25:22,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:25:22,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:22,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:25:22,779 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:25:22,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 16:25:22,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:25:22,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:22,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:25:22,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:25:22,797 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:25:22,797 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-01-09 16:25:22,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-01-09 16:25:22,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-01-09 16:25:22,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-01-09 16:25:22,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-01-09 16:25:22,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-01-09 16:25:22,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-01-09 16:25:22,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-01-09 16:25:22,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:25:22,797 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 16:25:22,804 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:25:22,804 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-01-09 16:25:22,842 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:25:22,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 53 transitions, 176 flow [2025-01-09 16:25:22,856 INFO L124 PetriNetUnfolderBase]: 0/67 cut-off events. [2025-01-09 16:25:22,860 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-09 16:25:22,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 67 events. 0/67 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 194 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2025-01-09 16:25:22,861 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 53 transitions, 176 flow [2025-01-09 16:25:22,861 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 53 transitions, 176 flow [2025-01-09 16:25:22,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:25:22,862 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;@6e285d0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:25:22,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-09 16:25:22,863 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:25:22,863 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-01-09 16:25:22,863 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:25:22,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:25:22,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 16:25:22,863 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-01-09 16:25:22,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:25:22,865 INFO L85 PathProgramCache]: Analyzing trace with hash 298714732, now seen corresponding path program 1 times [2025-01-09 16:25:22,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:25:22,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152691695] [2025-01-09 16:25:22,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:25:22,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:25:22,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 16:25:22,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 16:25:22,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:25:22,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:25:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:25:22,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:25:22,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152691695] [2025-01-09 16:25:22,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152691695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:25:22,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:25:22,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 16:25:22,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374116308] [2025-01-09 16:25:22,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:25:22,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:25:22,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:25:22,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:25:22,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:25:22,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2025-01-09 16:25:22,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-01-09 16:25:22,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:25:22,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2025-01-09 16:25:22,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand