./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/test-context1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/test-context1.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d63a80d2bfe8ff8bb62e6b5083cee589f2cb0f37dc67867654ab7601d82af23e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:28:09,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:28:09,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:28:09,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:28:09,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:28:09,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:28:09,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:28:09,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:28:09,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:28:09,678 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:28:09,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:28:09,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:28:09,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:28:09,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:28:09,679 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:28:09,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:28:09,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:28:09,679 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:28:09,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:28:09,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:28:09,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:28:09,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:28:09,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:28:09,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:28:09,679 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:28:09,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:28:09,679 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:28:09,679 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:28:09,679 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:28:09,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:28:09,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:28:09,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:28:09,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:28:09,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:28:09,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:28:09,683 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:28:09,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:28:09,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:28:09,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:28:09,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:28:09,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:28:09,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:28:09,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:28:09,683 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d63a80d2bfe8ff8bb62e6b5083cee589f2cb0f37dc67867654ab7601d82af23e [2025-03-04 02:28:09,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:28:09,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:28:09,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:28:09,896 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:28:09,896 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:28:09,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-context1.wvr.c [2025-03-04 02:28:11,072 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ee8d441/290ab034146e48caafc90d7de58aa0e6/FLAG5ce1c8e3a [2025-03-04 02:28:11,317 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:28:11,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-context1.wvr.c [2025-03-04 02:28:11,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ee8d441/290ab034146e48caafc90d7de58aa0e6/FLAG5ce1c8e3a [2025-03-04 02:28:11,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ee8d441/290ab034146e48caafc90d7de58aa0e6 [2025-03-04 02:28:11,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:28:11,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:28:11,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:28:11,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:28:11,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:28:11,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:28:11" (1/1) ... [2025-03-04 02:28:11,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@266d2fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:11, skipping insertion in model container [2025-03-04 02:28:11,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:28:11" (1/1) ... [2025-03-04 02:28:11,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:28:11,818 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-context1.wvr.c[2459,2472] [2025-03-04 02:28:11,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:28:11,837 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:28:11,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-context1.wvr.c[2459,2472] [2025-03-04 02:28:11,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:28:11,869 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:28:11,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:11 WrapperNode [2025-03-04 02:28:11,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:28:11,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:28:11,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:28:11,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:28:11,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:11" (1/1) ... [2025-03-04 02:28:11,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:11" (1/1) ... [2025-03-04 02:28:11,896 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 122 [2025-03-04 02:28:11,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:28:11,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:28:11,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:28:11,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:28:11,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:11" (1/1) ... [2025-03-04 02:28:11,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:11" (1/1) ... [2025-03-04 02:28:11,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:11" (1/1) ... [2025-03-04 02:28:11,920 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 02:28:11,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:11" (1/1) ... [2025-03-04 02:28:11,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:11" (1/1) ... [2025-03-04 02:28:11,925 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:11" (1/1) ... [2025-03-04 02:28:11,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:11" (1/1) ... [2025-03-04 02:28:11,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:11" (1/1) ... [2025-03-04 02:28:11,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:11" (1/1) ... [2025-03-04 02:28:11,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:28:11,929 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:28:11,929 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:28:11,929 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:28:11,930 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:11" (1/1) ... [2025-03-04 02:28:11,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:28:11,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:11,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:28:11,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:28:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:28:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:28:11,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:28:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:28:11,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:28:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:28:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:28:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:28:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:28:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:28:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:28:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:28:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:28:11,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:28:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:28:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:28:11,975 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:28:12,048 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:28:12,049 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:28:12,241 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:28:12,242 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:28:12,373 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:28:12,373 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:28:12,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:28:12 BoogieIcfgContainer [2025-03-04 02:28:12,374 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:28:12,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:28:12,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:28:12,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:28:12,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:28:11" (1/3) ... [2025-03-04 02:28:12,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1902a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:28:12, skipping insertion in model container [2025-03-04 02:28:12,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:11" (2/3) ... [2025-03-04 02:28:12,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1902a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:28:12, skipping insertion in model container [2025-03-04 02:28:12,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:28:12" (3/3) ... [2025-03-04 02:28:12,382 INFO L128 eAbstractionObserver]: Analyzing ICFG test-context1.wvr.c [2025-03-04 02:28:12,393 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:28:12,394 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-context1.wvr.c that has 3 procedures, 24 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-04 02:28:12,394 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:28:12,431 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:28:12,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 70 flow [2025-03-04 02:28:12,486 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2025-03-04 02:28:12,487 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:28:12,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 5/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-03-04 02:28:12,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 28 transitions, 70 flow [2025-03-04 02:28:12,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 25 transitions, 62 flow [2025-03-04 02:28:12,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:28:12,511 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;@54409adb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:28:12,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:28:12,519 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:28:12,520 INFO L124 PetriNetUnfolderBase]: 5/24 cut-off events. [2025-03-04 02:28:12,520 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:28:12,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:12,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:12,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:12,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1452471426, now seen corresponding path program 1 times [2025-03-04 02:28:12,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:12,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734686784] [2025-03-04 02:28:12,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:12,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:12,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:28:12,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:12,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:12,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:12,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:12,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:12,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734686784] [2025-03-04 02:28:12,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734686784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:12,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:12,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:28:12,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316500103] [2025-03-04 02:28:12,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:12,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:28:12,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:12,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:28:12,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:28:12,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:28:12,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 62 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:12,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:12,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:28:12,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:12,811 INFO L124 PetriNetUnfolderBase]: 122/217 cut-off events. [2025-03-04 02:28:12,812 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 02:28:12,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 217 events. 122/217 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 711 event pairs, 94 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 405. Up to 214 conditions per place. [2025-03-04 02:28:12,816 INFO L140 encePairwiseOnDemand]: 26/28 looper letters, 20 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2025-03-04 02:28:12,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 23 transitions, 98 flow [2025-03-04 02:28:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:28:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 02:28:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2025-03-04 02:28:12,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-04 02:28:12,829 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 62 flow. Second operand 2 states and 32 transitions. [2025-03-04 02:28:12,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 23 transitions, 98 flow [2025-03-04 02:28:12,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 90 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:28:12,834 INFO L231 Difference]: Finished difference. Result has 24 places, 23 transitions, 50 flow [2025-03-04 02:28:12,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=50, PETRI_PLACES=24, PETRI_TRANSITIONS=23} [2025-03-04 02:28:12,839 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2025-03-04 02:28:12,840 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 23 transitions, 50 flow [2025-03-04 02:28:12,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:12,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:12,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:12,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:28:12,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:12,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:12,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2006393121, now seen corresponding path program 1 times [2025-03-04 02:28:12,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:12,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867485305] [2025-03-04 02:28:12,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:12,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:12,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:28:12,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:12,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:12,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:12,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:12,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867485305] [2025-03-04 02:28:12,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867485305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:12,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:12,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:28:12,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356753298] [2025-03-04 02:28:12,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:12,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:28:12,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:12,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:28:12,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:28:12,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:28:12,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 23 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:12,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:12,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:28:12,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:13,040 INFO L124 PetriNetUnfolderBase]: 203/353 cut-off events. [2025-03-04 02:28:13,040 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 02:28:13,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 353 events. 203/353 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1272 event pairs, 82 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 709. Up to 176 conditions per place. [2025-03-04 02:28:13,042 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 28 selfloop transitions, 2 changer transitions 3/36 dead transitions. [2025-03-04 02:28:13,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 36 transitions, 144 flow [2025-03-04 02:28:13,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:28:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:28:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-03-04 02:28:13,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 02:28:13,043 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 50 flow. Second operand 3 states and 49 transitions. [2025-03-04 02:28:13,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 36 transitions, 144 flow [2025-03-04 02:28:13,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 144 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:28:13,045 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 62 flow [2025-03-04 02:28:13,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2025-03-04 02:28:13,045 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2025-03-04 02:28:13,045 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 62 flow [2025-03-04 02:28:13,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:13,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:13,045 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:13,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:28:13,046 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:13,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:13,046 INFO L85 PathProgramCache]: Analyzing trace with hash -351831662, now seen corresponding path program 1 times [2025-03-04 02:28:13,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:13,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352779625] [2025-03-04 02:28:13,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:13,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:13,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:28:13,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:28:13,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:13,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:13,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:13,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352779625] [2025-03-04 02:28:13,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352779625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:13,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:13,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:28:13,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038487654] [2025-03-04 02:28:13,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:13,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:28:13,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:13,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:28:13,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:28:13,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:28:13,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:13,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:13,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:28:13,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:13,227 INFO L124 PetriNetUnfolderBase]: 251/446 cut-off events. [2025-03-04 02:28:13,227 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-04 02:28:13,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 446 events. 251/446 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1678 event pairs, 113 based on Foata normal form. 11/387 useless extension candidates. Maximal degree in co-relation 934. Up to 306 conditions per place. [2025-03-04 02:28:13,229 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 27 selfloop transitions, 2 changer transitions 6/38 dead transitions. [2025-03-04 02:28:13,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 38 transitions, 163 flow [2025-03-04 02:28:13,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:28:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:28:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-03-04 02:28:13,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-03-04 02:28:13,230 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 62 flow. Second operand 3 states and 50 transitions. [2025-03-04 02:28:13,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 38 transitions, 163 flow [2025-03-04 02:28:13,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:28:13,231 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 72 flow [2025-03-04 02:28:13,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2025-03-04 02:28:13,232 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2025-03-04 02:28:13,232 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 72 flow [2025-03-04 02:28:13,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:13,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:13,232 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:13,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:28:13,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:13,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:13,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1184158308, now seen corresponding path program 1 times [2025-03-04 02:28:13,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:13,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387215191] [2025-03-04 02:28:13,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:13,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:13,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:28:13,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:28:13,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:13,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:13,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:13,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:13,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387215191] [2025-03-04 02:28:13,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387215191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:13,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:13,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:28:13,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098862254] [2025-03-04 02:28:13,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:13,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:28:13,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:13,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:28:13,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:28:13,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:28:13,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:13,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:13,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:28:13,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:13,564 INFO L124 PetriNetUnfolderBase]: 319/585 cut-off events. [2025-03-04 02:28:13,565 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-04 02:28:13,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 585 events. 319/585 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2405 event pairs, 285 based on Foata normal form. 12/503 useless extension candidates. Maximal degree in co-relation 1262. Up to 443 conditions per place. [2025-03-04 02:28:13,568 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 21 selfloop transitions, 2 changer transitions 15/41 dead transitions. [2025-03-04 02:28:13,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 184 flow [2025-03-04 02:28:13,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:28:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:28:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-03-04 02:28:13,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2025-03-04 02:28:13,571 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 72 flow. Second operand 4 states and 57 transitions. [2025-03-04 02:28:13,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 184 flow [2025-03-04 02:28:13,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:28:13,574 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 84 flow [2025-03-04 02:28:13,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2025-03-04 02:28:13,575 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2025-03-04 02:28:13,575 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 84 flow [2025-03-04 02:28:13,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:13,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:13,575 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:13,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:28:13,576 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:13,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:13,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1137062934, now seen corresponding path program 1 times [2025-03-04 02:28:13,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:13,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999250773] [2025-03-04 02:28:13,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:13,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:13,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:28:13,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:28:13,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:13,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:28:13,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:13,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999250773] [2025-03-04 02:28:13,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999250773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:13,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:13,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:28:13,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941287486] [2025-03-04 02:28:13,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:13,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:28:13,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:13,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:28:13,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:28:13,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:28:13,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 84 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:13,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:13,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:28:13,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:14,042 INFO L124 PetriNetUnfolderBase]: 331/583 cut-off events. [2025-03-04 02:28:14,042 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-03-04 02:28:14,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1289 conditions, 583 events. 331/583 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2176 event pairs, 68 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 1281. Up to 157 conditions per place. [2025-03-04 02:28:14,044 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 44 selfloop transitions, 5 changer transitions 12/64 dead transitions. [2025-03-04 02:28:14,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 64 transitions, 295 flow [2025-03-04 02:28:14,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:28:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:28:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2025-03-04 02:28:14,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-04 02:28:14,045 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 84 flow. Second operand 6 states and 91 transitions. [2025-03-04 02:28:14,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 64 transitions, 295 flow [2025-03-04 02:28:14,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 64 transitions, 289 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 02:28:14,050 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 98 flow [2025-03-04 02:28:14,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2025-03-04 02:28:14,051 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2025-03-04 02:28:14,051 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 98 flow [2025-03-04 02:28:14,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:14,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:14,051 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:14,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:28:14,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:14,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:14,052 INFO L85 PathProgramCache]: Analyzing trace with hash -72371257, now seen corresponding path program 2 times [2025-03-04 02:28:14,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:14,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182000192] [2025-03-04 02:28:14,052 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:14,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:14,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:28:14,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:28:14,077 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:14,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:28:14,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:14,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182000192] [2025-03-04 02:28:14,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182000192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:14,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:14,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:28:14,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249411862] [2025-03-04 02:28:14,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:14,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:28:14,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:14,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:28:14,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:28:14,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:28:14,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:14,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:14,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:28:14,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:14,255 INFO L124 PetriNetUnfolderBase]: 719/1265 cut-off events. [2025-03-04 02:28:14,255 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-03-04 02:28:14,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1265 events. 719/1265 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5603 event pairs, 280 based on Foata normal form. 22/1090 useless extension candidates. Maximal degree in co-relation 2837. Up to 462 conditions per place. [2025-03-04 02:28:14,260 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 50 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2025-03-04 02:28:14,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 312 flow [2025-03-04 02:28:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:28:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:28:14,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-03-04 02:28:14,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-03-04 02:28:14,261 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 98 flow. Second operand 4 states and 72 transitions. [2025-03-04 02:28:14,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 312 flow [2025-03-04 02:28:14,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 60 transitions, 298 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 02:28:14,265 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 152 flow [2025-03-04 02:28:14,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-03-04 02:28:14,266 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2025-03-04 02:28:14,266 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 152 flow [2025-03-04 02:28:14,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:14,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:14,267 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:14,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:28:14,267 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:14,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:14,268 INFO L85 PathProgramCache]: Analyzing trace with hash -570701833, now seen corresponding path program 3 times [2025-03-04 02:28:14,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:14,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058447949] [2025-03-04 02:28:14,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:14,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:14,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:28:14,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:28:14,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:14,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:14,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:14,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058447949] [2025-03-04 02:28:14,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058447949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:14,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505765782] [2025-03-04 02:28:14,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:14,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:14,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:14,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:14,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:28:14,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:28:14,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:28:14,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:14,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:14,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:28:14,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:14,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:14,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505765782] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:14,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:14,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 02:28:14,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120404557] [2025-03-04 02:28:14,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:14,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:28:14,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:14,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:28:14,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:28:14,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:28:14,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 152 flow. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:14,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:14,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:28:14,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:15,151 INFO L124 PetriNetUnfolderBase]: 1255/2228 cut-off events. [2025-03-04 02:28:15,151 INFO L125 PetriNetUnfolderBase]: For 1347/1347 co-relation queries the response was YES. [2025-03-04 02:28:15,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5331 conditions, 2228 events. 1255/2228 cut-off events. For 1347/1347 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 11610 event pairs, 404 based on Foata normal form. 33/1909 useless extension candidates. Maximal degree in co-relation 5321. Up to 1122 conditions per place. [2025-03-04 02:28:15,161 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 33 selfloop transitions, 4 changer transitions 65/105 dead transitions. [2025-03-04 02:28:15,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 105 transitions, 574 flow [2025-03-04 02:28:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:15,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2025-03-04 02:28:15,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-03-04 02:28:15,163 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 152 flow. Second operand 9 states and 138 transitions. [2025-03-04 02:28:15,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 105 transitions, 574 flow [2025-03-04 02:28:15,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 105 transitions, 564 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-03-04 02:28:15,170 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 180 flow [2025-03-04 02:28:15,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=180, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2025-03-04 02:28:15,171 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 22 predicate places. [2025-03-04 02:28:15,171 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 180 flow [2025-03-04 02:28:15,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:15,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:15,171 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:15,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:15,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:15,372 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:15,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:15,373 INFO L85 PathProgramCache]: Analyzing trace with hash 817461091, now seen corresponding path program 4 times [2025-03-04 02:28:15,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:15,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813160436] [2025-03-04 02:28:15,373 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:15,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:15,382 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:28:15,395 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:28:15,395 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:15,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:28:15,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:15,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813160436] [2025-03-04 02:28:15,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813160436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:15,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546806400] [2025-03-04 02:28:15,578 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:15,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:15,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:15,581 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:15,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:28:15,622 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:28:15,642 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:28:15,642 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:15,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:15,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 02:28:15,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:28:15,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:15,922 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:28:15,924 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 28 treesize of output 11 [2025-03-04 02:28:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:28:16,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546806400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:16,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:16,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 16 [2025-03-04 02:28:16,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348388001] [2025-03-04 02:28:16,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:16,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:28:16,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:16,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:28:16,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:28:16,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:28:16,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 180 flow. Second operand has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:16,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:16,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:28:16,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:16,789 INFO L124 PetriNetUnfolderBase]: 1998/3447 cut-off events. [2025-03-04 02:28:16,790 INFO L125 PetriNetUnfolderBase]: For 3501/3501 co-relation queries the response was YES. [2025-03-04 02:28:16,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8738 conditions, 3447 events. 1998/3447 cut-off events. For 3501/3501 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 18228 event pairs, 104 based on Foata normal form. 24/2935 useless extension candidates. Maximal degree in co-relation 8723. Up to 625 conditions per place. [2025-03-04 02:28:16,801 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 139 selfloop transitions, 37 changer transitions 90/269 dead transitions. [2025-03-04 02:28:16,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 269 transitions, 1452 flow [2025-03-04 02:28:16,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 02:28:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 02:28:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 381 transitions. [2025-03-04 02:28:16,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6185064935064936 [2025-03-04 02:28:16,805 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 180 flow. Second operand 22 states and 381 transitions. [2025-03-04 02:28:16,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 269 transitions, 1452 flow [2025-03-04 02:28:16,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 269 transitions, 1422 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-04 02:28:16,812 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 604 flow [2025-03-04 02:28:16,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=604, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2025-03-04 02:28:16,813 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 45 predicate places. [2025-03-04 02:28:16,813 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 604 flow [2025-03-04 02:28:16,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:16,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:16,813 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:16,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:17,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 02:28:17,014 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:17,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:17,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1021840888, now seen corresponding path program 5 times [2025-03-04 02:28:17,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:17,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532168661] [2025-03-04 02:28:17,015 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:17,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:17,023 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-03-04 02:28:17,035 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:28:17,035 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:28:17,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 02:28:17,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:17,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532168661] [2025-03-04 02:28:17,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532168661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:17,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105576875] [2025-03-04 02:28:17,173 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:17,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:17,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:17,175 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:17,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:28:17,213 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-03-04 02:28:17,235 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:28:17,236 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:28:17,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:17,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:28:17,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 02:28:17,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 02:28:17,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105576875] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:17,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:17,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-03-04 02:28:17,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665803040] [2025-03-04 02:28:17,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:17,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:28:17,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:17,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:28:17,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:28:17,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:28:17,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 604 flow. Second operand has 20 states, 20 states have (on average 8.25) internal successors, (165), 20 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:17,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:17,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:28:17,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:18,077 INFO L124 PetriNetUnfolderBase]: 2573/4505 cut-off events. [2025-03-04 02:28:18,077 INFO L125 PetriNetUnfolderBase]: For 7404/7404 co-relation queries the response was YES. [2025-03-04 02:28:18,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11890 conditions, 4505 events. 2573/4505 cut-off events. For 7404/7404 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 26609 event pairs, 1832 based on Foata normal form. 52/3848 useless extension candidates. Maximal degree in co-relation 11866. Up to 3442 conditions per place. [2025-03-04 02:28:18,095 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 59 selfloop transitions, 4 changer transitions 81/147 dead transitions. [2025-03-04 02:28:18,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 147 transitions, 1149 flow [2025-03-04 02:28:18,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:28:18,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:28:18,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2025-03-04 02:28:18,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-03-04 02:28:18,097 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 604 flow. Second operand 11 states and 161 transitions. [2025-03-04 02:28:18,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 147 transitions, 1149 flow [2025-03-04 02:28:18,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 147 transitions, 895 flow, removed 114 selfloop flow, removed 6 redundant places. [2025-03-04 02:28:18,114 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 416 flow [2025-03-04 02:28:18,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=416, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2025-03-04 02:28:18,115 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 56 predicate places. [2025-03-04 02:28:18,115 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 416 flow [2025-03-04 02:28:18,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.25) internal successors, (165), 20 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:18,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:18,115 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:18,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:28:18,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:18,316 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:18,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:18,316 INFO L85 PathProgramCache]: Analyzing trace with hash 972261912, now seen corresponding path program 6 times [2025-03-04 02:28:18,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:18,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940032765] [2025-03-04 02:28:18,316 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:18,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:18,328 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 3 equivalence classes. [2025-03-04 02:28:18,352 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:28:18,352 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:28:18,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:28:18,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:18,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940032765] [2025-03-04 02:28:18,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940032765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:18,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337841555] [2025-03-04 02:28:18,641 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:18,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:18,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:18,643 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:18,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:28:18,685 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 3 equivalence classes. [2025-03-04 02:28:18,712 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:28:18,712 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:28:18,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:18,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:18,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:28:18,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:18,845 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:28:18,846 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 28 treesize of output 11 [2025-03-04 02:28:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:28:18,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337841555] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:18,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:18,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2025-03-04 02:28:18,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575362825] [2025-03-04 02:28:18,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:18,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:28:18,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:18,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:28:18,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:28:18,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:28:18,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 66 transitions, 416 flow. Second operand has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 17 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:18,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:18,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:28:18,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:20,006 INFO L124 PetriNetUnfolderBase]: 3206/5541 cut-off events. [2025-03-04 02:28:20,007 INFO L125 PetriNetUnfolderBase]: For 3486/3486 co-relation queries the response was YES. [2025-03-04 02:28:20,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13193 conditions, 5541 events. 3206/5541 cut-off events. For 3486/3486 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 32106 event pairs, 510 based on Foata normal form. 3/4686 useless extension candidates. Maximal degree in co-relation 13164. Up to 1000 conditions per place. [2025-03-04 02:28:20,032 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 144 selfloop transitions, 60 changer transitions 90/297 dead transitions. [2025-03-04 02:28:20,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 297 transitions, 1649 flow [2025-03-04 02:28:20,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 02:28:20,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 02:28:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 375 transitions. [2025-03-04 02:28:20,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5822981366459627 [2025-03-04 02:28:20,035 INFO L175 Difference]: Start difference. First operand has 83 places, 66 transitions, 416 flow. Second operand 23 states and 375 transitions. [2025-03-04 02:28:20,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 297 transitions, 1649 flow [2025-03-04 02:28:20,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 297 transitions, 1593 flow, removed 25 selfloop flow, removed 9 redundant places. [2025-03-04 02:28:20,052 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 688 flow [2025-03-04 02:28:20,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=688, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2025-03-04 02:28:20,053 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 69 predicate places. [2025-03-04 02:28:20,054 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 688 flow [2025-03-04 02:28:20,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 17 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:20,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:20,054 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:20,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:28:20,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:20,255 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:20,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:20,258 INFO L85 PathProgramCache]: Analyzing trace with hash -9863523, now seen corresponding path program 7 times [2025-03-04 02:28:20,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:20,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357394992] [2025-03-04 02:28:20,258 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:28:20,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:20,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 02:28:20,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:28:20,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:20,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:20,352 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 02:28:20,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:20,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357394992] [2025-03-04 02:28:20,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357394992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:20,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026832849] [2025-03-04 02:28:20,353 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:28:20,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:20,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:20,355 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:20,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:28:20,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 02:28:20,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:28:20,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:20,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:20,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:28:20,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:20,478 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 02:28:20,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 02:28:20,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026832849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:20,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:20,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-04 02:28:20,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632191476] [2025-03-04 02:28:20,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:20,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:28:20,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:20,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:28:20,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:28:20,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:28:20,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 688 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:20,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:20,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:28:20,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:21,161 INFO L124 PetriNetUnfolderBase]: 5593/9636 cut-off events. [2025-03-04 02:28:21,161 INFO L125 PetriNetUnfolderBase]: For 8502/8502 co-relation queries the response was YES. [2025-03-04 02:28:21,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23745 conditions, 9636 events. 5593/9636 cut-off events. For 8502/8502 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 60283 event pairs, 1470 based on Foata normal form. 33/8175 useless extension candidates. Maximal degree in co-relation 23716. Up to 2498 conditions per place. [2025-03-04 02:28:21,203 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 104 selfloop transitions, 81 changer transitions 0/188 dead transitions. [2025-03-04 02:28:21,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 188 transitions, 1677 flow [2025-03-04 02:28:21,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:28:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:28:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-03-04 02:28:21,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-03-04 02:28:21,205 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 688 flow. Second operand 6 states and 114 transitions. [2025-03-04 02:28:21,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 188 transitions, 1677 flow [2025-03-04 02:28:21,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 188 transitions, 1610 flow, removed 28 selfloop flow, removed 4 redundant places. [2025-03-04 02:28:21,239 INFO L231 Difference]: Finished difference. Result has 101 places, 132 transitions, 1356 flow [2025-03-04 02:28:21,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1356, PETRI_PLACES=101, PETRI_TRANSITIONS=132} [2025-03-04 02:28:21,240 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 74 predicate places. [2025-03-04 02:28:21,240 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 132 transitions, 1356 flow [2025-03-04 02:28:21,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:21,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:21,240 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:21,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 02:28:21,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 02:28:21,441 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:21,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash -582976617, now seen corresponding path program 8 times [2025-03-04 02:28:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:21,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570465827] [2025-03-04 02:28:21,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:21,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:21,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 02:28:21,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 02:28:21,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:21,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 02:28:21,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:21,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570465827] [2025-03-04 02:28:21,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570465827] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:21,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982195632] [2025-03-04 02:28:21,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:21,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:21,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:21,675 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:21,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:28:21,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 02:28:21,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 02:28:21,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:21,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:21,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:21,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 02:28:21,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 02:28:22,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982195632] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:22,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:22,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2025-03-04 02:28:22,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647619938] [2025-03-04 02:28:22,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:22,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 02:28:22,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:22,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 02:28:22,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2025-03-04 02:28:22,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:28:22,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 132 transitions, 1356 flow. Second operand has 27 states, 27 states have (on average 8.25925925925926) internal successors, (223), 27 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:22,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:22,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:28:22,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:23,747 INFO L124 PetriNetUnfolderBase]: 11029/19216 cut-off events. [2025-03-04 02:28:23,747 INFO L125 PetriNetUnfolderBase]: For 29938/29938 co-relation queries the response was YES. [2025-03-04 02:28:23,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49586 conditions, 19216 events. 11029/19216 cut-off events. For 29938/29938 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 141331 event pairs, 3417 based on Foata normal form. 451/16621 useless extension candidates. Maximal degree in co-relation 49553. Up to 7523 conditions per place. [2025-03-04 02:28:23,887 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 108 selfloop transitions, 6 changer transitions 187/304 dead transitions. [2025-03-04 02:28:23,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 304 transitions, 3086 flow [2025-03-04 02:28:23,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:28:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:28:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 186 transitions. [2025-03-04 02:28:23,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.510989010989011 [2025-03-04 02:28:23,888 INFO L175 Difference]: Start difference. First operand has 101 places, 132 transitions, 1356 flow. Second operand 13 states and 186 transitions. [2025-03-04 02:28:23,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 304 transitions, 3086 flow [2025-03-04 02:28:24,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 304 transitions, 3064 flow, removed 11 selfloop flow, removed 0 redundant places. [2025-03-04 02:28:24,040 INFO L231 Difference]: Finished difference. Result has 117 places, 110 transitions, 1273 flow [2025-03-04 02:28:24,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1273, PETRI_PLACES=117, PETRI_TRANSITIONS=110} [2025-03-04 02:28:24,041 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 90 predicate places. [2025-03-04 02:28:24,043 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 110 transitions, 1273 flow [2025-03-04 02:28:24,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.25925925925926) internal successors, (223), 27 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:24,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:24,044 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:24,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:24,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:24,248 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:24,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:24,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2018253699, now seen corresponding path program 9 times [2025-03-04 02:28:24,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:24,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674196605] [2025-03-04 02:28:24,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:24,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:24,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-03-04 02:28:24,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 02:28:24,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 02:28:24,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:28:24,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:24,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674196605] [2025-03-04 02:28:24,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674196605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:24,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884693907] [2025-03-04 02:28:24,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:24,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:24,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:24,678 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:24,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:28:24,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-03-04 02:28:24,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 02:28:24,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 02:28:24,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:24,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 02:28:24,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:24,899 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 15 treesize of output 1 [2025-03-04 02:28:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:25,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:25,795 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 42 treesize of output 38 [2025-03-04 02:28:25,803 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:28:25,803 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 45 [2025-03-04 02:28:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:28:25,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884693907] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:25,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:25,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 12] total 34 [2025-03-04 02:28:25,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11400748] [2025-03-04 02:28:25,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:25,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 02:28:25,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:25,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 02:28:25,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=955, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 02:28:25,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:28:25,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 110 transitions, 1273 flow. Second operand has 35 states, 35 states have (on average 8.028571428571428) internal successors, (281), 35 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:25,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:25,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:28:25,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:29,693 INFO L124 PetriNetUnfolderBase]: 18958/32476 cut-off events. [2025-03-04 02:28:29,693 INFO L125 PetriNetUnfolderBase]: For 78825/78825 co-relation queries the response was YES. [2025-03-04 02:28:29,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91631 conditions, 32476 events. 18958/32476 cut-off events. For 78825/78825 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 229908 event pairs, 3800 based on Foata normal form. 49/27482 useless extension candidates. Maximal degree in co-relation 91593. Up to 5975 conditions per place. [2025-03-04 02:28:30,000 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 343 selfloop transitions, 246 changer transitions 153/745 dead transitions. [2025-03-04 02:28:30,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 745 transitions, 7568 flow [2025-03-04 02:28:30,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 02:28:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-04 02:28:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 598 transitions. [2025-03-04 02:28:30,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5932539682539683 [2025-03-04 02:28:30,002 INFO L175 Difference]: Start difference. First operand has 117 places, 110 transitions, 1273 flow. Second operand 36 states and 598 transitions. [2025-03-04 02:28:30,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 745 transitions, 7568 flow [2025-03-04 02:28:30,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 745 transitions, 5986 flow, removed 483 selfloop flow, removed 19 redundant places. [2025-03-04 02:28:30,420 INFO L231 Difference]: Finished difference. Result has 134 places, 327 transitions, 4214 flow [2025-03-04 02:28:30,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=4214, PETRI_PLACES=134, PETRI_TRANSITIONS=327} [2025-03-04 02:28:30,421 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 107 predicate places. [2025-03-04 02:28:30,421 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 327 transitions, 4214 flow [2025-03-04 02:28:30,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.028571428571428) internal successors, (281), 35 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:30,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:30,422 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:30,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 02:28:30,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:30,622 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:30,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:30,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1050003554, now seen corresponding path program 10 times [2025-03-04 02:28:30,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:30,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269118712] [2025-03-04 02:28:30,623 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:30,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:30,629 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-04 02:28:30,636 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 02:28:30,636 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:30,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 02:28:31,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:31,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269118712] [2025-03-04 02:28:31,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269118712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:31,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494050504] [2025-03-04 02:28:31,033 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:31,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:31,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:31,035 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:31,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:28:31,084 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-04 02:28:31,114 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 02:28:31,114 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:31,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:31,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 02:28:31,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 02:28:31,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:31,294 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:28:31,295 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 28 treesize of output 11 [2025-03-04 02:28:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 02:28:31,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494050504] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:31,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:31,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2025-03-04 02:28:31,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516540197] [2025-03-04 02:28:31,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:31,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:28:31,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:31,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:28:31,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:28:31,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:28:31,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 327 transitions, 4214 flow. Second operand has 23 states, 23 states have (on average 8.782608695652174) internal successors, (202), 23 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:31,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:31,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:28:31,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:42,910 INFO L124 PetriNetUnfolderBase]: 61300/104540 cut-off events. [2025-03-04 02:28:42,911 INFO L125 PetriNetUnfolderBase]: For 320316/320316 co-relation queries the response was YES. [2025-03-04 02:28:43,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307319 conditions, 104540 events. 61300/104540 cut-off events. For 320316/320316 co-relation queries the response was YES. Maximal size of possible extension queue 1487. Compared 876449 event pairs, 5401 based on Foata normal form. 106/88465 useless extension candidates. Maximal degree in co-relation 307274. Up to 19225 conditions per place. [2025-03-04 02:28:44,106 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 443 selfloop transitions, 903 changer transitions 156/1505 dead transitions. [2025-03-04 02:28:44,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 1505 transitions, 18375 flow [2025-03-04 02:28:44,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 02:28:44,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-03-04 02:28:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 916 transitions. [2025-03-04 02:28:44,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6815476190476191 [2025-03-04 02:28:44,110 INFO L175 Difference]: Start difference. First operand has 134 places, 327 transitions, 4214 flow. Second operand 48 states and 916 transitions. [2025-03-04 02:28:44,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 1505 transitions, 18375 flow [2025-03-04 02:28:46,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 1505 transitions, 17374 flow, removed 487 selfloop flow, removed 8 redundant places. [2025-03-04 02:28:46,374 INFO L231 Difference]: Finished difference. Result has 209 places, 977 transitions, 16340 flow [2025-03-04 02:28:46,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3975, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=301, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=16340, PETRI_PLACES=209, PETRI_TRANSITIONS=977} [2025-03-04 02:28:46,375 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 182 predicate places. [2025-03-04 02:28:46,375 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 977 transitions, 16340 flow [2025-03-04 02:28:46,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.782608695652174) internal successors, (202), 23 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:46,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:46,375 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:46,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:46,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 02:28:46,576 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:46,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:46,576 INFO L85 PathProgramCache]: Analyzing trace with hash -989945447, now seen corresponding path program 11 times [2025-03-04 02:28:46,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:46,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204747707] [2025-03-04 02:28:46,576 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:46,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:46,583 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 6 equivalence classes. [2025-03-04 02:28:46,593 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 02:28:46,593 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-04 02:28:46,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 40 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 02:28:46,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:46,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204747707] [2025-03-04 02:28:46,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204747707] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:46,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097374763] [2025-03-04 02:28:46,774 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:46,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:46,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:46,776 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:46,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:28:46,826 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 6 equivalence classes. [2025-03-04 02:28:46,869 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 02:28:46,869 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-04 02:28:46,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:46,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 02:28:46,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 40 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 02:28:47,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 38 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 02:28:47,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097374763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:47,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:47,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2025-03-04 02:28:47,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28230836] [2025-03-04 02:28:47,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:47,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-04 02:28:47,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:47,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-04 02:28:47,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1245, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 02:28:47,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:28:47,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 977 transitions, 16340 flow. Second operand has 41 states, 41 states have (on average 7.804878048780488) internal successors, (320), 41 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-03-04 02:28:47,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:47,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:28:47,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand