./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/queue_longer.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:11:35,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:11:35,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:11:35,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:11:35,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:11:35,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:11:35,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:11:35,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:11:35,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:11:35,077 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:11:35,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:11:35,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:11:35,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:11:35,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:11:35,078 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:11:35,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:11:35,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:11:35,078 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:11:35,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:11:35,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:11:35,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:11:35,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:11:35,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:11:35,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:11:35,078 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:11:35,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:11:35,079 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:11:35,079 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:11:35,079 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:11:35,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:11:35,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:11:35,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:11:35,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:11:35,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:11:35,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:11:35,079 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:11:35,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:11:35,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:11:35,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:11:35,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:11:35,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:11:35,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:11:35,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:11:35,081 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2025-03-08 17:11:35,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:11:35,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:11:35,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:11:35,301 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:11:35,301 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:11:35,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_longer.i [2025-03-08 17:11:36,386 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec33d1048/7aab3e4b5e194343bfc5075172d86214/FLAG11c54e388 [2025-03-08 17:11:36,669 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:11:36,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i [2025-03-08 17:11:36,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec33d1048/7aab3e4b5e194343bfc5075172d86214/FLAG11c54e388 [2025-03-08 17:11:36,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec33d1048/7aab3e4b5e194343bfc5075172d86214 [2025-03-08 17:11:36,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:11:36,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:11:36,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:11:36,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:11:36,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:11:36,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:11:36" (1/1) ... [2025-03-08 17:11:36,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2629c86b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:11:36, skipping insertion in model container [2025-03-08 17:11:36,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:11:36" (1/1) ... [2025-03-08 17:11:36,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:11:37,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i[43296,43309] [2025-03-08 17:11:37,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i[43503,43516] [2025-03-08 17:11:37,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i[43783,43796] [2025-03-08 17:11:37,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:11:37,364 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:11:37,401 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i[43296,43309] [2025-03-08 17:11:37,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i[43503,43516] [2025-03-08 17:11:37,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i[43783,43796] [2025-03-08 17:11:37,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:11:37,476 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:11:37,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:11:37 WrapperNode [2025-03-08 17:11:37,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:11:37,477 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:11:37,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:11:37,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:11:37,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:11:37" (1/1) ... [2025-03-08 17:11:37,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:11:37" (1/1) ... [2025-03-08 17:11:37,532 INFO L138 Inliner]: procedures = 274, calls = 856, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 1034 [2025-03-08 17:11:37,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:11:37,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:11:37,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:11:37,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:11:37,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:11:37" (1/1) ... [2025-03-08 17:11:37,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:11:37" (1/1) ... [2025-03-08 17:11:37,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:11:37" (1/1) ... [2025-03-08 17:11:37,583 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-03-08 17:11:37,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:11:37" (1/1) ... [2025-03-08 17:11:37,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:11:37" (1/1) ... [2025-03-08 17:11:37,607 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:11:37" (1/1) ... [2025-03-08 17:11:37,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:11:37" (1/1) ... [2025-03-08 17:11:37,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:11:37" (1/1) ... [2025-03-08 17:11:37,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:11:37" (1/1) ... [2025-03-08 17:11:37,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:11:37,622 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:11:37,622 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:11:37,622 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:11:37,626 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:11:37" (1/1) ... [2025-03-08 17:11:37,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:11:37,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:11:37,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:11:37,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:11:37,670 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-08 17:11:37,670 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-08 17:11:37,671 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-08 17:11:37,671 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-08 17:11:37,671 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 17:11:37,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:11:37,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:11:37,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 17:11:37,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 17:11:37,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:11:37,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:11:37,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 17:11:37,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 17:11:37,671 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 17:11:37,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:11:37,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:11:37,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:11:37,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 17:11:37,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 17:11:37,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:11:37,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:11:37,674 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:11:37,785 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:11:37,786 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:11:38,684 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:11:38,685 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:11:43,708 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:11:43,710 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:11:43,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:11:43 BoogieIcfgContainer [2025-03-08 17:11:43,710 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:11:43,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:11:43,712 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:11:43,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:11:43,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:11:36" (1/3) ... [2025-03-08 17:11:43,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f07b829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:11:43, skipping insertion in model container [2025-03-08 17:11:43,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:11:37" (2/3) ... [2025-03-08 17:11:43,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f07b829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:11:43, skipping insertion in model container [2025-03-08 17:11:43,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:11:43" (3/3) ... [2025-03-08 17:11:43,717 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2025-03-08 17:11:43,728 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:11:43,729 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-03-08 17:11:43,730 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:11:43,794 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 17:11:43,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 47 transitions, 108 flow [2025-03-08 17:11:43,865 INFO L124 PetriNetUnfolderBase]: 7/45 cut-off events. [2025-03-08 17:11:43,866 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 17:11:43,870 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 81 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-03-08 17:11:43,871 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 47 transitions, 108 flow [2025-03-08 17:11:43,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 43 transitions, 95 flow [2025-03-08 17:11:43,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:11:43,891 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;@5a052aa0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:11:43,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-08 17:11:43,911 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:11:43,912 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-08 17:11:43,912 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:11:43,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:11:43,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-08 17:11:43,913 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-03-08 17:11:43,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:11:43,918 INFO L85 PathProgramCache]: Analyzing trace with hash 2152289, now seen corresponding path program 1 times [2025-03-08 17:11:43,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:11:43,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861284962] [2025-03-08 17:11:43,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:11:43,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:11:44,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 17:11:44,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 17:11:44,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:11:44,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:11:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:11:44,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:11:44,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861284962] [2025-03-08 17:11:44,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861284962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:11:44,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:11:44,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:11:44,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784639934] [2025-03-08 17:11:44,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:11:44,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:11:44,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:11:44,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:11:44,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:11:44,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-03-08 17:11:44,348 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-03-08 17:11:44,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:11:44,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-03-08 17:11:44,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:11:44,587 INFO L124 PetriNetUnfolderBase]: 425/775 cut-off events. [2025-03-08 17:11:44,587 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-08 17:11:44,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 775 events. 425/775 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3498 event pairs, 331 based on Foata normal form. 47/740 useless extension candidates. Maximal degree in co-relation 1446. Up to 692 conditions per place. [2025-03-08 17:11:44,595 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 31 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2025-03-08 17:11:44,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 147 flow [2025-03-08 17:11:44,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:11:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 17:11:44,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2025-03-08 17:11:44,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2025-03-08 17:11:44,605 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 95 flow. Second operand 2 states and 54 transitions. [2025-03-08 17:11:44,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 147 flow [2025-03-08 17:11:44,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 142 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 17:11:44,610 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 80 flow [2025-03-08 17:11:44,612 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-03-08 17:11:44,614 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2025-03-08 17:11:44,614 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 80 flow [2025-03-08 17:11:44,615 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-03-08 17:11:44,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:11:44,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:11:44,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:11:44,615 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-03-08 17:11:44,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:11:44,616 INFO L85 PathProgramCache]: Analyzing trace with hash -433540034, now seen corresponding path program 1 times [2025-03-08 17:11:44,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:11:44,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407919676] [2025-03-08 17:11:44,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:11:44,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:11:44,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 17:11:44,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 17:11:44,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:11:44,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:11:44,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:11:44,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:11:44,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407919676] [2025-03-08 17:11:44,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407919676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:11:44,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:11:44,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:11:44,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902087627] [2025-03-08 17:11:44,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:11:44,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:11:44,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:11:44,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:11:44,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:11:44,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-03-08 17:11:44,847 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-03-08 17:11:44,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:11:44,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-03-08 17:11:44,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:11:45,015 INFO L124 PetriNetUnfolderBase]: 405/753 cut-off events. [2025-03-08 17:11:45,016 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-08 17:11:45,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1454 conditions, 753 events. 405/753 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3493 event pairs, 304 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 1451. Up to 623 conditions per place. [2025-03-08 17:11:45,022 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 40 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2025-03-08 17:11:45,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 188 flow [2025-03-08 17:11:45,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:11:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:11:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-08 17:11:45,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2025-03-08 17:11:45,025 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 80 flow. Second operand 3 states and 73 transitions. [2025-03-08 17:11:45,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 188 flow [2025-03-08 17:11:45,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:11:45,027 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 82 flow [2025-03-08 17:11:45,027 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-03-08 17:11:45,028 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-03-08 17:11:45,029 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 82 flow [2025-03-08 17:11:45,029 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-03-08 17:11:45,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:11:45,029 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:11:45,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:11:45,030 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-03-08 17:11:45,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:11:45,030 INFO L85 PathProgramCache]: Analyzing trace with hash -554835980, now seen corresponding path program 1 times [2025-03-08 17:11:45,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:11:45,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849029427] [2025-03-08 17:11:45,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:11:45,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:11:45,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 17:11:45,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 17:11:45,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:11:45,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:11:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:11:45,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:11:45,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849029427] [2025-03-08 17:11:45,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849029427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:11:45,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:11:45,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:11:45,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919302844] [2025-03-08 17:11:45,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:11:45,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:11:45,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:11:45,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:11:45,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:11:45,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-03-08 17:11:45,980 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-03-08 17:11:45,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:11:45,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-03-08 17:11:45,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:11:46,319 INFO L124 PetriNetUnfolderBase]: 674/1248 cut-off events. [2025-03-08 17:11:46,319 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-08 17:11:46,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2434 conditions, 1248 events. 674/1248 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6205 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-03-08 17:11:46,326 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 71 selfloop transitions, 10 changer transitions 3/91 dead transitions. [2025-03-08 17:11:46,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 91 transitions, 371 flow [2025-03-08 17:11:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:11:46,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:11:46,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2025-03-08 17:11:46,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2025-03-08 17:11:46,329 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 82 flow. Second operand 6 states and 146 transitions. [2025-03-08 17:11:46,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 91 transitions, 371 flow [2025-03-08 17:11:46,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 91 transitions, 361 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:11:46,331 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 146 flow [2025-03-08 17:11:46,332 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-03-08 17:11:46,332 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2025-03-08 17:11:46,332 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 146 flow [2025-03-08 17:11:46,332 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-03-08 17:11:46,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:11:46,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:11:46,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:11:46,333 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-03-08 17:11:46,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:11:46,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1847716122, now seen corresponding path program 1 times [2025-03-08 17:11:46,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:11:46,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180334619] [2025-03-08 17:11:46,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:11:46,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:11:46,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 17:11:46,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 17:11:46,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:11:46,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:11:46,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-03-08 17:11:46,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:11:46,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180334619] [2025-03-08 17:11:46,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180334619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:11:46,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:11:46,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:11:46,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155235744] [2025-03-08 17:11:46,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:11:46,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:11:46,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:11:46,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:11:46,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:11:46,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-03-08 17:11:46,509 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-03-08 17:11:46,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:11:46,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-03-08 17:11:46,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:11:46,650 INFO L124 PetriNetUnfolderBase]: 419/814 cut-off events. [2025-03-08 17:11:46,650 INFO L125 PetriNetUnfolderBase]: For 112/116 co-relation queries the response was YES. [2025-03-08 17:11:46,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 814 events. 419/814 cut-off events. For 112/116 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3576 event pairs, 215 based on Foata normal form. 32/828 useless extension candidates. Maximal degree in co-relation 1673. Up to 417 conditions per place. [2025-03-08 17:11:46,654 INFO L140 encePairwiseOnDemand]: 43/47 looper letters, 37 selfloop transitions, 4 changer transitions 3/50 dead transitions. [2025-03-08 17:11:46,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 217 flow [2025-03-08 17:11:46,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:11:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:11:46,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-03-08 17:11:46,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2025-03-08 17:11:46,656 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 146 flow. Second operand 3 states and 74 transitions. [2025-03-08 17:11:46,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 217 flow [2025-03-08 17:11:46,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 211 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 17:11:46,658 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 108 flow [2025-03-08 17:11:46,658 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-03-08 17:11:46,658 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2025-03-08 17:11:46,658 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 108 flow [2025-03-08 17:11:46,658 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-03-08 17:11:46,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:11:46,659 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-03-08 17:11:46,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:11:46,659 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-03-08 17:11:46,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:11:46,659 INFO L85 PathProgramCache]: Analyzing trace with hash -478674635, now seen corresponding path program 1 times [2025-03-08 17:11:46,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:11:46,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017597231] [2025-03-08 17:11:46,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:11:46,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:11:46,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 17:11:46,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:11:46,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:11:46,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:11:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:11:46,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:11:46,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017597231] [2025-03-08 17:11:46,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017597231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:11:46,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:11:46,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:11:46,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814701109] [2025-03-08 17:11:46,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:11:46,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:11:46,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:11:46,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:11:46,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:11:46,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-03-08 17:11:46,866 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-03-08 17:11:46,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:11:46,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-03-08 17:11:46,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:11:47,034 INFO L124 PetriNetUnfolderBase]: 249/547 cut-off events. [2025-03-08 17:11:47,035 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-03-08 17:11:47,038 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 2155 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-03-08 17:11:47,039 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 34 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2025-03-08 17:11:47,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 211 flow [2025-03-08 17:11:47,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:11:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:11:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-08 17:11:47,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2025-03-08 17:11:47,042 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 108 flow. Second operand 3 states and 71 transitions. [2025-03-08 17:11:47,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 211 flow [2025-03-08 17:11:47,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 201 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-08 17:11:47,043 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 110 flow [2025-03-08 17:11:47,044 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-03-08 17:11:47,044 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2025-03-08 17:11:47,044 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 110 flow [2025-03-08 17:11:47,044 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-03-08 17:11:47,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:11:47,044 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-03-08 17:11:47,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:11:47,044 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-03-08 17:11:47,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:11:47,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1280066349, now seen corresponding path program 1 times [2025-03-08 17:11:47,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:11:47,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947479654] [2025-03-08 17:11:47,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:11:47,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:11:47,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:11:47,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:11:47,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:11:47,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:11:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:11:49,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:11:49,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947479654] [2025-03-08 17:11:49,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947479654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:11:49,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:11:49,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:11:49,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085821493] [2025-03-08 17:11:49,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:11:49,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:11:49,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:11:49,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:11:49,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:11:49,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-03-08 17:11:49,928 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-03-08 17:11:49,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:11:49,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-03-08 17:11:49,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:11:50,306 INFO L124 PetriNetUnfolderBase]: 370/817 cut-off events. [2025-03-08 17:11:50,306 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2025-03-08 17:11:50,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 817 events. 370/817 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3872 event pairs, 69 based on Foata normal form. 0/808 useless extension candidates. Maximal degree in co-relation 1774. Up to 260 conditions per place. [2025-03-08 17:11:50,310 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 64 selfloop transitions, 16 changer transitions 8/94 dead transitions. [2025-03-08 17:11:50,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 463 flow [2025-03-08 17:11:50,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:11:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:11:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2025-03-08 17:11:50,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41843971631205673 [2025-03-08 17:11:50,311 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 110 flow. Second operand 9 states and 177 transitions. [2025-03-08 17:11:50,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 463 flow [2025-03-08 17:11:50,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 94 transitions, 441 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:11:50,317 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 216 flow [2025-03-08 17:11:50,317 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2025-03-08 17:11:50,318 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2025-03-08 17:11:50,318 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 216 flow [2025-03-08 17:11:50,318 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-03-08 17:11:50,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:11:50,318 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-03-08 17:11:50,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:11:50,318 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-03-08 17:11:50,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:11:50,319 INFO L85 PathProgramCache]: Analyzing trace with hash 279220145, now seen corresponding path program 2 times [2025-03-08 17:11:50,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:11:50,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029293065] [2025-03-08 17:11:50,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:11:50,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:11:50,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:11:50,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:11:50,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:11:50,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:11:52,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:11:52,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:11:52,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029293065] [2025-03-08 17:11:52,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029293065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:11:52,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:11:52,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:11:52,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656009328] [2025-03-08 17:11:52,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:11:52,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:11:52,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:11:52,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:11:52,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:11:52,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-03-08 17:11:52,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 216 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-03-08 17:11:52,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:11:52,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-03-08 17:11:52,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:11:52,891 INFO L124 PetriNetUnfolderBase]: 479/1070 cut-off events. [2025-03-08 17:11:52,892 INFO L125 PetriNetUnfolderBase]: For 846/848 co-relation queries the response was YES. [2025-03-08 17:11:52,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2800 conditions, 1070 events. 479/1070 cut-off events. For 846/848 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5923 event pairs, 131 based on Foata normal form. 0/1052 useless extension candidates. Maximal degree in co-relation 2787. Up to 636 conditions per place. [2025-03-08 17:11:52,896 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 70 selfloop transitions, 15 changer transitions 4/95 dead transitions. [2025-03-08 17:11:52,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 95 transitions, 584 flow [2025-03-08 17:11:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:11:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:11:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2025-03-08 17:11:52,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3947990543735225 [2025-03-08 17:11:52,899 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 216 flow. Second operand 9 states and 167 transitions. [2025-03-08 17:11:52,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 95 transitions, 584 flow [2025-03-08 17:11:52,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 95 transitions, 566 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-08 17:11:52,907 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 361 flow [2025-03-08 17:11:52,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=361, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2025-03-08 17:11:52,908 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2025-03-08 17:11:52,908 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 361 flow [2025-03-08 17:11:52,908 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-03-08 17:11:52,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:11:52,908 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-03-08 17:11:52,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:11:52,908 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-03-08 17:11:52,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:11:52,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1623976381, now seen corresponding path program 3 times [2025-03-08 17:11:52,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:11:52,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339028534] [2025-03-08 17:11:52,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:11:52,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:11:52,939 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:11:53,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:11:53,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:11:53,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:11:54,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-03-08 17:11:54,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:11:54,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339028534] [2025-03-08 17:11:54,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339028534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:11:54,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:11:54,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:11:54,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747837740] [2025-03-08 17:11:54,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:11:54,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:11:54,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:11:54,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:11:54,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:11:54,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-03-08 17:11:54,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 361 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-03-08 17:11:54,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:11:54,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-03-08 17:11:54,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:11:55,211 INFO L124 PetriNetUnfolderBase]: 599/1318 cut-off events. [2025-03-08 17:11:55,212 INFO L125 PetriNetUnfolderBase]: For 1674/1676 co-relation queries the response was YES. [2025-03-08 17:11:55,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3716 conditions, 1318 events. 599/1318 cut-off events. For 1674/1676 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7497 event pairs, 52 based on Foata normal form. 0/1307 useless extension candidates. Maximal degree in co-relation 3697. Up to 322 conditions per place. [2025-03-08 17:11:55,217 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 91 selfloop transitions, 32 changer transitions 6/135 dead transitions. [2025-03-08 17:11:55,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 135 transitions, 904 flow [2025-03-08 17:11:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 17:11:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-08 17:11:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 231 transitions. [2025-03-08 17:11:55,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4095744680851064 [2025-03-08 17:11:55,219 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 361 flow. Second operand 12 states and 231 transitions. [2025-03-08 17:11:55,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 135 transitions, 904 flow [2025-03-08 17:11:55,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 135 transitions, 858 flow, removed 23 selfloop flow, removed 0 redundant places. [2025-03-08 17:11:55,224 INFO L231 Difference]: Finished difference. Result has 80 places, 71 transitions, 485 flow [2025-03-08 17:11:55,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=485, PETRI_PLACES=80, PETRI_TRANSITIONS=71} [2025-03-08 17:11:55,225 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2025-03-08 17:11:55,225 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 71 transitions, 485 flow [2025-03-08 17:11:55,225 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-03-08 17:11:55,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:11:55,225 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-03-08 17:11:55,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:11:55,226 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-03-08 17:11:55,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:11:55,226 INFO L85 PathProgramCache]: Analyzing trace with hash -72798741, now seen corresponding path program 4 times [2025-03-08 17:11:55,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:11:55,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766893273] [2025-03-08 17:11:55,226 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:11:55,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:11:55,246 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-08 17:11:55,317 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:11:55,318 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:11:55,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:11:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:11:56,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:11:56,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766893273] [2025-03-08 17:11:56,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766893273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:11:56,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:11:56,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:11:56,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087127683] [2025-03-08 17:11:56,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:11:56,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:11:56,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:11:56,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:11:56,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:11:56,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-03-08 17:11:56,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 485 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-03-08 17:11:56,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:11:56,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-03-08 17:11:56,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:11:57,049 INFO L124 PetriNetUnfolderBase]: 769/1624 cut-off events. [2025-03-08 17:11:57,050 INFO L125 PetriNetUnfolderBase]: For 2969/2969 co-relation queries the response was YES. [2025-03-08 17:11:57,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4899 conditions, 1624 events. 769/1624 cut-off events. For 2969/2969 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9280 event pairs, 203 based on Foata normal form. 7/1624 useless extension candidates. Maximal degree in co-relation 4876. Up to 771 conditions per place. [2025-03-08 17:11:57,057 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 95 selfloop transitions, 22 changer transitions 8/130 dead transitions. [2025-03-08 17:11:57,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 130 transitions, 989 flow [2025-03-08 17:11:57,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:11:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:11:57,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2025-03-08 17:11:57,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41843971631205673 [2025-03-08 17:11:57,059 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 485 flow. Second operand 9 states and 177 transitions. [2025-03-08 17:11:57,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 130 transitions, 989 flow [2025-03-08 17:11:57,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 130 transitions, 913 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-03-08 17:11:57,069 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 622 flow [2025-03-08 17:11:57,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=622, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2025-03-08 17:11:57,070 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places. [2025-03-08 17:11:57,070 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 622 flow [2025-03-08 17:11:57,071 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-03-08 17:11:57,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:11:57,071 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-03-08 17:11:57,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:11:57,071 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-03-08 17:11:57,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:11:57,072 INFO L85 PathProgramCache]: Analyzing trace with hash -520706843, now seen corresponding path program 1 times [2025-03-08 17:11:57,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:11:57,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779394993] [2025-03-08 17:11:57,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:11:57,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:11:57,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:11:57,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:11:57,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:11:57,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:11:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:11:58,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:11:58,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779394993] [2025-03-08 17:11:58,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779394993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:11:58,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438320247] [2025-03-08 17:11:58,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:11:58,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:11:58,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:11:58,866 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:11:58,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 17:11:58,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:11:59,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:11:59,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:11:59,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:11:59,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 17:11:59,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:11:59,163 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 21 treesize of output 15 [2025-03-08 17:11:59,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:11:59,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2025-03-08 17:11:59,298 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-03-08 17:11:59,483 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 23 treesize of output 22 [2025-03-08 17:11:59,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:11:59,496 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-03-08 17:11:59,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:11:59,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 32 [2025-03-08 17:11:59,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:11:59,831 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 31 treesize of output 15 [2025-03-08 17:11:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:11:59,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:12:00,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:12:00,250 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-03-08 17:12:00,257 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-08 17:12:00,258 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-03-08 17:12:11,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:12:11,045 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-03-08 17:12:11,074 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-08 17:12:11,075 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-03-08 17:12:12,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-08 17:12:12,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2025-03-08 17:12:12,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-08 17:12:12,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2025-03-08 17:12:12,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-08 17:12:12,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2025-03-08 17:12:12,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-08 17:12:12,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2025-03-08 17:12:12,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-08 17:12:12,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2025-03-08 17:12:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:12:16,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438320247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:12:16,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:12:16,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 27 [2025-03-08 17:12:16,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328883738] [2025-03-08 17:12:16,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:12:16,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 17:12:16,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:12:16,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 17:12:16,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=604, Unknown=2, NotChecked=0, Total=756 [2025-03-08 17:12:20,951 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-03-08 17:12:25,098 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-03-08 17:12:25,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2025-03-08 17:12:25,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 622 flow. Second operand has 28 states, 28 states have (on average 9.535714285714286) internal successors, (267), 28 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:12:25,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:12:25,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2025-03-08 17:12:25,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:12:31,742 INFO L124 PetriNetUnfolderBase]: 1447/2708 cut-off events. [2025-03-08 17:12:31,742 INFO L125 PetriNetUnfolderBase]: For 5774/5774 co-relation queries the response was YES. [2025-03-08 17:12:31,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8473 conditions, 2708 events. 1447/2708 cut-off events. For 5774/5774 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 15130 event pairs, 258 based on Foata normal form. 41/2740 useless extension candidates. Maximal degree in co-relation 8444. Up to 1464 conditions per place. [2025-03-08 17:12:31,757 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 143 selfloop transitions, 63 changer transitions 6/215 dead transitions. [2025-03-08 17:12:31,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 215 transitions, 1638 flow [2025-03-08 17:12:31,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 17:12:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-08 17:12:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 310 transitions. [2025-03-08 17:12:31,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32978723404255317 [2025-03-08 17:12:31,759 INFO L175 Difference]: Start difference. First operand has 88 places, 82 transitions, 622 flow. Second operand 20 states and 310 transitions. [2025-03-08 17:12:31,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 215 transitions, 1638 flow [2025-03-08 17:12:31,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 215 transitions, 1542 flow, removed 42 selfloop flow, removed 2 redundant places. [2025-03-08 17:12:31,774 INFO L231 Difference]: Finished difference. Result has 115 places, 123 transitions, 1101 flow [2025-03-08 17:12:31,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1101, PETRI_PLACES=115, PETRI_TRANSITIONS=123} [2025-03-08 17:12:31,775 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places. [2025-03-08 17:12:31,775 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 123 transitions, 1101 flow [2025-03-08 17:12:31,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.535714285714286) internal successors, (267), 28 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:12:31,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:12:31,775 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-03-08 17:12:31,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 17:12:31,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 17:12:31,976 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-03-08 17:12:31,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:12:31,976 INFO L85 PathProgramCache]: Analyzing trace with hash 355096849, now seen corresponding path program 2 times [2025-03-08 17:12:31,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:12:31,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402498952] [2025-03-08 17:12:31,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:12:31,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:12:31,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 17:12:32,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:12:32,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:12:32,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:12:34,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:12:34,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:12:34,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402498952] [2025-03-08 17:12:34,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402498952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:12:34,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649718363] [2025-03-08 17:12:34,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:12:34,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:12:34,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:12:34,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:12:34,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 17:12:34,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 17:12:36,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:12:36,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:12:36,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:12:36,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 17:12:36,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:12:36,391 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 21 treesize of output 15 [2025-03-08 17:12:36,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:12:36,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2025-03-08 17:12:36,495 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-03-08 17:12:36,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:12:36,696 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 35 treesize of output 15 [2025-03-08 17:12:36,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:12:36,704 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-03-08 17:12:37,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:12:37,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 25 [2025-03-08 17:12:37,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 17:12:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:12:37,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:12:37,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:12:37,635 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-03-08 17:12:37,648 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-08 17:12:37,649 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-03-08 17:12:42,043 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-08 17:12:42,044 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-03-08 17:12:42,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:12:42,070 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-03-08 17:13:00,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:13:00,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649718363] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:13:00,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:13:00,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2025-03-08 17:13:00,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133269535] [2025-03-08 17:13:00,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:13:00,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 17:13:00,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:13:00,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 17:13:00,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=428, Unknown=2, NotChecked=0, Total=552