./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-misc-3.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 b2ed7b18db6948b1f53058568aeeb46b9da6de135bdadf46ddc91e86240dfa66 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:32:09,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:32:09,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:32:09,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:32:09,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:32:09,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:32:09,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:32:09,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:32:09,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:32:09,353 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:32:09,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:32:09,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:32:09,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:32:09,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:32:09,353 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:32:09,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:32:09,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:32:09,353 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:32:09,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:32:09,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:32:09,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:32:09,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:32:09,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:32:09,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:32:09,356 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:32:09,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:32:09,356 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:32:09,356 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:32:09,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:32:09,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:32:09,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:32:09,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:32:09,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:32:09,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:32:09,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:32:09,357 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:32:09,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:32:09,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:32:09,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:32:09,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:32:09,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:32:09,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:32:09,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:32:09,358 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 -> b2ed7b18db6948b1f53058568aeeb46b9da6de135bdadf46ddc91e86240dfa66 [2025-03-08 17:32:09,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:32:09,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:32:09,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:32:09,622 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:32:09,622 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:32:09,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-3.wvr.c [2025-03-08 17:32:10,764 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b899f319c/ace45e895f734bb5b598fc0d55b82fa2/FLAGc88adea81 [2025-03-08 17:32:10,996 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:32:10,997 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3.wvr.c [2025-03-08 17:32:11,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b899f319c/ace45e895f734bb5b598fc0d55b82fa2/FLAGc88adea81 [2025-03-08 17:32:11,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b899f319c/ace45e895f734bb5b598fc0d55b82fa2 [2025-03-08 17:32:11,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:32:11,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:32:11,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:32:11,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:32:11,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:32:11,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:11" (1/1) ... [2025-03-08 17:32:11,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282bd43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:11, skipping insertion in model container [2025-03-08 17:32:11,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:11" (1/1) ... [2025-03-08 17:32:11,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:32:11,473 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/parallel-misc-3.wvr.c[2092,2105] [2025-03-08 17:32:11,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:32:11,486 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:32:11,497 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/parallel-misc-3.wvr.c[2092,2105] [2025-03-08 17:32:11,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:32:11,507 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:32:11,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:11 WrapperNode [2025-03-08 17:32:11,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:32:11,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:32:11,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:32:11,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:32:11,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:11" (1/1) ... [2025-03-08 17:32:11,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:11" (1/1) ... [2025-03-08 17:32:11,530 INFO L138 Inliner]: procedures = 18, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2025-03-08 17:32:11,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:32:11,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:32:11,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:32:11,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:32:11,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:11" (1/1) ... [2025-03-08 17:32:11,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:11" (1/1) ... [2025-03-08 17:32:11,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:11" (1/1) ... [2025-03-08 17:32:11,543 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 17:32:11,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:11" (1/1) ... [2025-03-08 17:32:11,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:11" (1/1) ... [2025-03-08 17:32:11,545 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:11" (1/1) ... [2025-03-08 17:32:11,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:11" (1/1) ... [2025-03-08 17:32:11,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:11" (1/1) ... [2025-03-08 17:32:11,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:11" (1/1) ... [2025-03-08 17:32:11,547 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:32:11,548 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:32:11,548 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:32:11,548 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:32:11,549 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:11" (1/1) ... [2025-03-08 17:32:11,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:32:11,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:11,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:32:11,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:32:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:32:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:32:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:32:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:32:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:32:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:32:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:32:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:32:11,585 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:32:11,637 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:32:11,638 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:32:11,766 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:32:11,767 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:32:11,855 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:32:11,855 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:32:11,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:11 BoogieIcfgContainer [2025-03-08 17:32:11,855 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:32:11,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:32:11,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:32:11,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:32:11,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:32:11" (1/3) ... [2025-03-08 17:32:11,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6783a325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:32:11, skipping insertion in model container [2025-03-08 17:32:11,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:11" (2/3) ... [2025-03-08 17:32:11,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6783a325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:32:11, skipping insertion in model container [2025-03-08 17:32:11,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:11" (3/3) ... [2025-03-08 17:32:11,868 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-3.wvr.c [2025-03-08 17:32:11,877 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:32:11,878 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-3.wvr.c that has 3 procedures, 27 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 17:32:11,879 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:32:11,907 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 17:32:11,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 74 flow [2025-03-08 17:32:11,952 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-08 17:32:11,955 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 17:32:11,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 4/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-08 17:32:11,956 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 30 transitions, 74 flow [2025-03-08 17:32:11,960 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 66 flow [2025-03-08 17:32:11,969 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:32:11,976 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;@4681509d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:32:11,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-08 17:32:11,984 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:32:11,984 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-03-08 17:32:11,984 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 17:32:11,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:11,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:11,985 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-08 17:32:11,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:11,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2063413131, now seen corresponding path program 1 times [2025-03-08 17:32:11,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:11,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644449903] [2025-03-08 17:32:11,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:11,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:12,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 17:32:12,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 17:32:12,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:12,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:12,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:12,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:12,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644449903] [2025-03-08 17:32:12,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644449903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:12,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:12,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:32:12,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835784963] [2025-03-08 17:32:12,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:12,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:32:12,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:12,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:32:12,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:32:12,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2025-03-08 17:32:12,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:12,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:12,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2025-03-08 17:32:12,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:12,303 INFO L124 PetriNetUnfolderBase]: 146/284 cut-off events. [2025-03-08 17:32:12,303 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-08 17:32:12,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 284 events. 146/284 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1133 event pairs, 12 based on Foata normal form. 1/252 useless extension candidates. Maximal degree in co-relation 458. Up to 185 conditions per place. [2025-03-08 17:32:12,310 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 21 selfloop transitions, 5 changer transitions 1/38 dead transitions. [2025-03-08 17:32:12,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 151 flow [2025-03-08 17:32:12,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:32:12,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:32:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-03-08 17:32:12,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7444444444444445 [2025-03-08 17:32:12,319 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 66 flow. Second operand 3 states and 67 transitions. [2025-03-08 17:32:12,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 151 flow [2025-03-08 17:32:12,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 137 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 17:32:12,324 INFO L231 Difference]: Finished difference. Result has 29 places, 31 transitions, 91 flow [2025-03-08 17:32:12,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=31} [2025-03-08 17:32:12,328 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2025-03-08 17:32:12,329 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 31 transitions, 91 flow [2025-03-08 17:32:12,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:12,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:12,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:12,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:32:12,329 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-08 17:32:12,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:12,330 INFO L85 PathProgramCache]: Analyzing trace with hash 407228783, now seen corresponding path program 1 times [2025-03-08 17:32:12,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:12,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190352515] [2025-03-08 17:32:12,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:12,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:12,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 17:32:12,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 17:32:12,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:12,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:12,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:12,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190352515] [2025-03-08 17:32:12,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190352515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:12,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:12,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:32:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765604835] [2025-03-08 17:32:12,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:12,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:32:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:12,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:32:12,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:32:12,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2025-03-08 17:32:12,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 31 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:12,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:12,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2025-03-08 17:32:12,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:12,560 INFO L124 PetriNetUnfolderBase]: 152/299 cut-off events. [2025-03-08 17:32:12,561 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-03-08 17:32:12,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 299 events. 152/299 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1231 event pairs, 28 based on Foata normal form. 11/278 useless extension candidates. Maximal degree in co-relation 440. Up to 143 conditions per place. [2025-03-08 17:32:12,564 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 28 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2025-03-08 17:32:12,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 41 transitions, 180 flow [2025-03-08 17:32:12,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:32:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:32:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-03-08 17:32:12,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-03-08 17:32:12,565 INFO L175 Difference]: Start difference. First operand has 29 places, 31 transitions, 91 flow. Second operand 3 states and 66 transitions. [2025-03-08 17:32:12,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 41 transitions, 180 flow [2025-03-08 17:32:12,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 41 transitions, 173 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-08 17:32:12,567 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 96 flow [2025-03-08 17:32:12,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2025-03-08 17:32:12,568 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2025-03-08 17:32:12,568 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 96 flow [2025-03-08 17:32:12,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:12,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:12,568 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-08 17:32:12,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:32:12,569 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-08 17:32:12,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:12,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1441259863, now seen corresponding path program 1 times [2025-03-08 17:32:12,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:12,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174502703] [2025-03-08 17:32:12,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:12,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:12,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 17:32:12,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 17:32:12,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:12,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:12,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:12,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174502703] [2025-03-08 17:32:12,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174502703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:12,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:12,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:32:12,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8826742] [2025-03-08 17:32:12,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:12,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:32:12,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:12,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:32:12,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:32:12,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2025-03-08 17:32:12,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:12,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:12,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2025-03-08 17:32:12,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:12,744 INFO L124 PetriNetUnfolderBase]: 157/328 cut-off events. [2025-03-08 17:32:12,744 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-03-08 17:32:12,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 328 events. 157/328 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1546 event pairs, 34 based on Foata normal form. 15/292 useless extension candidates. Maximal degree in co-relation 425. Up to 144 conditions per place. [2025-03-08 17:32:12,747 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 29 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-03-08 17:32:12,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 42 transitions, 194 flow [2025-03-08 17:32:12,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:32:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:32:12,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-03-08 17:32:12,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2025-03-08 17:32:12,748 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 96 flow. Second operand 3 states and 65 transitions. [2025-03-08 17:32:12,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 42 transitions, 194 flow [2025-03-08 17:32:12,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:32:12,750 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 106 flow [2025-03-08 17:32:12,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=33, PETRI_TRANSITIONS=33} [2025-03-08 17:32:12,750 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2025-03-08 17:32:12,751 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 106 flow [2025-03-08 17:32:12,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:12,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:12,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:12,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:32:12,751 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-08 17:32:12,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:12,752 INFO L85 PathProgramCache]: Analyzing trace with hash 892490369, now seen corresponding path program 1 times [2025-03-08 17:32:12,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:12,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398237384] [2025-03-08 17:32:12,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:12,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:12,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 17:32:12,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 17:32:12,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:12,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:12,976 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-08 17:32:12,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:12,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398237384] [2025-03-08 17:32:12,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398237384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:12,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:12,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:32:12,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189778469] [2025-03-08 17:32:12,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:12,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:32:12,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:12,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:32:12,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:32:12,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-08 17:32:12,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:12,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:12,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-08 17:32:12,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:13,094 INFO L124 PetriNetUnfolderBase]: 326/601 cut-off events. [2025-03-08 17:32:13,095 INFO L125 PetriNetUnfolderBase]: For 214/238 co-relation queries the response was YES. [2025-03-08 17:32:13,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1467 conditions, 601 events. 326/601 cut-off events. For 214/238 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2579 event pairs, 56 based on Foata normal form. 12/567 useless extension candidates. Maximal degree in co-relation 597. Up to 225 conditions per place. [2025-03-08 17:32:13,101 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 41 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2025-03-08 17:32:13,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 55 transitions, 272 flow [2025-03-08 17:32:13,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:32:13,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:32:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-03-08 17:32:13,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-03-08 17:32:13,103 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 106 flow. Second operand 4 states and 85 transitions. [2025-03-08 17:32:13,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 55 transitions, 272 flow [2025-03-08 17:32:13,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:32:13,106 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 136 flow [2025-03-08 17:32:13,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=4, PETRI_FLOW=136, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-03-08 17:32:13,107 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2025-03-08 17:32:13,108 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 136 flow [2025-03-08 17:32:13,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:13,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:13,108 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, 1, 1] [2025-03-08 17:32:13,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:32:13,109 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-08 17:32:13,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:13,109 INFO L85 PathProgramCache]: Analyzing trace with hash 757206572, now seen corresponding path program 1 times [2025-03-08 17:32:13,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:13,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875603938] [2025-03-08 17:32:13,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:13,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:13,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 17:32:13,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 17:32:13,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:13,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:13,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:32:13,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:13,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875603938] [2025-03-08 17:32:13,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875603938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:13,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:13,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:32:13,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556188357] [2025-03-08 17:32:13,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:13,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:32:13,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:13,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:32:13,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:32:13,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-08 17:32:13,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:13,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:13,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-08 17:32:13,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:13,396 INFO L124 PetriNetUnfolderBase]: 450/786 cut-off events. [2025-03-08 17:32:13,396 INFO L125 PetriNetUnfolderBase]: For 814/864 co-relation queries the response was YES. [2025-03-08 17:32:13,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2225 conditions, 786 events. 450/786 cut-off events. For 814/864 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3963 event pairs, 122 based on Foata normal form. 44/768 useless extension candidates. Maximal degree in co-relation 1193. Up to 286 conditions per place. [2025-03-08 17:32:13,400 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 44 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2025-03-08 17:32:13,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 348 flow [2025-03-08 17:32:13,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:32:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:32:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-03-08 17:32:13,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6916666666666667 [2025-03-08 17:32:13,402 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 136 flow. Second operand 4 states and 83 transitions. [2025-03-08 17:32:13,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 59 transitions, 348 flow [2025-03-08 17:32:13,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 342 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-08 17:32:13,404 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 166 flow [2025-03-08 17:32:13,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-03-08 17:32:13,404 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2025-03-08 17:32:13,404 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 166 flow [2025-03-08 17:32:13,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:13,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:13,405 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:13,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:32:13,405 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-08 17:32:13,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:13,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1201485798, now seen corresponding path program 1 times [2025-03-08 17:32:13,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:13,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577675808] [2025-03-08 17:32:13,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:13,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:13,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 17:32:13,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:32:13,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:13,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:32:13,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:13,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577675808] [2025-03-08 17:32:13,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577675808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:13,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762610371] [2025-03-08 17:32:13,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:13,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:13,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:13,541 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:32:13,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 17:32:13,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 17:32:13,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:32:13,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:13,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:13,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 17:32:13,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:32:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:32:13,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:32:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:32:13,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762610371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:32:13,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:32:13,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-03-08 17:32:13,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141128673] [2025-03-08 17:32:13,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:32:13,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:32:13,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:13,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:32:13,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:32:13,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2025-03-08 17:32:13,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:13,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:13,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2025-03-08 17:32:13,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:13,978 INFO L124 PetriNetUnfolderBase]: 956/1991 cut-off events. [2025-03-08 17:32:13,979 INFO L125 PetriNetUnfolderBase]: For 2350/2455 co-relation queries the response was YES. [2025-03-08 17:32:13,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5758 conditions, 1991 events. 956/1991 cut-off events. For 2350/2455 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 11872 event pairs, 145 based on Foata normal form. 40/1994 useless extension candidates. Maximal degree in co-relation 1528. Up to 658 conditions per place. [2025-03-08 17:32:13,989 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 65 selfloop transitions, 15 changer transitions 1/94 dead transitions. [2025-03-08 17:32:13,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 94 transitions, 607 flow [2025-03-08 17:32:13,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:32:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:32:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-03-08 17:32:13,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.82 [2025-03-08 17:32:13,991 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 166 flow. Second operand 5 states and 123 transitions. [2025-03-08 17:32:13,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 94 transitions, 607 flow [2025-03-08 17:32:13,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 94 transitions, 599 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-08 17:32:13,994 INFO L231 Difference]: Finished difference. Result has 47 places, 49 transitions, 261 flow [2025-03-08 17:32:13,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=47, PETRI_TRANSITIONS=49} [2025-03-08 17:32:13,995 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2025-03-08 17:32:13,995 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 261 flow [2025-03-08 17:32:13,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:13,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:13,995 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:14,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 17:32:14,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 17:32:14,196 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-08 17:32:14,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:14,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1924232100, now seen corresponding path program 2 times [2025-03-08 17:32:14,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:14,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986854455] [2025-03-08 17:32:14,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:32:14,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:14,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 17:32:14,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:32:14,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:32:14,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:14,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:14,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986854455] [2025-03-08 17:32:14,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986854455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:14,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639661522] [2025-03-08 17:32:14,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:32:14,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:14,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:14,346 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:32:14,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 17:32:14,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 17:32:14,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:32:14,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:32:14,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:14,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 17:32:14,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:32:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:14,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:32:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:14,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639661522] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:32:14,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:32:14,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-08 17:32:14,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783889431] [2025-03-08 17:32:14,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:32:14,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:32:14,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:14,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:32:14,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:32:14,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2025-03-08 17:32:14,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:14,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:14,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2025-03-08 17:32:14,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:14,897 INFO L124 PetriNetUnfolderBase]: 1767/3697 cut-off events. [2025-03-08 17:32:14,898 INFO L125 PetriNetUnfolderBase]: For 5955/6184 co-relation queries the response was YES. [2025-03-08 17:32:14,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11653 conditions, 3697 events. 1767/3697 cut-off events. For 5955/6184 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 26159 event pairs, 171 based on Foata normal form. 96/3730 useless extension candidates. Maximal degree in co-relation 3829. Up to 1033 conditions per place. [2025-03-08 17:32:14,918 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 81 selfloop transitions, 31 changer transitions 1/126 dead transitions. [2025-03-08 17:32:14,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 126 transitions, 895 flow [2025-03-08 17:32:14,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:32:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:32:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2025-03-08 17:32:14,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-03-08 17:32:14,919 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 261 flow. Second operand 6 states and 150 transitions. [2025-03-08 17:32:14,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 126 transitions, 895 flow [2025-03-08 17:32:14,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 126 transitions, 839 flow, removed 28 selfloop flow, removed 0 redundant places. [2025-03-08 17:32:14,929 INFO L231 Difference]: Finished difference. Result has 53 places, 65 transitions, 388 flow [2025-03-08 17:32:14,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=388, PETRI_PLACES=53, PETRI_TRANSITIONS=65} [2025-03-08 17:32:14,929 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2025-03-08 17:32:14,930 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 65 transitions, 388 flow [2025-03-08 17:32:14,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:14,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:14,930 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, 1, 1, 1, 1] [2025-03-08 17:32:14,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 17:32:15,134 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,SelfDestructingSolverStorable6 [2025-03-08 17:32:15,136 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-08 17:32:15,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:15,137 INFO L85 PathProgramCache]: Analyzing trace with hash 507330928, now seen corresponding path program 3 times [2025-03-08 17:32:15,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:15,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354096926] [2025-03-08 17:32:15,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:32:15,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:15,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-03-08 17:32:15,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 35 statements. [2025-03-08 17:32:15,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:32:15,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:15,268 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-08 17:32:15,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:15,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354096926] [2025-03-08 17:32:15,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354096926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:15,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:15,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:32:15,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581041113] [2025-03-08 17:32:15,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:15,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:32:15,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:15,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:32:15,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:32:15,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2025-03-08 17:32:15,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 65 transitions, 388 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:15,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:15,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2025-03-08 17:32:15,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:15,732 INFO L124 PetriNetUnfolderBase]: 3495/6006 cut-off events. [2025-03-08 17:32:15,732 INFO L125 PetriNetUnfolderBase]: For 10648/11022 co-relation queries the response was YES. [2025-03-08 17:32:15,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20261 conditions, 6006 events. 3495/6006 cut-off events. For 10648/11022 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 40221 event pairs, 839 based on Foata normal form. 230/6163 useless extension candidates. Maximal degree in co-relation 7888. Up to 2503 conditions per place. [2025-03-08 17:32:15,767 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 97 selfloop transitions, 9 changer transitions 0/115 dead transitions. [2025-03-08 17:32:15,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 115 transitions, 908 flow [2025-03-08 17:32:15,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:32:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:32:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-03-08 17:32:15,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-03-08 17:32:15,768 INFO L175 Difference]: Start difference. First operand has 53 places, 65 transitions, 388 flow. Second operand 4 states and 76 transitions. [2025-03-08 17:32:15,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 115 transitions, 908 flow [2025-03-08 17:32:15,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 115 transitions, 859 flow, removed 17 selfloop flow, removed 1 redundant places. [2025-03-08 17:32:15,775 INFO L231 Difference]: Finished difference. Result has 57 places, 68 transitions, 409 flow [2025-03-08 17:32:15,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=409, PETRI_PLACES=57, PETRI_TRANSITIONS=68} [2025-03-08 17:32:15,776 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 27 predicate places. [2025-03-08 17:32:15,776 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 68 transitions, 409 flow [2025-03-08 17:32:15,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:15,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:15,776 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, 1, 1, 1, 1] [2025-03-08 17:32:15,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:32:15,776 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-08 17:32:15,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:15,777 INFO L85 PathProgramCache]: Analyzing trace with hash 187362882, now seen corresponding path program 4 times [2025-03-08 17:32:15,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:15,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396659530] [2025-03-08 17:32:15,777 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:32:15,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:15,786 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-03-08 17:32:15,802 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 17:32:15,802 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:32:15,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:15,911 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 17:32:15,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:15,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396659530] [2025-03-08 17:32:15,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396659530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:15,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:15,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:32:15,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882446558] [2025-03-08 17:32:15,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:15,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:32:15,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:15,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:32:15,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:32:15,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-08 17:32:15,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 68 transitions, 409 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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-08 17:32:15,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:15,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-08 17:32:15,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:16,307 INFO L124 PetriNetUnfolderBase]: 2176/4314 cut-off events. [2025-03-08 17:32:16,308 INFO L125 PetriNetUnfolderBase]: For 10354/10582 co-relation queries the response was YES. [2025-03-08 17:32:16,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14602 conditions, 4314 events. 2176/4314 cut-off events. For 10354/10582 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 30640 event pairs, 699 based on Foata normal form. 398/4584 useless extension candidates. Maximal degree in co-relation 6349. Up to 2025 conditions per place. [2025-03-08 17:32:16,329 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 73 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2025-03-08 17:32:16,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 89 transitions, 681 flow [2025-03-08 17:32:16,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:32:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:32:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-03-08 17:32:16,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2025-03-08 17:32:16,330 INFO L175 Difference]: Start difference. First operand has 57 places, 68 transitions, 409 flow. Second operand 4 states and 71 transitions. [2025-03-08 17:32:16,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 89 transitions, 681 flow [2025-03-08 17:32:16,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 673 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-08 17:32:16,337 INFO L231 Difference]: Finished difference. Result has 61 places, 66 transitions, 404 flow [2025-03-08 17:32:16,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=404, PETRI_PLACES=61, PETRI_TRANSITIONS=66} [2025-03-08 17:32:16,337 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 31 predicate places. [2025-03-08 17:32:16,337 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 404 flow [2025-03-08 17:32:16,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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-08 17:32:16,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:16,338 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, 1, 1, 1, 1] [2025-03-08 17:32:16,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:32:16,338 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-08 17:32:16,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:16,338 INFO L85 PathProgramCache]: Analyzing trace with hash 536734094, now seen corresponding path program 5 times [2025-03-08 17:32:16,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:16,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430327812] [2025-03-08 17:32:16,339 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:32:16,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:16,344 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 3 equivalence classes. [2025-03-08 17:32:16,356 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 17:32:16,356 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 17:32:16,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:16,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:32:16,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:16,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430327812] [2025-03-08 17:32:16,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430327812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:16,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876724008] [2025-03-08 17:32:16,743 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:32:16,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:16,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:16,746 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-08 17:32:16,747 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-08 17:32:16,779 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 3 equivalence classes. [2025-03-08 17:32:16,803 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 17:32:16,803 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 17:32:16,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:16,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 17:32:16,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:32:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 17:32:16,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:32:16,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876724008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:16,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:32:16,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-08 17:32:16,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814087013] [2025-03-08 17:32:16,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:16,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:32:16,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:16,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:32:16,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:32:16,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2025-03-08 17:32:16,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 404 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:16,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:16,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2025-03-08 17:32:16,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:17,294 INFO L124 PetriNetUnfolderBase]: 2796/5212 cut-off events. [2025-03-08 17:32:17,295 INFO L125 PetriNetUnfolderBase]: For 17158/17392 co-relation queries the response was YES. [2025-03-08 17:32:17,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19033 conditions, 5212 events. 2796/5212 cut-off events. For 17158/17392 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 33691 event pairs, 514 based on Foata normal form. 137/5344 useless extension candidates. Maximal degree in co-relation 7837. Up to 2396 conditions per place. [2025-03-08 17:32:17,322 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 97 selfloop transitions, 9 changer transitions 0/116 dead transitions. [2025-03-08 17:32:17,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 116 transitions, 946 flow [2025-03-08 17:32:17,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:32:17,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:32:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-03-08 17:32:17,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-08 17:32:17,324 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 404 flow. Second operand 4 states and 78 transitions. [2025-03-08 17:32:17,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 116 transitions, 946 flow [2025-03-08 17:32:17,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 116 transitions, 918 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-08 17:32:17,333 INFO L231 Difference]: Finished difference. Result has 62 places, 69 transitions, 438 flow [2025-03-08 17:32:17,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=438, PETRI_PLACES=62, PETRI_TRANSITIONS=69} [2025-03-08 17:32:17,334 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2025-03-08 17:32:17,334 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 69 transitions, 438 flow [2025-03-08 17:32:17,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:17,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:17,334 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, 1, 1, 1, 1] [2025-03-08 17:32:17,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 17:32:17,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:17,535 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-08 17:32:17,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:17,535 INFO L85 PathProgramCache]: Analyzing trace with hash 380186072, now seen corresponding path program 6 times [2025-03-08 17:32:17,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:17,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011540553] [2025-03-08 17:32:17,535 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:32:17,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:17,548 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 3 equivalence classes. [2025-03-08 17:32:17,560 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 17:32:17,562 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-08 17:32:17,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 17:32:17,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:17,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011540553] [2025-03-08 17:32:17,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011540553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:17,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:17,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:32:17,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345955072] [2025-03-08 17:32:17,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:17,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:32:17,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:17,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:32:17,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:32:17,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-08 17:32:17,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 69 transitions, 438 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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-08 17:32:17,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:17,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-08 17:32:17,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:17,773 INFO L124 PetriNetUnfolderBase]: 587/1269 cut-off events. [2025-03-08 17:32:17,774 INFO L125 PetriNetUnfolderBase]: For 5072/5136 co-relation queries the response was YES. [2025-03-08 17:32:17,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4866 conditions, 1269 events. 587/1269 cut-off events. For 5072/5136 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7180 event pairs, 193 based on Foata normal form. 103/1351 useless extension candidates. Maximal degree in co-relation 1961. Up to 557 conditions per place. [2025-03-08 17:32:17,778 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 0 selfloop transitions, 0 changer transitions 62/62 dead transitions. [2025-03-08 17:32:17,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 62 transitions, 514 flow [2025-03-08 17:32:17,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:32:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:32:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-03-08 17:32:17,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2025-03-08 17:32:17,779 INFO L175 Difference]: Start difference. First operand has 62 places, 69 transitions, 438 flow. Second operand 4 states and 71 transitions. [2025-03-08 17:32:17,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 62 transitions, 514 flow [2025-03-08 17:32:17,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 62 transitions, 490 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-08 17:32:17,784 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2025-03-08 17:32:17,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=60, PETRI_TRANSITIONS=0} [2025-03-08 17:32:17,785 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2025-03-08 17:32:17,785 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2025-03-08 17:32:17,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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-08 17:32:17,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-08 17:32:17,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-08 17:32:17,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-08 17:32:17,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:32:17,788 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2025-03-08 17:32:17,790 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 17:32:17,790 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 17:32:17,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:32:17 BasicIcfg [2025-03-08 17:32:17,794 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 17:32:17,795 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 17:32:17,795 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 17:32:17,795 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 17:32:17,795 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:11" (3/4) ... [2025-03-08 17:32:17,797 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 17:32:17,799 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 17:32:17,799 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-08 17:32:17,801 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2025-03-08 17:32:17,802 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-08 17:32:17,802 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-08 17:32:17,802 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 17:32:17,858 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 17:32:17,859 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 17:32:17,859 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 17:32:17,860 INFO L158 Benchmark]: Toolchain (without parser) took 6533.12ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 112.6MB in the beginning and 360.5MB in the end (delta: -248.0MB). Peak memory consumption was 211.7MB. Max. memory is 16.1GB. [2025-03-08 17:32:17,860 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:32:17,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.74ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 101.3MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:32:17,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.66ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.8MB in the end (delta: 975.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:32:17,862 INFO L158 Benchmark]: Boogie Preprocessor took 16.09ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.9MB in the end (delta: 939.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:32:17,862 INFO L158 Benchmark]: IcfgBuilder took 307.22ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 76.8MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 17:32:17,862 INFO L158 Benchmark]: TraceAbstraction took 5933.40ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 76.3MB in the beginning and 366.3MB in the end (delta: -290.0MB). Peak memory consumption was 169.7MB. Max. memory is 16.1GB. [2025-03-08 17:32:17,863 INFO L158 Benchmark]: Witness Printer took 64.26ms. Allocated memory is still 604.0MB. Free memory was 366.3MB in the beginning and 360.5MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:32:17,864 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.74ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 101.3MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.66ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.8MB in the end (delta: 975.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.09ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.9MB in the end (delta: 939.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 307.22ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 76.8MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5933.40ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 76.3MB in the beginning and 366.3MB in the end (delta: -290.0MB). Peak memory consumption was 169.7MB. Max. memory is 16.1GB. * Witness Printer took 64.26ms. Allocated memory is still 604.0MB. Free memory was 366.3MB in the beginning and 360.5MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 45 locations, 52 edges, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.9s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 753 IncrementalHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 4 mSDtfsCounter, 753 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=438occurred in iteration=10, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 399 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 445 ConstructedInterpolants, 0 QuantifiedInterpolants, 1465 SizeOfPredicates, 6 NumberOfNonLiveVariables, 388 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 42/88 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 17:32:17,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE