./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/queue_longer.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/queue_longer.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 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:21:00,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:21:00,239 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:21:00,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:21:00,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:21:00,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:21:00,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:21:00,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:21:00,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:21:00,278 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:21:00,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:21:00,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:21:00,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:21:00,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:21:00,279 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:21:00,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:21:00,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:21:00,280 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:21:00,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:21:00,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:21:00,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:21:00,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:21:00,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:21:00,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:21:00,281 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:21:00,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:21:00,281 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:21:00,281 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:21:00,281 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:21:00,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:21:00,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:21:00,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:21:00,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:21:00,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:21:00,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:21:00,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:21:00,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:21:00,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:21:00,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:21:00,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:21:00,283 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:21:00,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:21:00,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:21:00,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:21:00,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:21:00,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:21:00,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:21:00,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:21:00,284 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 -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2025-01-09 16:21:00,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:21:00,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:21:00,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:21:00,581 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:21:00,581 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:21:00,583 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_longer.i [2025-01-09 16:21:01,801 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40a21e57e/ae6d38fe27794faeb2d21075e818d985/FLAG834c985c1 [2025-01-09 16:21:02,176 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:21:02,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i [2025-01-09 16:21:02,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40a21e57e/ae6d38fe27794faeb2d21075e818d985/FLAG834c985c1 [2025-01-09 16:21:02,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40a21e57e/ae6d38fe27794faeb2d21075e818d985 [2025-01-09 16:21:02,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:21:02,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:21:02,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:21:02,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:21:02,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:21:02,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:21:02" (1/1) ... [2025-01-09 16:21:02,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd28bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:02, skipping insertion in model container [2025-01-09 16:21:02,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:21:02" (1/1) ... [2025-01-09 16:21:02,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:21:02,935 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/queue_longer.i[43296,43309] [2025-01-09 16:21:02,941 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/queue_longer.i[43503,43516] [2025-01-09 16:21:02,944 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/queue_longer.i[43783,43796] [2025-01-09 16:21:02,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:21:02,986 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:21:03,050 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/queue_longer.i[43296,43309] [2025-01-09 16:21:03,052 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/queue_longer.i[43503,43516] [2025-01-09 16:21:03,053 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/queue_longer.i[43783,43796] [2025-01-09 16:21:03,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:21:03,170 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:21:03,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:03 WrapperNode [2025-01-09 16:21:03,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:21:03,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:21:03,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:21:03,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:21:03,178 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:21:03" (1/1) ... [2025-01-09 16:21:03,210 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:21:03" (1/1) ... [2025-01-09 16:21:03,287 INFO L138 Inliner]: procedures = 274, calls = 856, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 1034 [2025-01-09 16:21:03,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:21:03,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:21:03,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:21:03,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:21:03,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:03" (1/1) ... [2025-01-09 16:21:03,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:03" (1/1) ... [2025-01-09 16:21:03,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:03" (1/1) ... [2025-01-09 16:21:03,362 INFO L175 MemorySlicer]: Split 844 memory accesses to 4 slices as follows [2, 5, 403, 434]. 51 percent of accesses are in the largest equivalence class. The 810 initializations are split as follows [2, 5, 400, 403]. The 16 writes are split as follows [0, 0, 2, 14]. [2025-01-09 16:21:03,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:03" (1/1) ... [2025-01-09 16:21:03,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:03" (1/1) ... [2025-01-09 16:21:03,407 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:03" (1/1) ... [2025-01-09 16:21:03,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:03" (1/1) ... [2025-01-09 16:21:03,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:03" (1/1) ... [2025-01-09 16:21:03,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:03" (1/1) ... [2025-01-09 16:21:03,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:03" (1/1) ... [2025-01-09 16:21:03,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:21:03,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:21:03,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:21:03,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:21:03,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:03" (1/1) ... [2025-01-09 16:21:03,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:21:03,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:21:03,468 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:21:03,473 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:21:03,495 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-09 16:21:03,496 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-09 16:21:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-09 16:21:03,496 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-09 16:21:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:21:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:21:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:21:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 16:21:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 16:21:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:21:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:21:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 16:21:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 16:21:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:21:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:21:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:21:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:21:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 16:21:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 16:21:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:21:03,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:21:03,498 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:21:03,643 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:21:03,645 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:21:04,966 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:21:04,967 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:21:10,677 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:21:10,678 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:21:10,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:21:10 BoogieIcfgContainer [2025-01-09 16:21:10,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:21:10,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:21:10,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:21:10,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:21:10,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:21:02" (1/3) ... [2025-01-09 16:21:10,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ce782d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:21:10, skipping insertion in model container [2025-01-09 16:21:10,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:03" (2/3) ... [2025-01-09 16:21:10,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ce782d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:21:10, skipping insertion in model container [2025-01-09 16:21:10,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:21:10" (3/3) ... [2025-01-09 16:21:10,689 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2025-01-09 16:21:10,703 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:21:10,705 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longer.i that has 3 procedures, 41 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-01-09 16:21:10,705 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:21:10,786 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:21:10,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 47 transitions, 108 flow [2025-01-09 16:21:10,888 INFO L124 PetriNetUnfolderBase]: 7/45 cut-off events. [2025-01-09 16:21:10,891 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:21:10,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 45 events. 7/45 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-01-09 16:21:10,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 47 transitions, 108 flow [2025-01-09 16:21:10,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 43 transitions, 95 flow [2025-01-09 16:21:10,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:21:10,925 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;@4cace346, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:21:10,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 16:21:10,963 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:21:10,963 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-09 16:21:10,964 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:21:10,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:10,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-09 16:21:10,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:10,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:10,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2208939, now seen corresponding path program 1 times [2025-01-09 16:21:10,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:10,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014240263] [2025-01-09 16:21:10,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:21:10,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:11,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 16:21:11,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 16:21:11,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:11,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:11,506 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:21:11,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:11,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014240263] [2025-01-09 16:21:11,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014240263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:21:11,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:21:11,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:21:11,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033246979] [2025-01-09 16:21:11,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:21:11,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:21:11,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:11,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:21:11,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:21:11,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-01-09 16:21:11,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 95 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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:21:11,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:11,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-01-09 16:21:11,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:11,932 INFO L124 PetriNetUnfolderBase]: 420/771 cut-off events. [2025-01-09 16:21:11,936 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-01-09 16:21:11,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 771 events. 420/771 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3480 event pairs, 326 based on Foata normal form. 47/737 useless extension candidates. Maximal degree in co-relation 1434. Up to 685 conditions per place. [2025-01-09 16:21:11,948 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 31 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2025-01-09 16:21:11,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 147 flow [2025-01-09 16:21:11,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:21:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 16:21:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2025-01-09 16:21:11,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2025-01-09 16:21:11,964 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 95 flow. Second operand 2 states and 54 transitions. [2025-01-09 16:21:11,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 147 flow [2025-01-09 16:21:11,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 142 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:21:11,973 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 80 flow [2025-01-09 16:21:11,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=80, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2025-01-09 16:21:11,979 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2025-01-09 16:21:11,980 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 80 flow [2025-01-09 16:21:11,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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:21:11,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:11,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:11,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:21:11,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:11,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:11,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1622234624, now seen corresponding path program 1 times [2025-01-09 16:21:11,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:11,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823264311] [2025-01-09 16:21:11,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:21:11,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:12,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:21:12,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:21:12,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:12,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:12,353 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:21:12,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:12,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823264311] [2025-01-09 16:21:12,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823264311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:21:12,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:21:12,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:21:12,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461736394] [2025-01-09 16:21:12,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:21:12,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:21:12,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:12,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:21:12,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:21:12,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-01-09 16:21:12,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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:21:12,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:12,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-01-09 16:21:12,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:12,708 INFO L124 PetriNetUnfolderBase]: 400/751 cut-off events. [2025-01-09 16:21:12,708 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 16:21:12,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 751 events. 400/751 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3485 event pairs, 299 based on Foata normal form. 0/694 useless extension candidates. Maximal degree in co-relation 1442. Up to 616 conditions per place. [2025-01-09 16:21:12,717 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 40 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2025-01-09 16:21:12,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 188 flow [2025-01-09 16:21:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:21:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:21:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-01-09 16:21:12,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2025-01-09 16:21:12,720 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 80 flow. Second operand 3 states and 73 transitions. [2025-01-09 16:21:12,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 188 flow [2025-01-09 16:21:12,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:21:12,723 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 82 flow [2025-01-09 16:21:12,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-01-09 16:21:12,724 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-01-09 16:21:12,724 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 82 flow [2025-01-09 16:21:12,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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:21:12,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:12,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:12,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:21:12,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:12,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:12,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1250337442, now seen corresponding path program 1 times [2025-01-09 16:21:12,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:12,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944899196] [2025-01-09 16:21:12,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:21:12,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:12,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 16:21:12,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 16:21:12,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:12,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:14,160 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:21:14,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:14,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944899196] [2025-01-09 16:21:14,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944899196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:21:14,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:21:14,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:21:14,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4534942] [2025-01-09 16:21:14,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:21:14,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:21:14,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:14,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:21:14,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:21:14,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-01-09 16:21:14,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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:21:14,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:14,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-01-09 16:21:14,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:14,800 INFO L124 PetriNetUnfolderBase]: 674/1248 cut-off events. [2025-01-09 16:21:14,800 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-01-09 16:21:14,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2434 conditions, 1248 events. 674/1248 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6215 event pairs, 74 based on Foata normal form. 0/1197 useless extension candidates. Maximal degree in co-relation 2430. Up to 658 conditions per place. [2025-01-09 16:21:14,809 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 71 selfloop transitions, 10 changer transitions 3/91 dead transitions. [2025-01-09 16:21:14,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 91 transitions, 371 flow [2025-01-09 16:21:14,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:21:14,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:21:14,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2025-01-09 16:21:14,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2025-01-09 16:21:14,811 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 82 flow. Second operand 6 states and 146 transitions. [2025-01-09 16:21:14,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 91 transitions, 371 flow [2025-01-09 16:21:14,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 91 transitions, 361 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:21:14,814 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 146 flow [2025-01-09 16:21:14,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-01-09 16:21:14,815 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2025-01-09 16:21:14,815 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 146 flow [2025-01-09 16:21:14,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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:21:14,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:14,816 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:14,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:21:14,816 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:14,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:14,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1570886355, now seen corresponding path program 1 times [2025-01-09 16:21:14,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:14,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103896493] [2025-01-09 16:21:14,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:21:14,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:14,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 16:21:14,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 16:21:14,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:14,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:15,090 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:21:15,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:15,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103896493] [2025-01-09 16:21:15,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103896493] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:21:15,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:21:15,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:21:15,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584791218] [2025-01-09 16:21:15,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:21:15,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:21:15,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:15,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:21:15,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:21:15,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-01-09 16:21:15,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:15,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:15,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-01-09 16:21:15,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:15,325 INFO L124 PetriNetUnfolderBase]: 421/824 cut-off events. [2025-01-09 16:21:15,326 INFO L125 PetriNetUnfolderBase]: For 153/157 co-relation queries the response was YES. [2025-01-09 16:21:15,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1690 conditions, 824 events. 421/824 cut-off events. For 153/157 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3641 event pairs, 215 based on Foata normal form. 32/838 useless extension candidates. Maximal degree in co-relation 1683. Up to 417 conditions per place. [2025-01-09 16:21:15,331 INFO L140 encePairwiseOnDemand]: 43/47 looper letters, 37 selfloop transitions, 4 changer transitions 3/50 dead transitions. [2025-01-09 16:21:15,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 217 flow [2025-01-09 16:21:15,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:21:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:21:15,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-01-09 16:21:15,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2025-01-09 16:21:15,332 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 146 flow. Second operand 3 states and 74 transitions. [2025-01-09 16:21:15,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 217 flow [2025-01-09 16:21:15,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 211 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:21:15,334 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 108 flow [2025-01-09 16:21:15,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2025-01-09 16:21:15,335 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2025-01-09 16:21:15,335 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 108 flow [2025-01-09 16:21:15,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:15,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:15,335 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:15,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:21:15,336 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:15,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1688321014, now seen corresponding path program 1 times [2025-01-09 16:21:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:15,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530188412] [2025-01-09 16:21:15,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:21:15,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:15,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:21:15,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:21:15,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:15,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:15,597 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:21:15,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:15,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530188412] [2025-01-09 16:21:15,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530188412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:21:15,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:21:15,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:21:15,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139672439] [2025-01-09 16:21:15,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:21:15,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:21:15,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:15,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:21:15,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:21:15,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-01-09 16:21:15,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:15,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:15,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-01-09 16:21:15,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:15,971 INFO L124 PetriNetUnfolderBase]: 249/547 cut-off events. [2025-01-09 16:21:15,972 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-01-09 16:21:15,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 547 events. 249/547 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2184 event pairs, 85 based on Foata normal form. 32/572 useless extension candidates. Maximal degree in co-relation 1126. Up to 252 conditions per place. [2025-01-09 16:21:15,977 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 34 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2025-01-09 16:21:15,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 211 flow [2025-01-09 16:21:15,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:21:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:21:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-01-09 16:21:15,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2025-01-09 16:21:15,980 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 108 flow. Second operand 3 states and 71 transitions. [2025-01-09 16:21:15,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 211 flow [2025-01-09 16:21:15,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 201 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-09 16:21:15,983 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 110 flow [2025-01-09 16:21:15,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2025-01-09 16:21:15,984 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2025-01-09 16:21:15,984 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 110 flow [2025-01-09 16:21:15,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:15,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:15,984 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:15,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:21:15,985 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:15,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:15,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2056846430, now seen corresponding path program 1 times [2025-01-09 16:21:15,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:15,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907830552] [2025-01-09 16:21:15,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:21:15,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:16,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:21:16,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:21:16,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:16,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:20,605 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:21:20,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:20,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907830552] [2025-01-09 16:21:20,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907830552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:21:20,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:21:20,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:21:20,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826165636] [2025-01-09 16:21:20,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:21:20,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:21:20,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:20,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:21:20,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:21:20,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-01-09 16:21:20,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 110 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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:21:20,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:20,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-01-09 16:21:20,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:21,321 INFO L124 PetriNetUnfolderBase]: 357/786 cut-off events. [2025-01-09 16:21:21,321 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2025-01-09 16:21:21,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1708 conditions, 786 events. 357/786 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3755 event pairs, 77 based on Foata normal form. 0/777 useless extension candidates. Maximal degree in co-relation 1701. Up to 264 conditions per place. [2025-01-09 16:21:21,326 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 65 selfloop transitions, 14 changer transitions 8/93 dead transitions. [2025-01-09 16:21:21,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 93 transitions, 455 flow [2025-01-09 16:21:21,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:21:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:21:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2025-01-09 16:21:21,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41843971631205673 [2025-01-09 16:21:21,328 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 110 flow. Second operand 9 states and 177 transitions. [2025-01-09 16:21:21,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 93 transitions, 455 flow [2025-01-09 16:21:21,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 93 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:21:21,333 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 202 flow [2025-01-09 16:21:21,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=202, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2025-01-09 16:21:21,335 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2025-01-09 16:21:21,335 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 202 flow [2025-01-09 16:21:21,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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:21:21,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:21,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:21,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:21:21,337 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:21,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:21,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1074340804, now seen corresponding path program 2 times [2025-01-09 16:21:21,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:21,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658266644] [2025-01-09 16:21:21,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:21:21,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:21,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:21:21,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:21:21,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:21:21,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:24,466 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:21:24,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:24,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658266644] [2025-01-09 16:21:24,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658266644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:21:24,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:21:24,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:21:24,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303800105] [2025-01-09 16:21:24,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:21:24,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:21:24,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:24,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:21:24,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:21:24,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-01-09 16:21:24,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 202 flow. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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:21:24,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:24,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-01-09 16:21:24,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:25,195 INFO L124 PetriNetUnfolderBase]: 510/1107 cut-off events. [2025-01-09 16:21:25,195 INFO L125 PetriNetUnfolderBase]: For 800/802 co-relation queries the response was YES. [2025-01-09 16:21:25,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2872 conditions, 1107 events. 510/1107 cut-off events. For 800/802 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6112 event pairs, 156 based on Foata normal form. 7/1104 useless extension candidates. Maximal degree in co-relation 2859. Up to 682 conditions per place. [2025-01-09 16:21:25,203 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 73 selfloop transitions, 15 changer transitions 4/97 dead transitions. [2025-01-09 16:21:25,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 97 transitions, 581 flow [2025-01-09 16:21:25,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:21:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:21:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2025-01-09 16:21:25,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38534278959810875 [2025-01-09 16:21:25,204 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 202 flow. Second operand 9 states and 163 transitions. [2025-01-09 16:21:25,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 97 transitions, 581 flow [2025-01-09 16:21:25,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 563 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-09 16:21:25,214 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 349 flow [2025-01-09 16:21:25,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=349, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-01-09 16:21:25,215 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2025-01-09 16:21:25,215 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 349 flow [2025-01-09 16:21:25,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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:21:25,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:25,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:25,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:21:25,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:25,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:25,216 INFO L85 PathProgramCache]: Analyzing trace with hash -157526550, now seen corresponding path program 3 times [2025-01-09 16:21:25,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:25,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929672592] [2025-01-09 16:21:25,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:21:25,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:25,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:21:25,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:21:25,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:21:25,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:27,440 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:21:27,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:27,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929672592] [2025-01-09 16:21:27,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929672592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:21:27,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:21:27,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:21:27,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441706943] [2025-01-09 16:21:27,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:21:27,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:21:27,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:27,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:21:27,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:21:27,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-01-09 16:21:27,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 349 flow. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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:21:27,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:27,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-01-09 16:21:27,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:28,426 INFO L124 PetriNetUnfolderBase]: 523/1142 cut-off events. [2025-01-09 16:21:28,426 INFO L125 PetriNetUnfolderBase]: For 1555/1555 co-relation queries the response was YES. [2025-01-09 16:21:28,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3277 conditions, 1142 events. 523/1142 cut-off events. For 1555/1555 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6053 event pairs, 80 based on Foata normal form. 49/1184 useless extension candidates. Maximal degree in co-relation 3258. Up to 328 conditions per place. [2025-01-09 16:21:28,434 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 84 selfloop transitions, 22 changer transitions 4/115 dead transitions. [2025-01-09 16:21:28,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 115 transitions, 793 flow [2025-01-09 16:21:28,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:21:28,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:21:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2025-01-09 16:21:28,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4066193853427896 [2025-01-09 16:21:28,436 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 349 flow. Second operand 9 states and 172 transitions. [2025-01-09 16:21:28,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 115 transitions, 793 flow [2025-01-09 16:21:28,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 115 transitions, 745 flow, removed 24 selfloop flow, removed 0 redundant places. [2025-01-09 16:21:28,446 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 428 flow [2025-01-09 16:21:28,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=428, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2025-01-09 16:21:28,449 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 35 predicate places. [2025-01-09 16:21:28,449 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 428 flow [2025-01-09 16:21:28,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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:21:28,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:28,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:28,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:21:28,451 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:28,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash 722321918, now seen corresponding path program 4 times [2025-01-09 16:21:28,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:28,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747164548] [2025-01-09 16:21:28,452 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:21:28,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:28,484 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-01-09 16:21:28,571 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:21:28,572 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:21:28,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:30,101 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:21:30,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:30,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747164548] [2025-01-09 16:21:30,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747164548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:21:30,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:21:30,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:21:30,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688175655] [2025-01-09 16:21:30,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:21:30,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:21:30,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:30,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:21:30,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:21:30,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-01-09 16:21:30,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 428 flow. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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:21:30,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:30,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-01-09 16:21:30,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:31,038 INFO L124 PetriNetUnfolderBase]: 594/1291 cut-off events. [2025-01-09 16:21:31,038 INFO L125 PetriNetUnfolderBase]: For 2613/2613 co-relation queries the response was YES. [2025-01-09 16:21:31,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4060 conditions, 1291 events. 594/1291 cut-off events. For 2613/2613 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7210 event pairs, 161 based on Foata normal form. 0/1284 useless extension candidates. Maximal degree in co-relation 4036. Up to 619 conditions per place. [2025-01-09 16:21:31,047 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 92 selfloop transitions, 20 changer transitions 2/119 dead transitions. [2025-01-09 16:21:31,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 119 transitions, 917 flow [2025-01-09 16:21:31,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:21:31,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:21:31,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2025-01-09 16:21:31,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40189125295508277 [2025-01-09 16:21:31,048 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 428 flow. Second operand 9 states and 170 transitions. [2025-01-09 16:21:31,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 119 transitions, 917 flow [2025-01-09 16:21:31,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 119 transitions, 861 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-01-09 16:21:31,059 INFO L231 Difference]: Finished difference. Result has 87 places, 77 transitions, 569 flow [2025-01-09 16:21:31,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=569, PETRI_PLACES=87, PETRI_TRANSITIONS=77} [2025-01-09 16:21:31,060 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2025-01-09 16:21:31,060 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 77 transitions, 569 flow [2025-01-09 16:21:31,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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:21:31,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:31,061 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:31,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:21:31,061 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:31,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash -515503442, now seen corresponding path program 5 times [2025-01-09 16:21:31,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:31,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667657635] [2025-01-09 16:21:31,062 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:21:31,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:31,089 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:21:31,202 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:21:31,202 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:21:31,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:33,329 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:21:33,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:33,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667657635] [2025-01-09 16:21:33,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667657635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:21:33,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:21:33,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:21:33,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131562498] [2025-01-09 16:21:33,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:21:33,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:21:33,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:33,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:21:33,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:21:33,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-01-09 16:21:33,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 77 transitions, 569 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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:21:33,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:33,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-01-09 16:21:33,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:34,166 INFO L124 PetriNetUnfolderBase]: 605/1348 cut-off events. [2025-01-09 16:21:34,167 INFO L125 PetriNetUnfolderBase]: For 3040/3040 co-relation queries the response was YES. [2025-01-09 16:21:34,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4376 conditions, 1348 events. 605/1348 cut-off events. For 3040/3040 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7679 event pairs, 129 based on Foata normal form. 0/1341 useless extension candidates. Maximal degree in co-relation 4346. Up to 615 conditions per place. [2025-01-09 16:21:34,178 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 88 selfloop transitions, 28 changer transitions 2/124 dead transitions. [2025-01-09 16:21:34,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 124 transitions, 1006 flow [2025-01-09 16:21:34,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:21:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:21:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2025-01-09 16:21:34,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39361702127659576 [2025-01-09 16:21:34,181 INFO L175 Difference]: Start difference. First operand has 87 places, 77 transitions, 569 flow. Second operand 10 states and 185 transitions. [2025-01-09 16:21:34,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 124 transitions, 1006 flow [2025-01-09 16:21:34,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 124 transitions, 938 flow, removed 31 selfloop flow, removed 2 redundant places. [2025-01-09 16:21:34,194 INFO L231 Difference]: Finished difference. Result has 96 places, 83 transitions, 651 flow [2025-01-09 16:21:34,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=651, PETRI_PLACES=96, PETRI_TRANSITIONS=83} [2025-01-09 16:21:34,195 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places. [2025-01-09 16:21:34,195 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 83 transitions, 651 flow [2025-01-09 16:21:34,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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:21:34,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:34,195 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:34,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:21:34,197 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:34,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:34,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1155158208, now seen corresponding path program 1 times [2025-01-09 16:21:34,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:34,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865611928] [2025-01-09 16:21:34,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:21:34,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:34,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:21:34,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:21:34,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:34,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:36,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:36,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865611928] [2025-01-09 16:21:36,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865611928] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:21:36,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606377703] [2025-01-09 16:21:36,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:21:36,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:21:36,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:21:36,454 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:21:36,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:21:36,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:21:36,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:21:36,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:36,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:36,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 16:21:36,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:21:36,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-01-09 16:21:36,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:21:36,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2025-01-09 16:21:37,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 16:21:37,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:21:37,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2025-01-09 16:21:37,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2025-01-09 16:21:38,884 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2025-01-09 16:21:38,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 115 treesize of output 69 [2025-01-09 16:21:38,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:21:38,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 55 [2025-01-09 16:21:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:38,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:21:39,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:21:39,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-01-09 16:21:39,831 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-01-09 16:21:39,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-01-09 16:21:50,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:21:50,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 68 [2025-01-09 16:21:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:53,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606377703] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:21:53,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:21:53,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-01-09 16:21:53,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449470922] [2025-01-09 16:21:53,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:21:53,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 16:21:53,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:53,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 16:21:53,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=621, Unknown=2, NotChecked=0, Total=756 [2025-01-09 16:21:57,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 16:22:01,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 16:22:01,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2025-01-09 16:22:01,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 83 transitions, 651 flow. Second operand has 28 states, 28 states have (on average 9.857142857142858) internal successors, (276), 28 states have internal predecessors, (276), 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:22:01,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:01,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2025-01-09 16:22:01,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:06,164 INFO L124 PetriNetUnfolderBase]: 1493/2830 cut-off events. [2025-01-09 16:22:06,164 INFO L125 PetriNetUnfolderBase]: For 6159/6159 co-relation queries the response was YES. [2025-01-09 16:22:06,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9093 conditions, 2830 events. 1493/2830 cut-off events. For 6159/6159 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 15323 event pairs, 258 based on Foata normal form. 0/2811 useless extension candidates. Maximal degree in co-relation 9061. Up to 1127 conditions per place. [2025-01-09 16:22:06,186 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 161 selfloop transitions, 35 changer transitions 2/201 dead transitions. [2025-01-09 16:22:06,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 201 transitions, 1585 flow [2025-01-09 16:22:06,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:22:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 16:22:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 257 transitions. [2025-01-09 16:22:06,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3905775075987842 [2025-01-09 16:22:06,190 INFO L175 Difference]: Start difference. First operand has 96 places, 83 transitions, 651 flow. Second operand 14 states and 257 transitions. [2025-01-09 16:22:06,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 201 transitions, 1585 flow [2025-01-09 16:22:06,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 201 transitions, 1518 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-01-09 16:22:06,202 INFO L231 Difference]: Finished difference. Result has 111 places, 98 transitions, 859 flow [2025-01-09 16:22:06,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=859, PETRI_PLACES=111, PETRI_TRANSITIONS=98} [2025-01-09 16:22:06,203 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 68 predicate places. [2025-01-09 16:22:06,203 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 98 transitions, 859 flow [2025-01-09 16:22:06,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.857142857142858) internal successors, (276), 28 states have internal predecessors, (276), 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:22:06,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:06,203 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:06,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:22:06,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 16:22:06,404 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:22:06,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:06,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1411967184, now seen corresponding path program 2 times [2025-01-09 16:22:06,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:06,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439071451] [2025-01-09 16:22:06,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:22:06,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:06,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:22:06,633 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:22:06,633 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:22:06,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:08,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:08,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439071451] [2025-01-09 16:22:08,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439071451] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:08,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779284977] [2025-01-09 16:22:08,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:22:08,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:08,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:08,781 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:22:08,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:22:08,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:22:09,512 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:22:09,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:22:09,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:09,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 16:22:09,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:09,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-01-09 16:22:09,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:22:09,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 31 [2025-01-09 16:22:09,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 16:22:10,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:22:10,027 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-01-09 16:22:10,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 29 [2025-01-09 16:22:10,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:22:10,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 51 [2025-01-09 16:22:10,963 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2025-01-09 16:22:10,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 56 [2025-01-09 16:22:10,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:22:10,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 36 [2025-01-09 16:22:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:10,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:11,587 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-01-09 16:22:11,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-01-09 16:22:11,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:22:11,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22