./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/queue.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:20:28,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:20:28,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:20:28,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:20:28,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:20:28,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:20:28,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:20:28,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:20:28,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:20:28,379 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:20:28,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:20:28,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:20:28,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:20:28,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:20:28,379 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:20:28,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:20:28,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:20:28,379 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:20:28,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:20:28,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:20:28,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:20:28,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:20:28,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:20:28,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:20:28,380 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:20:28,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:20:28,380 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:20:28,380 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:20:28,380 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:20:28,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:20:28,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:20:28,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:20:28,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:20:28,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:20:28,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:20:28,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:20:28,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:20:28,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:20:28,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:20:28,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:20:28,381 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:20:28,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:20:28,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:20:28,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:20:28,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:20:28,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:20:28,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:20:28,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:20:28,381 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2025-01-09 16:20:28,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:20:28,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:20:28,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:20:28,573 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:20:28,573 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:20:28,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue.i [2025-01-09 16:20:29,658 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/283284328/67a1e8e9348b471ea82678fde8e5af1f/FLAGda52cc8a3 [2025-01-09 16:20:29,986 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:20:29,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue.i [2025-01-09 16:20:30,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/283284328/67a1e8e9348b471ea82678fde8e5af1f/FLAGda52cc8a3 [2025-01-09 16:20:30,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/283284328/67a1e8e9348b471ea82678fde8e5af1f [2025-01-09 16:20:30,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:20:30,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:20:30,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:20:30,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:20:30,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:20:30,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:20:30" (1/1) ... [2025-01-09 16:20:30,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55efa566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:30, skipping insertion in model container [2025-01-09 16:20:30,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:20:30" (1/1) ... [2025-01-09 16:20:30,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:20:30,590 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue.i[43284,43297] [2025-01-09 16:20:30,596 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue.i[43491,43504] [2025-01-09 16:20:30,599 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue.i[43772,43785] [2025-01-09 16:20:30,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:20:30,611 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:20:30,640 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue.i[43284,43297] [2025-01-09 16:20:30,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue.i[43491,43504] [2025-01-09 16:20:30,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue.i[43772,43785] [2025-01-09 16:20:30,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:20:30,681 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:20:30,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:30 WrapperNode [2025-01-09 16:20:30,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:20:30,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:20:30,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:20:30,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:20:30,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:30" (1/1) ... [2025-01-09 16:20:30,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:30" (1/1) ... [2025-01-09 16:20:30,725 INFO L138 Inliner]: procedures = 274, calls = 104, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 283 [2025-01-09 16:20:30,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:20:30,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:20:30,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:20:30,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:20:30,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:30" (1/1) ... [2025-01-09 16:20:30,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:30" (1/1) ... [2025-01-09 16:20:30,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:30" (1/1) ... [2025-01-09 16:20:30,746 INFO L175 MemorySlicer]: Split 92 memory accesses to 5 slices as follows [2, 8, 5, 23, 54]. 59 percent of accesses are in the largest equivalence class. The 58 initializations are split as follows [2, 8, 5, 20, 23]. The 16 writes are split as follows [0, 0, 0, 2, 14]. [2025-01-09 16:20:30,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:30" (1/1) ... [2025-01-09 16:20:30,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:30" (1/1) ... [2025-01-09 16:20:30,753 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:30" (1/1) ... [2025-01-09 16:20:30,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:30" (1/1) ... [2025-01-09 16:20:30,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:30" (1/1) ... [2025-01-09 16:20:30,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:30" (1/1) ... [2025-01-09 16:20:30,758 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:30" (1/1) ... [2025-01-09 16:20:30,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:20:30,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:20:30,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:20:30,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:20:30,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:30" (1/1) ... [2025-01-09 16:20:30,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:20:30,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:20:30,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:20:30,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:20:30,805 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-09 16:20:30,805 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-09 16:20:30,805 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-09 16:20:30,806 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-09 16:20:30,806 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:20:30,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:20:30,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:20:30,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 16:20:30,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 16:20:30,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 16:20:30,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:20:30,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:20:30,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 16:20:30,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 16:20:30,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 16:20:30,806 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:20:30,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:20:30,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:20:30,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:20:30,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 16:20:30,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 16:20:30,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 16:20:30,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:20:30,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:20:30,808 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:20:30,903 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:20:30,904 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:20:31,153 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:20:31,153 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:20:31,516 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:20:31,516 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:20:31,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:20:31 BoogieIcfgContainer [2025-01-09 16:20:31,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:20:31,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:20:31,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:20:31,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:20:31,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:20:30" (1/3) ... [2025-01-09 16:20:31,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62269156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:20:31, skipping insertion in model container [2025-01-09 16:20:31,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:30" (2/3) ... [2025-01-09 16:20:31,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62269156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:20:31, skipping insertion in model container [2025-01-09 16:20:31,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:20:31" (3/3) ... [2025-01-09 16:20:31,526 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2025-01-09 16:20:31,537 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:20:31,540 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 40 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-01-09 16:20:31,540 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:20:31,592 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:20:31,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 46 transitions, 106 flow [2025-01-09 16:20:31,645 INFO L124 PetriNetUnfolderBase]: 7/44 cut-off events. [2025-01-09 16:20:31,646 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:20:31,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 44 events. 7/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-01-09 16:20:31,650 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 46 transitions, 106 flow [2025-01-09 16:20:31,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 42 transitions, 93 flow [2025-01-09 16:20:31,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:20:31,670 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;@4b9fb126, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:20:31,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 16:20:31,676 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:20:31,676 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-09 16:20:31,676 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:20:31,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:31,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-09 16:20:31,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:20:31,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:31,681 INFO L85 PathProgramCache]: Analyzing trace with hash 712553, now seen corresponding path program 1 times [2025-01-09 16:20:31,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:31,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621492876] [2025-01-09 16:20:31,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:20:31,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:31,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 16:20:31,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 16:20:31,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:20:31,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:31,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:31,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621492876] [2025-01-09 16:20:31,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621492876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:20:31,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:20:31,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:20:31,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751486526] [2025-01-09 16:20:31,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:20:31,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:20:31,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:31,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:20:31,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:20:31,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-01-09 16:20:31,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 93 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:31,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:31,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-01-09 16:20:31,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:31,982 INFO L124 PetriNetUnfolderBase]: 425/774 cut-off events. [2025-01-09 16:20:31,982 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-09 16:20:31,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1505 conditions, 774 events. 425/774 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3507 event pairs, 331 based on Foata normal form. 47/739 useless extension candidates. Maximal degree in co-relation 1446. Up to 691 conditions per place. [2025-01-09 16:20:31,987 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 30 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2025-01-09 16:20:31,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 143 flow [2025-01-09 16:20:31,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:20:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 16:20:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2025-01-09 16:20:31,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5760869565217391 [2025-01-09 16:20:31,996 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 93 flow. Second operand 2 states and 53 transitions. [2025-01-09 16:20:31,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 143 flow [2025-01-09 16:20:31,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:20:32,000 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 78 flow [2025-01-09 16:20:32,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2025-01-09 16:20:32,004 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2025-01-09 16:20:32,004 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 78 flow [2025-01-09 16:20:32,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:32,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:32,004 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:32,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:20:32,004 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:20:32,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:32,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2127534379, now seen corresponding path program 1 times [2025-01-09 16:20:32,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:32,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822092391] [2025-01-09 16:20:32,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:20:32,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:32,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:20:32,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:20:32,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:20:32,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:32,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:32,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822092391] [2025-01-09 16:20:32,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822092391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:20:32,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:20:32,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:20:32,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28008119] [2025-01-09 16:20:32,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:20:32,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:20:32,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:32,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:20:32,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:20:32,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-01-09 16:20:32,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:32,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:32,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-01-09 16:20:32,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:32,317 INFO L124 PetriNetUnfolderBase]: 405/752 cut-off events. [2025-01-09 16:20:32,318 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 16:20:32,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1452 conditions, 752 events. 405/752 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3505 event pairs, 304 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 1449. Up to 622 conditions per place. [2025-01-09 16:20:32,324 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 39 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2025-01-09 16:20:32,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 184 flow [2025-01-09 16:20:32,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:20:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:20:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-01-09 16:20:32,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2025-01-09 16:20:32,328 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 78 flow. Second operand 3 states and 72 transitions. [2025-01-09 16:20:32,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 184 flow [2025-01-09 16:20:32,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:20:32,330 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 80 flow [2025-01-09 16:20:32,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2025-01-09 16:20:32,332 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2025-01-09 16:20:32,332 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 80 flow [2025-01-09 16:20:32,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:32,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:32,333 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:32,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:20:32,333 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:20:32,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:32,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1529054580, now seen corresponding path program 1 times [2025-01-09 16:20:32,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:32,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223647111] [2025-01-09 16:20:32,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:20:32,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:32,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:20:32,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:20:32,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:20:32,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:32,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:32,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:32,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223647111] [2025-01-09 16:20:32,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223647111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:20:32,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:20:32,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:20:32,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533106807] [2025-01-09 16:20:32,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:20:32,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:20:32,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:32,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:20:32,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:20:32,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-01-09 16:20:32,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:32,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:32,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-01-09 16:20:32,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:33,168 INFO L124 PetriNetUnfolderBase]: 674/1247 cut-off events. [2025-01-09 16:20:33,168 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-01-09 16:20:33,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2432 conditions, 1247 events. 674/1247 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6193 event pairs, 74 based on Foata normal form. 0/1196 useless extension candidates. Maximal degree in co-relation 2428. Up to 658 conditions per place. [2025-01-09 16:20:33,175 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 70 selfloop transitions, 10 changer transitions 3/90 dead transitions. [2025-01-09 16:20:33,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 90 transitions, 367 flow [2025-01-09 16:20:33,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:20:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:20:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-01-09 16:20:33,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5253623188405797 [2025-01-09 16:20:33,176 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 80 flow. Second operand 6 states and 145 transitions. [2025-01-09 16:20:33,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 90 transitions, 367 flow [2025-01-09 16:20:33,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 90 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:20:33,178 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 144 flow [2025-01-09 16:20:33,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2025-01-09 16:20:33,179 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2025-01-09 16:20:33,179 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 144 flow [2025-01-09 16:20:33,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:33,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:33,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:33,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:20:33,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:20:33,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:33,180 INFO L85 PathProgramCache]: Analyzing trace with hash 674034163, now seen corresponding path program 1 times [2025-01-09 16:20:33,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:33,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314206407] [2025-01-09 16:20:33,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:20:33,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:33,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:20:33,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:20:33,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:20:33,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:33,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:33,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314206407] [2025-01-09 16:20:33,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314206407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:20:33,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:20:33,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:20:33,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355601099] [2025-01-09 16:20:33,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:20:33,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:20:33,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:33,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:20:33,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:20:33,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-01-09 16:20:33,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:33,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:33,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-01-09 16:20:33,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:33,393 INFO L124 PetriNetUnfolderBase]: 419/813 cut-off events. [2025-01-09 16:20:33,393 INFO L125 PetriNetUnfolderBase]: For 112/116 co-relation queries the response was YES. [2025-01-09 16:20:33,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1678 conditions, 813 events. 419/813 cut-off events. For 112/116 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3580 event pairs, 215 based on Foata normal form. 32/827 useless extension candidates. Maximal degree in co-relation 1671. Up to 416 conditions per place. [2025-01-09 16:20:33,396 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 36 selfloop transitions, 4 changer transitions 3/49 dead transitions. [2025-01-09 16:20:33,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 213 flow [2025-01-09 16:20:33,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:20:33,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:20:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-01-09 16:20:33,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5289855072463768 [2025-01-09 16:20:33,397 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 144 flow. Second operand 3 states and 73 transitions. [2025-01-09 16:20:33,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 213 flow [2025-01-09 16:20:33,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 207 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:20:33,399 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 106 flow [2025-01-09 16:20:33,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2025-01-09 16:20:33,399 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2025-01-09 16:20:33,400 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 106 flow [2025-01-09 16:20:33,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:33,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:33,400 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] [2025-01-09 16:20:33,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:20:33,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:20:33,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:33,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1548791762, now seen corresponding path program 1 times [2025-01-09 16:20:33,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:33,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391412159] [2025-01-09 16:20:33,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:20:33,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:33,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:20:33,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:20:33,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:20:33,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:33,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:33,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391412159] [2025-01-09 16:20:33,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391412159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:20:33,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:20:33,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:20:33,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779918099] [2025-01-09 16:20:33,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:20:33,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:20:33,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:33,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:20:33,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:20:33,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-01-09 16:20:33,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:33,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:33,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-01-09 16:20:33,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:33,585 INFO L124 PetriNetUnfolderBase]: 249/546 cut-off events. [2025-01-09 16:20:33,585 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-01-09 16:20:33,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 546 events. 249/546 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2146 event pairs, 85 based on Foata normal form. 32/571 useless extension candidates. Maximal degree in co-relation 1124. Up to 252 conditions per place. [2025-01-09 16:20:33,587 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 33 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2025-01-09 16:20:33,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 207 flow [2025-01-09 16:20:33,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:20:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:20:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-01-09 16:20:33,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2025-01-09 16:20:33,588 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 106 flow. Second operand 3 states and 70 transitions. [2025-01-09 16:20:33,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 207 flow [2025-01-09 16:20:33,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 197 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-09 16:20:33,590 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 108 flow [2025-01-09 16:20:33,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-01-09 16:20:33,591 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2025-01-09 16:20:33,591 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 108 flow [2025-01-09 16:20:33,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:33,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:33,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:33,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:20:33,591 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:20:33,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:33,591 INFO L85 PathProgramCache]: Analyzing trace with hash -93960375, now seen corresponding path program 1 times [2025-01-09 16:20:33,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:33,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814924790] [2025-01-09 16:20:33,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:20:33,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:33,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:20:33,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:20:33,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:20:33,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:35,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:35,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814924790] [2025-01-09 16:20:35,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814924790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:20:35,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:20:35,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:20:35,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22099237] [2025-01-09 16:20:35,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:20:35,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:20:35,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:35,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:20:35,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:20:35,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-01-09 16:20:35,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 108 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:35,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:35,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-01-09 16:20:35,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:35,434 INFO L124 PetriNetUnfolderBase]: 357/790 cut-off events. [2025-01-09 16:20:35,435 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2025-01-09 16:20:35,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 790 events. 357/790 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3780 event pairs, 75 based on Foata normal form. 0/781 useless extension candidates. Maximal degree in co-relation 1704. Up to 264 conditions per place. [2025-01-09 16:20:35,439 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 64 selfloop transitions, 14 changer transitions 8/92 dead transitions. [2025-01-09 16:20:35,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 92 transitions, 451 flow [2025-01-09 16:20:35,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:20:35,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:20:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2025-01-09 16:20:35,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4251207729468599 [2025-01-09 16:20:35,441 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 108 flow. Second operand 9 states and 176 transitions. [2025-01-09 16:20:35,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 92 transitions, 451 flow [2025-01-09 16:20:35,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 92 transitions, 429 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:20:35,445 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 200 flow [2025-01-09 16:20:35,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=200, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2025-01-09 16:20:35,445 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2025-01-09 16:20:35,445 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 200 flow [2025-01-09 16:20:35,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:35,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:35,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:35,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:20:35,446 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:20:35,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:35,446 INFO L85 PathProgramCache]: Analyzing trace with hash -728951629, now seen corresponding path program 2 times [2025-01-09 16:20:35,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:35,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685156778] [2025-01-09 16:20:35,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:20:35,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:35,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:20:35,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:20:35,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:20:35,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:36,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:36,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:36,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685156778] [2025-01-09 16:20:36,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685156778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:20:36,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:20:36,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:20:36,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917169477] [2025-01-09 16:20:36,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:20:36,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:20:36,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:36,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:20:36,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:20:36,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-01-09 16:20:36,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 200 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:36,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:36,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-01-09 16:20:36,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:36,787 INFO L124 PetriNetUnfolderBase]: 466/1042 cut-off events. [2025-01-09 16:20:36,788 INFO L125 PetriNetUnfolderBase]: For 800/802 co-relation queries the response was YES. [2025-01-09 16:20:36,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2696 conditions, 1042 events. 466/1042 cut-off events. For 800/802 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5820 event pairs, 126 based on Foata normal form. 0/1024 useless extension candidates. Maximal degree in co-relation 2683. Up to 607 conditions per place. [2025-01-09 16:20:36,793 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 68 selfloop transitions, 15 changer transitions 4/93 dead transitions. [2025-01-09 16:20:36,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 93 transitions, 564 flow [2025-01-09 16:20:36,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:20:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:20:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2025-01-09 16:20:36,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40096618357487923 [2025-01-09 16:20:36,796 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 200 flow. Second operand 9 states and 166 transitions. [2025-01-09 16:20:36,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 93 transitions, 564 flow [2025-01-09 16:20:36,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 546 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-09 16:20:36,802 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 345 flow [2025-01-09 16:20:36,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=345, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2025-01-09 16:20:36,803 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2025-01-09 16:20:36,803 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 345 flow [2025-01-09 16:20:36,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:36,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:36,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:36,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:20:36,805 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:20:36,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:36,805 INFO L85 PathProgramCache]: Analyzing trace with hash 233458765, now seen corresponding path program 3 times [2025-01-09 16:20:36,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:36,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687617661] [2025-01-09 16:20:36,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:20:36,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:36,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:20:36,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:20:36,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:20:36,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:37,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:37,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:37,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687617661] [2025-01-09 16:20:37,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687617661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:20:37,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:20:37,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:20:37,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191670508] [2025-01-09 16:20:37,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:20:37,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:20:37,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:37,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:20:37,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:20:37,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-01-09 16:20:37,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 345 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:37,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:37,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-01-09 16:20:37,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:37,943 INFO L124 PetriNetUnfolderBase]: 596/1327 cut-off events. [2025-01-09 16:20:37,943 INFO L125 PetriNetUnfolderBase]: For 1684/1684 co-relation queries the response was YES. [2025-01-09 16:20:37,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3714 conditions, 1327 events. 596/1327 cut-off events. For 1684/1684 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7588 event pairs, 82 based on Foata normal form. 0/1320 useless extension candidates. Maximal degree in co-relation 3695. Up to 306 conditions per place. [2025-01-09 16:20:37,950 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 81 selfloop transitions, 26 changer transitions 4/117 dead transitions. [2025-01-09 16:20:37,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 117 transitions, 808 flow [2025-01-09 16:20:37,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:20:37,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:20:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2025-01-09 16:20:37,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42995169082125606 [2025-01-09 16:20:37,951 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 345 flow. Second operand 9 states and 178 transitions. [2025-01-09 16:20:37,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 117 transitions, 808 flow [2025-01-09 16:20:37,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 117 transitions, 762 flow, removed 23 selfloop flow, removed 0 redundant places. [2025-01-09 16:20:37,958 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 444 flow [2025-01-09 16:20:37,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=444, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2025-01-09 16:20:37,959 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2025-01-09 16:20:37,959 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 444 flow [2025-01-09 16:20:37,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:37,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:37,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:37,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:20:37,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:20:37,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:37,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1113307233, now seen corresponding path program 4 times [2025-01-09 16:20:37,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:37,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439856680] [2025-01-09 16:20:37,960 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:20:37,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:37,976 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:20:38,004 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:20:38,005 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:20:38,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:38,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:38,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439856680] [2025-01-09 16:20:38,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439856680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:20:38,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:20:38,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:20:38,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638321045] [2025-01-09 16:20:38,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:20:38,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:20:38,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:38,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:20:38,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:20:38,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-01-09 16:20:38,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 444 flow. Second operand has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 11 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:38,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:38,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-01-09 16:20:38,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:39,349 INFO L124 PetriNetUnfolderBase]: 682/1512 cut-off events. [2025-01-09 16:20:39,349 INFO L125 PetriNetUnfolderBase]: For 2844/2848 co-relation queries the response was YES. [2025-01-09 16:20:39,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4519 conditions, 1512 events. 682/1512 cut-off events. For 2844/2848 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9079 event pairs, 138 based on Foata normal form. 4/1503 useless extension candidates. Maximal degree in co-relation 4496. Up to 643 conditions per place. [2025-01-09 16:20:39,355 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 89 selfloop transitions, 27 changer transitions 8/130 dead transitions. [2025-01-09 16:20:39,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 130 transitions, 977 flow [2025-01-09 16:20:39,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:20:39,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:20:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2025-01-09 16:20:39,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42391304347826086 [2025-01-09 16:20:39,357 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 444 flow. Second operand 10 states and 195 transitions. [2025-01-09 16:20:39,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 130 transitions, 977 flow [2025-01-09 16:20:39,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 130 transitions, 896 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-01-09 16:20:39,365 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 622 flow [2025-01-09 16:20:39,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=622, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2025-01-09 16:20:39,366 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2025-01-09 16:20:39,367 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 622 flow [2025-01-09 16:20:39,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 11 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:39,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:39,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:39,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:20:39,367 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:20:39,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:39,368 INFO L85 PathProgramCache]: Analyzing trace with hash -124518127, now seen corresponding path program 5 times [2025-01-09 16:20:39,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:39,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120352104] [2025-01-09 16:20:39,368 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:20:39,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:39,382 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:20:39,400 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:20:39,400 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:20:39,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:40,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:40,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120352104] [2025-01-09 16:20:40,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120352104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:20:40,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:20:40,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:20:40,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425170541] [2025-01-09 16:20:40,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:20:40,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:20:40,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:40,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:20:40,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:20:40,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-01-09 16:20:40,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 622 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:40,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:40,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-01-09 16:20:40,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:40,411 INFO L124 PetriNetUnfolderBase]: 673/1467 cut-off events. [2025-01-09 16:20:40,411 INFO L125 PetriNetUnfolderBase]: For 3715/3715 co-relation queries the response was YES. [2025-01-09 16:20:40,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4841 conditions, 1467 events. 673/1467 cut-off events. For 3715/3715 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8431 event pairs, 149 based on Foata normal form. 28/1482 useless extension candidates. Maximal degree in co-relation 4811. Up to 694 conditions per place. [2025-01-09 16:20:40,419 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 91 selfloop transitions, 28 changer transitions 2/127 dead transitions. [2025-01-09 16:20:40,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 127 transitions, 1087 flow [2025-01-09 16:20:40,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:20:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:20:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2025-01-09 16:20:40,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40652173913043477 [2025-01-09 16:20:40,421 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 622 flow. Second operand 10 states and 187 transitions. [2025-01-09 16:20:40,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 127 transitions, 1087 flow [2025-01-09 16:20:40,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 127 transitions, 1008 flow, removed 38 selfloop flow, removed 1 redundant places. [2025-01-09 16:20:40,434 INFO L231 Difference]: Finished difference. Result has 99 places, 87 transitions, 722 flow [2025-01-09 16:20:40,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=722, PETRI_PLACES=99, PETRI_TRANSITIONS=87} [2025-01-09 16:20:40,435 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 57 predicate places. [2025-01-09 16:20:40,435 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 87 transitions, 722 flow [2025-01-09 16:20:40,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:40,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:40,436 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] [2025-01-09 16:20:40,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:20:40,436 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:20:40,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:40,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2040909148, now seen corresponding path program 1 times [2025-01-09 16:20:40,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:40,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712863673] [2025-01-09 16:20:40,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:20:40,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:40,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:20:40,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:20:40,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:20:40,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:41,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:41,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:41,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712863673] [2025-01-09 16:20:41,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712863673] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:20:41,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607367774] [2025-01-09 16:20:41,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:20:41,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:41,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:20:41,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:20:41,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:20:41,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:20:41,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:20:41,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:20:41,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:41,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 16:20:41,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:20:41,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-01-09 16:20:41,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:20:41,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2025-01-09 16:20:41,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 16:20:42,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:20:42,074 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 50 treesize of output 52 [2025-01-09 16:20:42,083 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-01-09 16:20:42,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:20:42,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 35 [2025-01-09 16:20:42,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:20:42,506 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-01-09 16:20:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:42,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:20:43,008 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-01-09 16:20:43,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-01-09 16:20:43,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:20:43,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-01-09 16:20:43,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:20:43,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-01-09 16:20:43,902 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-01-09 16:20:43,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-01-09 16:20:44,798 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-01-09 16:20:44,801 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-01-09 16:20:44,812 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-01-09 16:20:44,814 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-01-09 16:20:44,823 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-01-09 16:20:44,826 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-01-09 16:20:44,847 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-01-09 16:20:44,854 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-01-09 16:20:44,891 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-01-09 16:20:44,895 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-01-09 16:20:45,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:20:45,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 18 case distinctions, treesize of input 3286 treesize of output 1991 [2025-01-09 16:20:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:47,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607367774] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:20:47,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:20:47,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-01-09 16:20:47,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585329134] [2025-01-09 16:20:47,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:20:47,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 16:20:47,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:47,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 16:20:47,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2025-01-09 16:20:48,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-01-09 16:20:48,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 87 transitions, 722 flow. Second operand has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:48,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:48,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-01-09 16:20:48,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:51,370 INFO L124 PetriNetUnfolderBase]: 918/1892 cut-off events. [2025-01-09 16:20:51,370 INFO L125 PetriNetUnfolderBase]: For 5718/5724 co-relation queries the response was YES. [2025-01-09 16:20:51,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6707 conditions, 1892 events. 918/1892 cut-off events. For 5718/5724 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 11207 event pairs, 103 based on Foata normal form. 21/1906 useless extension candidates. Maximal degree in co-relation 6673. Up to 928 conditions per place. [2025-01-09 16:20:51,381 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 123 selfloop transitions, 67 changer transitions 6/201 dead transitions. [2025-01-09 16:20:51,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 201 transitions, 1788 flow [2025-01-09 16:20:51,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 16:20:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-09 16:20:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 325 transitions. [2025-01-09 16:20:51,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3532608695652174 [2025-01-09 16:20:51,384 INFO L175 Difference]: Start difference. First operand has 99 places, 87 transitions, 722 flow. Second operand 20 states and 325 transitions. [2025-01-09 16:20:51,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 201 transitions, 1788 flow [2025-01-09 16:20:51,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 201 transitions, 1675 flow, removed 24 selfloop flow, removed 5 redundant places. [2025-01-09 16:20:51,396 INFO L231 Difference]: Finished difference. Result has 121 places, 131 transitions, 1236 flow [2025-01-09 16:20:51,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1236, PETRI_PLACES=121, PETRI_TRANSITIONS=131} [2025-01-09 16:20:51,397 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 79 predicate places. [2025-01-09 16:20:51,397 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 131 transitions, 1236 flow [2025-01-09 16:20:51,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:51,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:51,398 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] [2025-01-09 16:20:51,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:20:51,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 16:20:51,599 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:20:51,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1038432650, now seen corresponding path program 2 times [2025-01-09 16:20:51,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:51,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324067276] [2025-01-09 16:20:51,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:20:51,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:51,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:20:51,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:20:51,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:20:51,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:52,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:52,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324067276] [2025-01-09 16:20:52,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324067276] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:20:52,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361465624] [2025-01-09 16:20:52,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:20:52,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:52,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:20:52,534 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:20:52,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:20:52,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:20:52,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:20:52,756 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:20:52,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:52,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 16:20:52,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:20:52,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-01-09 16:20:52,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:20:52,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2025-01-09 16:20:52,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 16:20:53,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:20:53,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2025-01-09 16:20:53,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2025-01-09 16:20:53,817 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2025-01-09 16:20:53,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 115 treesize of output 69 [2025-01-09 16:20:53,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:20:53,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 55 [2025-01-09 16:20:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:53,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:20:54,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:20:54,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-01-09 16:20:54,045 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-01-09 16:20:54,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 14 treesize of output 18 [2025-01-09 16:20:54,892 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-01-09 16:20:54,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-01-09 16:20:54,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:20:54,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-01-09 16:20:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:56,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361465624] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:20:56,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:20:56,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-01-09 16:20:56,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091286523] [2025-01-09 16:20:56,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:20:56,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 16:20:56,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:56,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 16:20:56,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2025-01-09 16:20:56,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-01-09 16:20:56,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 131 transitions, 1236 flow. Second operand has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:56,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:56,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-01-09 16:20:56,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:58,193 INFO L124 PetriNetUnfolderBase]: 1099/2284 cut-off events. [2025-01-09 16:20:58,194 INFO L125 PetriNetUnfolderBase]: For 9258/9258 co-relation queries the response was YES. [2025-01-09 16:20:58,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9051 conditions, 2284 events. 1099/2284 cut-off events. For 9258/9258 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 13980 event pairs, 248 based on Foata normal form. 21/2305 useless extension candidates. Maximal degree in co-relation 9009. Up to 1054 conditions per place. [2025-01-09 16:20:58,219 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 151 selfloop transitions, 45 changer transitions 4/205 dead transitions. [2025-01-09 16:20:58,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 205 transitions, 2095 flow [2025-01-09 16:20:58,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:20:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:20:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 223 transitions. [2025-01-09 16:20:58,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40398550724637683 [2025-01-09 16:20:58,225 INFO L175 Difference]: Start difference. First operand has 121 places, 131 transitions, 1236 flow. Second operand 12 states and 223 transitions. [2025-01-09 16:20:58,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 205 transitions, 2095 flow [2025-01-09 16:20:58,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 205 transitions, 1994 flow, removed 39 selfloop flow, removed 5 redundant places. [2025-01-09 16:20:58,274 INFO L231 Difference]: Finished difference. Result has 132 places, 144 transitions, 1441 flow [2025-01-09 16:20:58,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1441, PETRI_PLACES=132, PETRI_TRANSITIONS=144} [2025-01-09 16:20:58,276 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 90 predicate places. [2025-01-09 16:20:58,276 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 144 transitions, 1441 flow [2025-01-09 16:20:58,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:58,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:58,280 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] [2025-01-09 16:20:58,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:20:58,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:58,482 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:20:58,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:58,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1186625166, now seen corresponding path program 3 times [2025-01-09 16:20:58,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:58,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781073136] [2025-01-09 16:20:58,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:20:58,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:58,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:20:58,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:20:58,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:20:58,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:59,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:59,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781073136] [2025-01-09 16:20:59,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781073136] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:20:59,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670673563] [2025-01-09 16:20:59,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:20:59,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:59,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:20:59,464 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:20:59,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:20:59,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:20:59,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:20:59,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:20:59,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:59,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 16:20:59,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:20:59,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-01-09 16:20:59,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:20:59,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2025-01-09 16:20:59,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-01-09 16:21:00,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:21:00,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2025-01-09 16:21:00,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:21:00,276 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 50 treesize of output 52 [2025-01-09 16:21:01,082 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2025-01-09 16:21:01,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 123 treesize of output 85 [2025-01-09 16:21:01,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:21:01,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 55 [2025-01-09 16:21:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:01,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:21:01,339 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-01-09 16:21:01,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-01-09 16:21:01,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:21:01,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-01-09 16:21:02,316 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-01-09 16:21:02,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-01-09 16:21:02,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:21:02,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-01-09 16:21:03,361 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-01-09 16:21:03,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-01-09 16:21:03,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:03,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670673563] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:21:03,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:21:03,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-01-09 16:21:03,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891051445] [2025-01-09 16:21:03,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:21:03,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 16:21:03,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:03,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 16:21:03,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2025-01-09 16:21:04,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-01-09 16:21:04,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 144 transitions, 1441 flow. Second operand has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:04,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:04,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-01-09 16:21:04,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:08,285 INFO L124 PetriNetUnfolderBase]: 1530/3155 cut-off events. [2025-01-09 16:21:08,286 INFO L125 PetriNetUnfolderBase]: For 14839/14839 co-relation queries the response was YES. [2025-01-09 16:21:08,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13138 conditions, 3155 events. 1530/3155 cut-off events. For 14839/14839 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 20536 event pairs, 187 based on Foata normal form. 7/3162 useless extension candidates. Maximal degree in co-relation 13090. Up to 740 conditions per place. [2025-01-09 16:21:08,341 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 194 selfloop transitions, 110 changer transitions 5/314 dead transitions. [2025-01-09 16:21:08,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 314 transitions, 3337 flow [2025-01-09 16:21:08,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 16:21:08,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 16:21:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 382 transitions. [2025-01-09 16:21:08,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39544513457556935 [2025-01-09 16:21:08,345 INFO L175 Difference]: Start difference. First operand has 132 places, 144 transitions, 1441 flow. Second operand 21 states and 382 transitions. [2025-01-09 16:21:08,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 314 transitions, 3337 flow [2025-01-09 16:21:08,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 314 transitions, 3223 flow, removed 35 selfloop flow, removed 5 redundant places. [2025-01-09 16:21:08,389 INFO L231 Difference]: Finished difference. Result has 158 places, 190 transitions, 2263 flow [2025-01-09 16:21:08,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1351, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2263, PETRI_PLACES=158, PETRI_TRANSITIONS=190} [2025-01-09 16:21:08,389 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 116 predicate places. [2025-01-09 16:21:08,391 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 190 transitions, 2263 flow [2025-01-09 16:21:08,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:08,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:08,392 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] [2025-01-09 16:21:08,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:21:08,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:21:08,593 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:08,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:08,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1048981236, now seen corresponding path program 4 times [2025-01-09 16:21:08,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:08,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080154316] [2025-01-09 16:21:08,594 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:21:08,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:08,609 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:21:08,632 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:21:08,632 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:21:08,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:09,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:09,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080154316] [2025-01-09 16:21:09,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080154316] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:21:09,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303206043] [2025-01-09 16:21:09,605 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:21:09,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:21:09,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:21:09,607 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:21:09,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:21:09,718 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:21:09,759 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:21:09,759 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:21:09,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:09,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 16:21:09,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:21:09,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-01-09 16:21:09,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:21:09,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2025-01-09 16:21:09,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 16:21:10,169 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-01-09 16:21:10,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2025-01-09 16:21:10,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:21:10,835 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 102 treesize of output 86 [2025-01-09 16:21:10,845 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2025-01-09 16:21:10,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 50 [2025-01-09 16:21:10,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:10,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:21:11,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:21:11,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-01-09 16:21:11,064 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-01-09 16:21:11,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-01-09 16:21:12,054 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-01-09 16:21:12,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-01-09 16:21:12,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:21:12,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-01-09 16:21:12,926 INFO L349 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2025-01-09 16:21:12,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 31 [2025-01-09 16:21:13,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:13,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303206043] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:21:13,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:21:13,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2025-01-09 16:21:13,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223132194] [2025-01-09 16:21:13,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:21:13,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 16:21:13,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:13,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 16:21:13,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2025-01-09 16:21:13,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-01-09 16:21:13,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 190 transitions, 2263 flow. Second operand has 30 states, 30 states have (on average 11.266666666666667) internal successors, (338), 30 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:13,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:13,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-01-09 16:21:13,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:17,026 INFO L124 PetriNetUnfolderBase]: 2089/4280 cut-off events. [2025-01-09 16:21:17,027 INFO L125 PetriNetUnfolderBase]: For 36008/36008 co-relation queries the response was YES. [2025-01-09 16:21:17,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21110 conditions, 4280 events. 2089/4280 cut-off events. For 36008/36008 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 28826 event pairs, 243 based on Foata normal form. 7/4287 useless extension candidates. Maximal degree in co-relation 21050. Up to 791 conditions per place. [2025-01-09 16:21:17,054 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 231 selfloop transitions, 129 changer transitions 4/369 dead transitions. [2025-01-09 16:21:17,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 369 transitions, 4741 flow [2025-01-09 16:21:17,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 16:21:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 16:21:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 374 transitions. [2025-01-09 16:21:17,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38716356107660455 [2025-01-09 16:21:17,056 INFO L175 Difference]: Start difference. First operand has 158 places, 190 transitions, 2263 flow. Second operand 21 states and 374 transitions. [2025-01-09 16:21:17,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 369 transitions, 4741 flow [2025-01-09 16:21:17,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 369 transitions, 4436 flow, removed 110 selfloop flow, removed 8 redundant places. [2025-01-09 16:21:17,135 INFO L231 Difference]: Finished difference. Result has 178 places, 230 transitions, 2998 flow [2025-01-09 16:21:17,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2035, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2998, PETRI_PLACES=178, PETRI_TRANSITIONS=230} [2025-01-09 16:21:17,136 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 136 predicate places. [2025-01-09 16:21:17,136 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 230 transitions, 2998 flow [2025-01-09 16:21:17,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.266666666666667) internal successors, (338), 30 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:17,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:17,136 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] [2025-01-09 16:21:17,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 16:21:17,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 16:21:17,341 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:17,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:17,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1655433058, now seen corresponding path program 5 times [2025-01-09 16:21:17,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:17,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155133880] [2025-01-09 16:21:17,345 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:21:17,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:17,360 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:21:17,384 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:21:17,384 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:21:17,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:18,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:18,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155133880] [2025-01-09 16:21:18,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155133880] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:21:18,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650041295] [2025-01-09 16:21:18,430 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:21:18,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:21:18,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:21:18,432 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:21:18,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:21:18,527 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:21:18,565 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:21:18,565 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:21:18,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:18,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 16:21:18,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:21:18,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-01-09 16:21:18,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:21:18,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2025-01-09 16:21:18,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 16:21:18,887 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-01-09 16:21:18,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:21:18,917 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 50 treesize of output 52 [2025-01-09 16:21:19,536 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2025-01-09 16:21:19,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 70 [2025-01-09 16:21:19,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:21:19,540 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 66 treesize of output 42 [2025-01-09 16:21:19,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:19,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:21:19,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:21:19,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-01-09 16:21:19,789 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-01-09 16:21:19,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-01-09 16:21:20,528 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-01-09 16:21:20,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-01-09 16:21:20,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:21:20,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-01-09 16:21:21,101 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-01-09 16:21:21,104 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-01-09 16:21:21,110 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-01-09 16:21:21,113 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-01-09 16:21:21,131 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-01-09 16:21:21,133 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-01-09 16:21:21,140 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-01-09 16:21:21,143 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-01-09 16:21:21,165 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-01-09 16:21:21,168 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-01-09 16:21:21,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:21:21,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 9228 treesize of output 5319 [2025-01-09 16:21:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:22,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650041295] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:21:22,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:21:22,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-01-09 16:21:22,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752253438] [2025-01-09 16:21:22,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:21:22,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 16:21:22,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:22,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 16:21:22,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2025-01-09 16:21:22,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-01-09 16:21:22,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 230 transitions, 2998 flow. Second operand has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:22,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:22,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-01-09 16:21:22,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:24,080 INFO L124 PetriNetUnfolderBase]: 2281/4700 cut-off events. [2025-01-09 16:21:24,080 INFO L125 PetriNetUnfolderBase]: For 51670/51670 co-relation queries the response was YES. [2025-01-09 16:21:24,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24849 conditions, 4700 events. 2281/4700 cut-off events. For 51670/51670 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 32847 event pairs, 517 based on Foata normal form. 26/4726 useless extension candidates. Maximal degree in co-relation 24781. Up to 3113 conditions per place. [2025-01-09 16:21:24,113 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 258 selfloop transitions, 52 changer transitions 8/323 dead transitions. [2025-01-09 16:21:24,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 323 transitions, 4501 flow [2025-01-09 16:21:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:21:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:21:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 278 transitions. [2025-01-09 16:21:24,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4028985507246377 [2025-01-09 16:21:24,117 INFO L175 Difference]: Start difference. First operand has 178 places, 230 transitions, 2998 flow. Second operand 15 states and 278 transitions. [2025-01-09 16:21:24,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 323 transitions, 4501 flow [2025-01-09 16:21:24,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 323 transitions, 4234 flow, removed 90 selfloop flow, removed 9 redundant places. [2025-01-09 16:21:24,232 INFO L231 Difference]: Finished difference. Result has 191 places, 247 transitions, 3232 flow [2025-01-09 16:21:24,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2770, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3232, PETRI_PLACES=191, PETRI_TRANSITIONS=247} [2025-01-09 16:21:24,234 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 149 predicate places. [2025-01-09 16:21:24,234 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 247 transitions, 3232 flow [2025-01-09 16:21:24,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:24,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:24,236 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:24,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 16:21:24,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 16:21:24,437 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:24,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:24,437 INFO L85 PathProgramCache]: Analyzing trace with hash 738047123, now seen corresponding path program 1 times [2025-01-09 16:21:24,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:24,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421223235] [2025-01-09 16:21:24,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:21:24,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:24,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:21:24,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:21:24,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:24,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:21:24,468 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:21:24,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:21:24,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:21:24,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:24,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:21:24,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:21:24,565 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:21:24,566 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-01-09 16:21:24,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-01-09 16:21:24,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-01-09 16:21:24,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-01-09 16:21:24,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-01-09 16:21:24,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-01-09 16:21:24,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-01-09 16:21:24,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:21:24,569 INFO L422 BasicCegarLoop]: Path program histogram: [5, 5, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:24,616 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:21:24,616 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:21:24,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:21:24 BasicIcfg [2025-01-09 16:21:24,620 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:21:24,621 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:21:24,621 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:21:24,621 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:21:24,622 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:20:31" (3/4) ... [2025-01-09 16:21:24,623 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 16:21:24,689 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 28. [2025-01-09 16:21:24,739 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:21:24,739 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:21:24,739 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:21:24,740 INFO L158 Benchmark]: Toolchain (without parser) took 54503.62ms. Allocated memory was 142.6MB in the beginning and 805.3MB in the end (delta: 662.7MB). Free memory was 104.6MB in the beginning and 681.4MB in the end (delta: -576.8MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. [2025-01-09 16:21:24,740 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:21:24,740 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.51ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 74.2MB in the end (delta: 29.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:21:24,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.92ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 70.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:21:24,741 INFO L158 Benchmark]: Boogie Preprocessor took 33.93ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 68.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:21:24,741 INFO L158 Benchmark]: RCFGBuilder took 756.00ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 69.2MB in the end (delta: -1.3MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2025-01-09 16:21:24,741 INFO L158 Benchmark]: TraceAbstraction took 53099.84ms. Allocated memory was 142.6MB in the beginning and 805.3MB in the end (delta: 662.7MB). Free memory was 69.2MB in the beginning and 694.0MB in the end (delta: -624.8MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2025-01-09 16:21:24,741 INFO L158 Benchmark]: Witness Printer took 118.26ms. Allocated memory is still 805.3MB. Free memory was 694.0MB in the beginning and 681.4MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:21:24,742 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.51ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 74.2MB in the end (delta: 29.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.92ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 70.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.93ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 68.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 756.00ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 69.2MB in the end (delta: -1.3MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. * TraceAbstraction took 53099.84ms. Allocated memory was 142.6MB in the beginning and 805.3MB in the end (delta: 662.7MB). Free memory was 69.2MB in the beginning and 694.0MB in the end (delta: -624.8MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. * Witness Printer took 118.26ms. Allocated memory is still 805.3MB. Free memory was 694.0MB in the beginning and 681.4MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L950] 0 _Bool enqueue_flag, dequeue_flag; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L1054] 0 pthread_t id1, id2; [L1055] 0 enqueue_flag=(1) [L1056] 0 dequeue_flag=(0) [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 [L955] 0 q->tail=0 [L956] 0 q->amount=0 [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head [L960] EXPR 0 q->tail [L960] COND TRUE 0 q->head == q->tail [L963] 0 return (-1); [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) [L1063] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-2, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1007] 1 int value, i; VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1064] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-2, id2=-1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1036] 2 int i; [L1037] 2 i=0 VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] COND TRUE 2 i<(20) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] 2 i++ VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1009] 1 value = __VERIFIER_nondet_int() [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (20)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) [L1013] 1 stored_elements[0]=value [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head [L960] EXPR 1 q->tail [L960] COND FALSE 1 !(q->head == q->tail) [L966] 1 return 0; [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) [L1018] 1 i=0 VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1018] COND TRUE 1 i<((20)-1) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1021] COND TRUE 1 \read(enqueue_flag) [L1023] 1 value = __VERIFIER_nondet_int() [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (20)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value [L1026] 1 enqueue_flag=(0) [L1027] 1 dequeue_flag=(1) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=1] [L1037] COND TRUE 2 i<(20) VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; [L995] EXPR 2 q->head [L995] EXPR 2 q->element[q->head] [L995] 2 x = q->element[q->head] [L996] EXPR 2 q->amount [L996] 2 q->amount-- [L996] 2 q->amount-- [L997] EXPR 2 q->head [L997] COND FALSE 2 !(q->head == (20)) [L1002] EXPR 2 q->head [L1002] 2 q->head++ [L1002] 2 q->head++ [L1003] 2 return x; [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1043] 2 reach_error() VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] - UnprovableResult [Line: 1059]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 70 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 53.0s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1773 SdHoareTripleChecker+Valid, 12.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1717 mSDsluCounter, 1446 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1366 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9045 IncrementalHoareTripleChecker+Invalid, 9176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 80 mSDtfsCounter, 9045 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 197 SyntacticMatches, 4 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3232occurred in iteration=15, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 31.3s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 564 ConstructedInterpolants, 116 QuantifiedInterpolants, 71165 SizeOfPredicates, 205 NumberOfNonLiveVariables, 1770 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 0/57 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 16:21:24,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE