./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.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/11_fmaxsymopt-zero.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 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:23:07,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:23:07,276 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:23:07,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:23:07,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:23:07,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:23:07,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:23:07,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:23:07,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:23:07,295 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:23:07,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:23:07,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:23:07,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:23:07,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:23:07,296 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:23:07,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:23:07,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:23:07,297 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:23:07,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:23:07,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:23:07,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:23:07,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:23:07,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:23:07,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:23:07,298 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:23:07,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:23:07,298 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:23:07,298 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:23:07,298 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:23:07,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:23:07,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:23:07,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:23:07,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:23:07,298 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:23:07,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:23:07,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:23:07,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:23:07,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:23:07,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:23:07,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:23:07,298 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:23:07,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:23:07,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:23:07,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:23:07,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:23:07,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:23:07,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:23:07,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:23:07,299 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 -> 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb [2025-01-09 16:23:07,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:23:07,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:23:07,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:23:07,486 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:23:07,486 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:23:07,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-01-09 16:23:08,670 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c27487c2/4ec35664bb1341d4af61599b22751c6a/FLAG65a0ce704 [2025-01-09 16:23:08,949 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:23:08,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-01-09 16:23:08,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c27487c2/4ec35664bb1341d4af61599b22751c6a/FLAG65a0ce704 [2025-01-09 16:23:09,249 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c27487c2/4ec35664bb1341d4af61599b22751c6a [2025-01-09 16:23:09,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:23:09,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:23:09,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:23:09,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:23:09,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:23:09,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:23:09" (1/1) ... [2025-01-09 16:23:09,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba7706c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:09, skipping insertion in model container [2025-01-09 16:23:09,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:23:09" (1/1) ... [2025-01-09 16:23:09,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:23:09,477 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/11_fmaxsymopt-zero.i[30843,30856] [2025-01-09 16:23:09,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:23:09,496 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:23:09,526 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/11_fmaxsymopt-zero.i[30843,30856] [2025-01-09 16:23:09,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:23:09,560 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:23:09,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:09 WrapperNode [2025-01-09 16:23:09,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:23:09,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:23:09,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:23:09,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:23:09,570 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:23:09" (1/1) ... [2025-01-09 16:23:09,582 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:23:09" (1/1) ... [2025-01-09 16:23:09,595 INFO L138 Inliner]: procedures = 164, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2025-01-09 16:23:09,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:23:09,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:23:09,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:23:09,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:23:09,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:09" (1/1) ... [2025-01-09 16:23:09,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:09" (1/1) ... [2025-01-09 16:23:09,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:09" (1/1) ... [2025-01-09 16:23:09,616 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-01-09 16:23:09,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:09" (1/1) ... [2025-01-09 16:23:09,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:09" (1/1) ... [2025-01-09 16:23:09,625 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:09" (1/1) ... [2025-01-09 16:23:09,626 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:09" (1/1) ... [2025-01-09 16:23:09,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:09" (1/1) ... [2025-01-09 16:23:09,632 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:09" (1/1) ... [2025-01-09 16:23:09,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:09" (1/1) ... [2025-01-09 16:23:09,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:23:09,638 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:23:09,638 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:23:09,638 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:23:09,639 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:09" (1/1) ... [2025-01-09 16:23:09,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:23:09,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:23:09,672 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:23:09,678 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:23:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:23:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:23:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 16:23:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 16:23:09,695 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 16:23:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:23:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:23:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:23:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:23:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 16:23:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:23:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:23:09,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:23:09,697 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:23:09,778 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:23:09,779 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:23:09,887 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:23:09,887 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:23:10,025 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:23:10,026 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:23:10,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:23:10 BoogieIcfgContainer [2025-01-09 16:23:10,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:23:10,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:23:10,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:23:10,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:23:10,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:23:09" (1/3) ... [2025-01-09 16:23:10,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1a9a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:23:10, skipping insertion in model container [2025-01-09 16:23:10,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:09" (2/3) ... [2025-01-09 16:23:10,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1a9a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:23:10, skipping insertion in model container [2025-01-09 16:23:10,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:23:10" (3/3) ... [2025-01-09 16:23:10,034 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-zero.i [2025-01-09 16:23:10,044 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:23:10,045 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt-zero.i that has 2 procedures, 17 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 16:23:10,046 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:23:10,077 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:23:10,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 20 transitions, 44 flow [2025-01-09 16:23:10,127 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-01-09 16:23:10,129 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:23:10,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-01-09 16:23:10,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 20 transitions, 44 flow [2025-01-09 16:23:10,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 20 transitions, 44 flow [2025-01-09 16:23:10,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:23:10,146 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;@23abc6ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:23:10,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:23:10,151 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:23:10,151 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2025-01-09 16:23:10,151 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:23:10,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:10,152 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-09 16:23:10,152 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:23:10,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:10,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1703842465, now seen corresponding path program 1 times [2025-01-09 16:23:10,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:10,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052139373] [2025-01-09 16:23:10,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:10,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:10,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 16:23:10,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 16:23:10,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:10,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:10,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:23:10,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 16:23:10,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 16:23:10,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:10,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:10,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:23:10,278 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:23:10,279 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-01-09 16:23:10,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-01-09 16:23:10,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-01-09 16:23:10,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:23:10,282 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-09 16:23:10,285 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:23:10,287 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 16:23:10,331 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:23:10,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 35 transitions, 80 flow [2025-01-09 16:23:10,344 INFO L124 PetriNetUnfolderBase]: 6/40 cut-off events. [2025-01-09 16:23:10,346 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:23:10,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 40 events. 6/40 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 89 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 31. Up to 3 conditions per place. [2025-01-09 16:23:10,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 35 transitions, 80 flow [2025-01-09 16:23:10,349 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 35 transitions, 80 flow [2025-01-09 16:23:10,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:23:10,351 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;@23abc6ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:23:10,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:23:10,356 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:23:10,358 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-01-09 16:23:10,358 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:23:10,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:10,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:10,358 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:23:10,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:10,359 INFO L85 PathProgramCache]: Analyzing trace with hash 767261690, now seen corresponding path program 1 times [2025-01-09 16:23:10,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:10,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108159441] [2025-01-09 16:23:10,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:10,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:10,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 16:23:10,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 16:23:10,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:10,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:10,529 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:23:10,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:10,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108159441] [2025-01-09 16:23:10,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108159441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:10,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:10,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:23:10,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592195896] [2025-01-09 16:23:10,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:10,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:10,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:10,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:10,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:10,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2025-01-09 16:23:10,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:23:10,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:10,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2025-01-09 16:23:10,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:10,753 INFO L124 PetriNetUnfolderBase]: 455/986 cut-off events. [2025-01-09 16:23:10,754 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-09 16:23:10,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 986 events. 455/986 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5768 event pairs, 187 based on Foata normal form. 81/1000 useless extension candidates. Maximal degree in co-relation 880. Up to 376 conditions per place. [2025-01-09 16:23:10,765 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 32 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-01-09 16:23:10,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 175 flow [2025-01-09 16:23:10,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:23:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:23:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-01-09 16:23:10,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-01-09 16:23:10,778 INFO L175 Difference]: Start difference. First operand has 34 places, 35 transitions, 80 flow. Second operand 3 states and 77 transitions. [2025-01-09 16:23:10,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 175 flow [2025-01-09 16:23:10,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 175 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:23:10,785 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 88 flow [2025-01-09 16:23:10,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2025-01-09 16:23:10,789 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2025-01-09 16:23:10,790 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 88 flow [2025-01-09 16:23:10,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:23:10,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:10,790 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-01-09 16:23:10,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:23:10,791 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:23:10,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:10,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1935809741, now seen corresponding path program 1 times [2025-01-09 16:23:10,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:10,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984952284] [2025-01-09 16:23:10,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:10,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:10,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:23:10,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:23:10,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:10,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:10,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:23:10,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:23:10,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:23:10,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:10,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:10,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:23:10,833 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:23:10,834 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-01-09 16:23:10,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-01-09 16:23:10,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-01-09 16:23:10,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-01-09 16:23:10,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:23:10,835 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 16:23:10,835 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:23:10,838 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 16:23:10,893 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:23:10,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 50 transitions, 118 flow [2025-01-09 16:23:10,904 INFO L124 PetriNetUnfolderBase]: 9/58 cut-off events. [2025-01-09 16:23:10,904 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 16:23:10,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 58 events. 9/58 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 151 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2025-01-09 16:23:10,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 50 transitions, 118 flow [2025-01-09 16:23:10,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 50 transitions, 118 flow [2025-01-09 16:23:10,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:23:10,906 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;@23abc6ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:23:10,906 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:23:10,908 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:23:10,908 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2025-01-09 16:23:10,908 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:23:10,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:10,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:10,909 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:23:10,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:10,909 INFO L85 PathProgramCache]: Analyzing trace with hash -610092422, now seen corresponding path program 1 times [2025-01-09 16:23:10,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:10,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227506074] [2025-01-09 16:23:10,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:10,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:10,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 16:23:10,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 16:23:10,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:10,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:10,965 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:23:10,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:10,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227506074] [2025-01-09 16:23:10,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227506074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:10,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:10,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:23:10,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913828913] [2025-01-09 16:23:10,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:10,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:10,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:10,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:10,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:10,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-01-09 16:23:10,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:23:10,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:10,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-01-09 16:23:10,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:11,759 INFO L124 PetriNetUnfolderBase]: 5081/8849 cut-off events. [2025-01-09 16:23:11,759 INFO L125 PetriNetUnfolderBase]: For 552/552 co-relation queries the response was YES. [2025-01-09 16:23:11,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16059 conditions, 8849 events. 5081/8849 cut-off events. For 552/552 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 64582 event pairs, 2182 based on Foata normal form. 1060/9412 useless extension candidates. Maximal degree in co-relation 4306. Up to 3652 conditions per place. [2025-01-09 16:23:11,796 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 48 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-01-09 16:23:11,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 266 flow [2025-01-09 16:23:11,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:23:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:23:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-01-09 16:23:11,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7533333333333333 [2025-01-09 16:23:11,797 INFO L175 Difference]: Start difference. First operand has 48 places, 50 transitions, 118 flow. Second operand 3 states and 113 transitions. [2025-01-09 16:23:11,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 266 flow [2025-01-09 16:23:11,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 262 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-01-09 16:23:11,799 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 122 flow [2025-01-09 16:23:11,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2025-01-09 16:23:11,800 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2025-01-09 16:23:11,800 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 122 flow [2025-01-09 16:23:11,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:23:11,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:11,800 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:11,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:23:11,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:23:11,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:11,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1494607622, now seen corresponding path program 1 times [2025-01-09 16:23:11,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:11,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968548857] [2025-01-09 16:23:11,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:11,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:11,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 16:23:11,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 16:23:11,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:11,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:11,840 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:23:11,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:11,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968548857] [2025-01-09 16:23:11,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968548857] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:11,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:11,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:23:11,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509689121] [2025-01-09 16:23:11,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:11,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:11,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:11,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:11,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:11,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-01-09 16:23:11,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:23:11,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:11,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-01-09 16:23:11,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:12,596 INFO L124 PetriNetUnfolderBase]: 8199/14163 cut-off events. [2025-01-09 16:23:12,597 INFO L125 PetriNetUnfolderBase]: For 2609/2609 co-relation queries the response was YES. [2025-01-09 16:23:12,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27176 conditions, 14163 events. 8199/14163 cut-off events. For 2609/2609 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 109379 event pairs, 3517 based on Foata normal form. 0/13372 useless extension candidates. Maximal degree in co-relation 13383. Up to 5893 conditions per place. [2025-01-09 16:23:12,661 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 51 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-01-09 16:23:12,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 291 flow [2025-01-09 16:23:12,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:23:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:23:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-01-09 16:23:12,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6933333333333334 [2025-01-09 16:23:12,663 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 122 flow. Second operand 3 states and 104 transitions. [2025-01-09 16:23:12,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 291 flow [2025-01-09 16:23:12,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:23:12,667 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 132 flow [2025-01-09 16:23:12,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2025-01-09 16:23:12,667 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2025-01-09 16:23:12,667 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 132 flow [2025-01-09 16:23:12,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:23:12,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:12,668 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:12,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:23:12,668 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:23:12,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:12,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1213679734, now seen corresponding path program 1 times [2025-01-09 16:23:12,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:12,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399166456] [2025-01-09 16:23:12,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:12,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:12,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:23:12,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:23:12,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:12,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:12,719 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:23:12,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:12,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399166456] [2025-01-09 16:23:12,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399166456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:12,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:12,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:23:12,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453194503] [2025-01-09 16:23:12,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:12,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:12,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:12,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:12,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:12,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-01-09 16:23:12,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:23:12,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:12,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-01-09 16:23:12,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:13,685 INFO L124 PetriNetUnfolderBase]: 7283/12531 cut-off events. [2025-01-09 16:23:13,685 INFO L125 PetriNetUnfolderBase]: For 2823/2823 co-relation queries the response was YES. [2025-01-09 16:23:13,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24905 conditions, 12531 events. 7283/12531 cut-off events. For 2823/2823 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 92893 event pairs, 4758 based on Foata normal form. 267/11934 useless extension candidates. Maximal degree in co-relation 17780. Up to 7812 conditions per place. [2025-01-09 16:23:13,735 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 50 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-01-09 16:23:13,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 296 flow [2025-01-09 16:23:13,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:23:13,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:23:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-01-09 16:23:13,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6866666666666666 [2025-01-09 16:23:13,736 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 132 flow. Second operand 3 states and 103 transitions. [2025-01-09 16:23:13,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 296 flow [2025-01-09 16:23:13,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:23:13,750 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 136 flow [2025-01-09 16:23:13,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2025-01-09 16:23:13,751 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2025-01-09 16:23:13,751 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 136 flow [2025-01-09 16:23:13,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:23:13,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:13,751 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-01-09 16:23:13,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:23:13,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:23:13,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:13,752 INFO L85 PathProgramCache]: Analyzing trace with hash 845209502, now seen corresponding path program 1 times [2025-01-09 16:23:13,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:13,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582901109] [2025-01-09 16:23:13,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:13,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:13,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:23:13,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:23:13,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:13,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:13,759 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:23:13,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:23:13,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:23:13,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:13,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:13,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:23:13,767 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:23:13,767 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-01-09 16:23:13,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-01-09 16:23:13,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-01-09 16:23:13,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-01-09 16:23:13,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-01-09 16:23:13,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:23:13,767 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 16:23:13,768 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:23:13,768 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 16:23:13,801 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:23:13,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 65 transitions, 158 flow [2025-01-09 16:23:13,807 INFO L124 PetriNetUnfolderBase]: 12/76 cut-off events. [2025-01-09 16:23:13,807 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 16:23:13,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 76 events. 12/76 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 201 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 70. Up to 5 conditions per place. [2025-01-09 16:23:13,807 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 65 transitions, 158 flow [2025-01-09 16:23:13,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 65 transitions, 158 flow [2025-01-09 16:23:13,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:23:13,809 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;@23abc6ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:23:13,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 16:23:13,810 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:23:13,810 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-01-09 16:23:13,810 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:23:13,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:13,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:13,811 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:23:13,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:13,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1115610391, now seen corresponding path program 1 times [2025-01-09 16:23:13,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:13,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912618994] [2025-01-09 16:23:13,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:13,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:13,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 16:23:13,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 16:23:13,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:13,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:13,862 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:23:13,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:13,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912618994] [2025-01-09 16:23:13,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912618994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:13,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:13,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:23:13,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254471581] [2025-01-09 16:23:13,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:13,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:13,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:13,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:13,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:13,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2025-01-09 16:23:13,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 65 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:23:13,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:13,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2025-01-09 16:23:13,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:17,763 INFO L124 PetriNetUnfolderBase]: 48782/75206 cut-off events. [2025-01-09 16:23:17,764 INFO L125 PetriNetUnfolderBase]: For 6782/6782 co-relation queries the response was YES. [2025-01-09 16:23:17,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139502 conditions, 75206 events. 48782/75206 cut-off events. For 6782/6782 co-relation queries the response was YES. Maximal size of possible extension queue 2869. Compared 620750 event pairs, 21439 based on Foata normal form. 11154/82862 useless extension candidates. Maximal degree in co-relation 16030. Up to 32758 conditions per place. [2025-01-09 16:23:18,202 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 64 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2025-01-09 16:23:18,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 90 transitions, 361 flow [2025-01-09 16:23:18,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:23:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:23:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-01-09 16:23:18,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.764102564102564 [2025-01-09 16:23:18,211 INFO L175 Difference]: Start difference. First operand has 62 places, 65 transitions, 158 flow. Second operand 3 states and 149 transitions. [2025-01-09 16:23:18,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 90 transitions, 361 flow [2025-01-09 16:23:18,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 90 transitions, 349 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-01-09 16:23:18,214 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 156 flow [2025-01-09 16:23:18,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2025-01-09 16:23:18,218 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2025-01-09 16:23:18,218 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 156 flow [2025-01-09 16:23:18,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:23:18,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:18,218 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:18,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:23:18,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:23:18,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:18,219 INFO L85 PathProgramCache]: Analyzing trace with hash -176746394, now seen corresponding path program 1 times [2025-01-09 16:23:18,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:18,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354634405] [2025-01-09 16:23:18,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:18,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:18,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 16:23:18,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 16:23:18,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:18,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:18,266 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:23:18,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:18,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354634405] [2025-01-09 16:23:18,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354634405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:18,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:18,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:23:18,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395159232] [2025-01-09 16:23:18,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:18,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:18,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:18,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:18,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:18,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2025-01-09 16:23:18,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:23:18,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:18,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2025-01-09 16:23:18,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:24,680 INFO L124 PetriNetUnfolderBase]: 78489/120060 cut-off events. [2025-01-09 16:23:24,681 INFO L125 PetriNetUnfolderBase]: For 19505/19505 co-relation queries the response was YES. [2025-01-09 16:23:25,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232404 conditions, 120060 events. 78489/120060 cut-off events. For 19505/19505 co-relation queries the response was YES. Maximal size of possible extension queue 4441. Compared 1026731 event pairs, 34282 based on Foata normal form. 0/114539 useless extension candidates. Maximal degree in co-relation 116652. Up to 52513 conditions per place. [2025-01-09 16:23:25,427 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 67 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2025-01-09 16:23:25,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 92 transitions, 378 flow [2025-01-09 16:23:25,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:23:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:23:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-01-09 16:23:25,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2025-01-09 16:23:25,429 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 156 flow. Second operand 3 states and 138 transitions. [2025-01-09 16:23:25,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 92 transitions, 378 flow [2025-01-09 16:23:25,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:23:25,444 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 166 flow [2025-01-09 16:23:25,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2025-01-09 16:23:25,445 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2025-01-09 16:23:25,445 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 166 flow [2025-01-09 16:23:25,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:23:25,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:25,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:25,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:23:25,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:23:25,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:25,446 INFO L85 PathProgramCache]: Analyzing trace with hash -888996571, now seen corresponding path program 1 times [2025-01-09 16:23:25,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:25,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58516808] [2025-01-09 16:23:25,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:25,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:25,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:23:25,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:23:25,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:25,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:25,483 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:23:25,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:25,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58516808] [2025-01-09 16:23:25,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58516808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:25,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:25,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:23:25,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253013173] [2025-01-09 16:23:25,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:25,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:25,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:25,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:25,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:25,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2025-01-09 16:23:25,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:23:25,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:25,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2025-01-09 16:23:25,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:31,648 INFO L124 PetriNetUnfolderBase]: 70133/104555 cut-off events. [2025-01-09 16:23:31,648 INFO L125 PetriNetUnfolderBase]: For 22139/22139 co-relation queries the response was YES. [2025-01-09 16:23:31,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210611 conditions, 104555 events. 70133/104555 cut-off events. For 22139/22139 co-relation queries the response was YES. Maximal size of possible extension queue 3543. Compared 832018 event pairs, 46317 based on Foata normal form. 1884/101469 useless extension candidates. Maximal degree in co-relation 149828. Up to 69972 conditions per place. [2025-01-09 16:23:32,294 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 66 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2025-01-09 16:23:32,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 383 flow [2025-01-09 16:23:32,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:23:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:23:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-01-09 16:23:32,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7025641025641025 [2025-01-09 16:23:32,295 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 166 flow. Second operand 3 states and 137 transitions. [2025-01-09 16:23:32,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 383 flow [2025-01-09 16:23:32,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:23:32,405 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 170 flow [2025-01-09 16:23:32,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2025-01-09 16:23:32,406 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2025-01-09 16:23:32,406 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 170 flow [2025-01-09 16:23:32,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:23:32,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:32,406 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:32,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:23:32,407 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:23:32,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:32,407 INFO L85 PathProgramCache]: Analyzing trace with hash 738883146, now seen corresponding path program 1 times [2025-01-09 16:23:32,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:32,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942844572] [2025-01-09 16:23:32,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:32,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:32,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 16:23:32,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 16:23:32,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:32,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:32,442 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:23:32,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:32,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942844572] [2025-01-09 16:23:32,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942844572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:32,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:32,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:23:32,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652249171] [2025-01-09 16:23:32,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:32,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:32,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:32,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:32,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:32,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2025-01-09 16:23:32,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:23:32,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:32,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2025-01-09 16:23:32,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand