/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:50:26,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:50:26,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:50:26,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:50:26,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:50:26,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:50:26,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:50:26,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:50:26,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:50:26,152 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:50:26,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:50:26,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:50:26,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:50:26,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:50:26,153 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:50:26,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:50:26,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:50:26,154 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:50:26,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:50:26,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:50:26,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:50:26,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:50:26,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:50:26,154 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:50:26,154 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:50:26,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:50:26,154 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:50:26,154 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:50:26,154 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:50:26,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:50:26,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:50:26,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:50:26,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:50:26,155 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:50:26,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:50:26,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:50:26,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:50:26,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:50:26,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:50:26,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:50:26,155 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:50:26,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:50:26,155 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:50:26,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:50:26,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:50:26,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:50:26,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:50:26,155 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:50:26,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:50:26,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:50:26,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:50:26,393 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:50:26,394 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:50:26,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2025-04-13 19:50:27,677 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c94979c6/f59448e39fee4008806a6ef41b9d2153/FLAG3fbbce778 [2025-04-13 19:50:27,849 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:50:27,849 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2025-04-13 19:50:27,854 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c94979c6/f59448e39fee4008806a6ef41b9d2153/FLAG3fbbce778 [2025-04-13 19:50:28,727 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c94979c6/f59448e39fee4008806a6ef41b9d2153 [2025-04-13 19:50:28,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:50:28,730 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:50:28,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:50:28,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:50:28,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:50:28,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:50:28" (1/1) ... [2025-04-13 19:50:28,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d87d2e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:28, skipping insertion in model container [2025-04-13 19:50:28,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:50:28" (1/1) ... [2025-04-13 19:50:28,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:50:28,894 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c[2505,2518] [2025-04-13 19:50:28,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:50:28,905 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:50:28,935 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c[2505,2518] [2025-04-13 19:50:28,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:50:28,946 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:50:28,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:28 WrapperNode [2025-04-13 19:50:28,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:50:28,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:50:28,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:50:28,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:50:28,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:28" (1/1) ... [2025-04-13 19:50:28,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:28" (1/1) ... [2025-04-13 19:50:28,974 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2025-04-13 19:50:28,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:50:28,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:50:28,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:50:28,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:50:28,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:28" (1/1) ... [2025-04-13 19:50:28,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:28" (1/1) ... [2025-04-13 19:50:28,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:28" (1/1) ... [2025-04-13 19:50:29,000 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-04-13 19:50:29,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:28" (1/1) ... [2025-04-13 19:50:29,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:28" (1/1) ... [2025-04-13 19:50:29,007 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:28" (1/1) ... [2025-04-13 19:50:29,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:28" (1/1) ... [2025-04-13 19:50:29,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:28" (1/1) ... [2025-04-13 19:50:29,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:28" (1/1) ... [2025-04-13 19:50:29,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:28" (1/1) ... [2025-04-13 19:50:29,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:50:29,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:50:29,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:50:29,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:50:29,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:28" (1/1) ... [2025-04-13 19:50:29,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:50:29,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:50:29,044 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-04-13 19:50:29,047 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-04-13 19:50:29,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:50:29,067 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 19:50:29,067 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 19:50:29,067 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 19:50:29,068 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 19:50:29,068 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 19:50:29,068 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 19:50:29,068 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 19:50:29,068 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 19:50:29,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:50:29,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:50:29,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:50:29,069 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:50:29,128 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:50:29,129 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:50:29,279 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:50:29,279 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:50:29,279 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:50:29,394 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:50:29,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:50:29 BoogieIcfgContainer [2025-04-13 19:50:29,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:50:29,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:50:29,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:50:29,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:50:29,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:50:28" (1/3) ... [2025-04-13 19:50:29,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31652336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:50:29, skipping insertion in model container [2025-04-13 19:50:29,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:28" (2/3) ... [2025-04-13 19:50:29,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31652336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:50:29, skipping insertion in model container [2025-04-13 19:50:29,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:50:29" (3/3) ... [2025-04-13 19:50:29,403 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2025-04-13 19:50:29,411 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:50:29,412 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x6.wvr.c that has 5 procedures, 28 locations, 27 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 19:50:29,413 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:50:29,455 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 19:50:29,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 90 flow [2025-04-13 19:50:29,507 INFO L116 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-04-13 19:50:29,512 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 19:50:29,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 27 events. 4/27 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-13 19:50:29,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 31 transitions, 90 flow [2025-04-13 19:50:29,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 26 transitions, 76 flow [2025-04-13 19:50:29,526 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:50:29,536 INFO L340 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;@730142b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:50:29,536 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:50:29,550 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:50:29,550 INFO L116 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-04-13 19:50:29,550 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 19:50:29,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:29,550 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-04-13 19:50:29,551 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:50:29,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:29,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1445824442, now seen corresponding path program 1 times [2025-04-13 19:50:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:29,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276318703] [2025-04-13 19:50:29,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:29,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:29,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 19:50:29,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 19:50:29,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:29,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:29,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:29,940 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276318703] [2025-04-13 19:50:29,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276318703] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:50:29,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:50:29,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:50:29,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877994137] [2025-04-13 19:50:29,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:50:29,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:50:29,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:29,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:50:29,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:50:29,962 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:29,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-04-13 19:50:29,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:29,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:29,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:30,207 INFO L116 PetriNetUnfolderBase]: 1367/1731 cut-off events. [2025-04-13 19:50:30,207 INFO L117 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2025-04-13 19:50:30,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3610 conditions, 1731 events. 1367/1731 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5564 event pairs, 123 based on Foata normal form. 1/996 useless extension candidates. Maximal degree in co-relation 3091. Up to 1541 conditions per place. [2025-04-13 19:50:30,224 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 35 selfloop transitions, 5 changer transitions 1/45 dead transitions. [2025-04-13 19:50:30,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 217 flow [2025-04-13 19:50:30,226 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:50:30,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:50:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-13 19:50:30,234 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7096774193548387 [2025-04-13 19:50:30,235 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 76 flow. Second operand 3 states and 66 transitions. [2025-04-13 19:50:30,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 217 flow [2025-04-13 19:50:30,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 45 transitions, 187 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-13 19:50:30,241 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 93 flow [2025-04-13 19:50:30,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=30, PETRI_TRANSITIONS=30} [2025-04-13 19:50:30,245 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2025-04-13 19:50:30,245 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 93 flow [2025-04-13 19:50:30,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-04-13 19:50:30,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:30,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:30,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:50:30,246 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:50:30,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:30,246 INFO L85 PathProgramCache]: Analyzing trace with hash 866632592, now seen corresponding path program 1 times [2025-04-13 19:50:30,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:30,247 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928018530] [2025-04-13 19:50:30,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:30,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:30,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:50:30,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:30,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:30,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:30,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:30,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:30,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928018530] [2025-04-13 19:50:30,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928018530] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:50:30,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:50:30,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:50:30,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237369557] [2025-04-13 19:50:30,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:50:30,381 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:50:30,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:30,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:50:30,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:50:30,381 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:30,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 30 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-04-13 19:50:30,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:30,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:30,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:30,611 INFO L116 PetriNetUnfolderBase]: 1581/2024 cut-off events. [2025-04-13 19:50:30,611 INFO L117 PetriNetUnfolderBase]: For 580/580 co-relation queries the response was YES. [2025-04-13 19:50:30,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5030 conditions, 2024 events. 1581/2024 cut-off events. For 580/580 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7041 event pairs, 95 based on Foata normal form. 46/2064 useless extension candidates. Maximal degree in co-relation 1272. Up to 830 conditions per place. [2025-04-13 19:50:30,622 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 65 selfloop transitions, 10 changer transitions 0/79 dead transitions. [2025-04-13 19:50:30,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 79 transitions, 385 flow [2025-04-13 19:50:30,623 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-04-13 19:50:30,624 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7032258064516129 [2025-04-13 19:50:30,624 INFO L175 Difference]: Start difference. First operand has 30 places, 30 transitions, 93 flow. Second operand 5 states and 109 transitions. [2025-04-13 19:50:30,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 79 transitions, 385 flow [2025-04-13 19:50:30,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 79 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:50:30,626 INFO L231 Difference]: Finished difference. Result has 35 places, 37 transitions, 153 flow [2025-04-13 19:50:30,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=35, PETRI_TRANSITIONS=37} [2025-04-13 19:50:30,626 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2025-04-13 19:50:30,626 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 37 transitions, 153 flow [2025-04-13 19:50:30,628 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-04-13 19:50:30,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:30,628 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:30,628 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:50:30,628 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:50:30,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:30,629 INFO L85 PathProgramCache]: Analyzing trace with hash -382935725, now seen corresponding path program 1 times [2025-04-13 19:50:30,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:30,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277458943] [2025-04-13 19:50:30,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:30,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:30,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:50:30,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:30,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:30,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:30,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:30,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277458943] [2025-04-13 19:50:30,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277458943] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:50:30,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528964560] [2025-04-13 19:50:30,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:30,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:30,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:50:30,744 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-04-13 19:50:30,745 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-04-13 19:50:30,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:50:30,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:30,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:30,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:30,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:50:30,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:50:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:30,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:50:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:30,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528964560] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:50:30,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:50:30,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 19:50:30,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361477680] [2025-04-13 19:50:30,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:50:30,998 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:50:30,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:30,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:50:30,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:50:30,998 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:30,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-04-13 19:50:30,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:30,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:30,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:31,222 INFO L116 PetriNetUnfolderBase]: 1907/2530 cut-off events. [2025-04-13 19:50:31,222 INFO L117 PetriNetUnfolderBase]: For 3307/3307 co-relation queries the response was YES. [2025-04-13 19:50:31,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7845 conditions, 2530 events. 1907/2530 cut-off events. For 3307/3307 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 10062 event pairs, 284 based on Foata normal form. 64/2570 useless extension candidates. Maximal degree in co-relation 3596. Up to 1049 conditions per place. [2025-04-13 19:50:31,236 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 79 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2025-04-13 19:50:31,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 91 transitions, 569 flow [2025-04-13 19:50:31,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:31,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-04-13 19:50:31,241 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6645161290322581 [2025-04-13 19:50:31,241 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 153 flow. Second operand 5 states and 103 transitions. [2025-04-13 19:50:31,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 91 transitions, 569 flow [2025-04-13 19:50:31,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 91 transitions, 569 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:50:31,247 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 208 flow [2025-04-13 19:50:31,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2025-04-13 19:50:31,249 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-04-13 19:50:31,249 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 208 flow [2025-04-13 19:50:31,249 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-04-13 19:50:31,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:31,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:31,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 19:50:31,450 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:31,450 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:50:31,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:31,450 INFO L85 PathProgramCache]: Analyzing trace with hash 769864741, now seen corresponding path program 2 times [2025-04-13 19:50:31,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:31,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555016458] [2025-04-13 19:50:31,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:50:31,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:31,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:50:31,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:31,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:50:31,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:31,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:31,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555016458] [2025-04-13 19:50:31,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555016458] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:50:31,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:50:31,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:50:31,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352883767] [2025-04-13 19:50:31,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:50:31,532 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:50:31,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:31,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:50:31,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:50:31,534 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:31,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-04-13 19:50:31,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:31,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:31,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:31,721 INFO L116 PetriNetUnfolderBase]: 1720/2263 cut-off events. [2025-04-13 19:50:31,721 INFO L117 PetriNetUnfolderBase]: For 3992/3992 co-relation queries the response was YES. [2025-04-13 19:50:31,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8304 conditions, 2263 events. 1720/2263 cut-off events. For 3992/3992 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 8403 event pairs, 90 based on Foata normal form. 31/2270 useless extension candidates. Maximal degree in co-relation 4789. Up to 929 conditions per place. [2025-04-13 19:50:31,735 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 80 selfloop transitions, 11 changer transitions 0/95 dead transitions. [2025-04-13 19:50:31,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 95 transitions, 647 flow [2025-04-13 19:50:31,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:31,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2025-04-13 19:50:31,737 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6580645161290323 [2025-04-13 19:50:31,737 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 208 flow. Second operand 5 states and 102 transitions. [2025-04-13 19:50:31,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 95 transitions, 647 flow [2025-04-13 19:50:31,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 95 transitions, 647 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:50:31,745 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 269 flow [2025-04-13 19:50:31,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-04-13 19:50:31,746 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2025-04-13 19:50:31,746 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 269 flow [2025-04-13 19:50:31,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-04-13 19:50:31,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:31,746 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:31,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:50:31,746 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:50:31,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:31,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1390506906, now seen corresponding path program 1 times [2025-04-13 19:50:31,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:31,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48088935] [2025-04-13 19:50:31,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:31,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:31,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:50:31,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:31,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:31,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:31,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:31,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:31,839 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48088935] [2025-04-13 19:50:31,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48088935] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:50:31,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:50:31,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:50:31,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228964795] [2025-04-13 19:50:31,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:50:31,839 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:50:31,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:31,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:50:31,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:50:31,840 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:31,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-04-13 19:50:31,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:31,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:31,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:32,025 INFO L116 PetriNetUnfolderBase]: 1687/2230 cut-off events. [2025-04-13 19:50:32,025 INFO L117 PetriNetUnfolderBase]: For 4837/4837 co-relation queries the response was YES. [2025-04-13 19:50:32,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8824 conditions, 2230 events. 1687/2230 cut-off events. For 4837/4837 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8367 event pairs, 70 based on Foata normal form. 33/2239 useless extension candidates. Maximal degree in co-relation 4969. Up to 1030 conditions per place. [2025-04-13 19:50:32,037 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 78 selfloop transitions, 8 changer transitions 2/92 dead transitions. [2025-04-13 19:50:32,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 92 transitions, 656 flow [2025-04-13 19:50:32,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2025-04-13 19:50:32,039 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2025-04-13 19:50:32,039 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 269 flow. Second operand 5 states and 100 transitions. [2025-04-13 19:50:32,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 92 transitions, 656 flow [2025-04-13 19:50:32,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 92 transitions, 645 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 19:50:32,045 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 272 flow [2025-04-13 19:50:32,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2025-04-13 19:50:32,046 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2025-04-13 19:50:32,046 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 272 flow [2025-04-13 19:50:32,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-04-13 19:50:32,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:32,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:32,047 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:50:32,048 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:50:32,048 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:32,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1090435074, now seen corresponding path program 2 times [2025-04-13 19:50:32,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:32,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354121519] [2025-04-13 19:50:32,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:50:32,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:32,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:50:32,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:32,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:50:32,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:32,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:32,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354121519] [2025-04-13 19:50:32,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354121519] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:50:32,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840541624] [2025-04-13 19:50:32,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:50:32,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:32,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:50:32,138 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-04-13 19:50:32,139 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-04-13 19:50:32,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:50:32,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:32,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:50:32,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:32,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:50:32,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:50:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:32,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:50:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:32,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840541624] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:50:32,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:50:32,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 19:50:32,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554593507] [2025-04-13 19:50:32,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:50:32,386 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:50:32,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:32,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:50:32,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:50:32,387 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:32,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-04-13 19:50:32,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:32,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:32,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:32,631 INFO L116 PetriNetUnfolderBase]: 1625/2180 cut-off events. [2025-04-13 19:50:32,631 INFO L117 PetriNetUnfolderBase]: For 5157/5157 co-relation queries the response was YES. [2025-04-13 19:50:32,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8868 conditions, 2180 events. 1625/2180 cut-off events. For 5157/5157 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8616 event pairs, 257 based on Foata normal form. 62/2218 useless extension candidates. Maximal degree in co-relation 5087. Up to 1178 conditions per place. [2025-04-13 19:50:32,649 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 79 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2025-04-13 19:50:32,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 91 transitions, 676 flow [2025-04-13 19:50:32,650 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:32,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:32,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-04-13 19:50:32,651 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.632258064516129 [2025-04-13 19:50:32,651 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 272 flow. Second operand 5 states and 98 transitions. [2025-04-13 19:50:32,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 91 transitions, 676 flow [2025-04-13 19:50:32,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 91 transitions, 663 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 19:50:32,656 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 312 flow [2025-04-13 19:50:32,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2025-04-13 19:50:32,657 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2025-04-13 19:50:32,657 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 312 flow [2025-04-13 19:50:32,657 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-04-13 19:50:32,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:32,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:32,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 19:50:32,857 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 19:50:32,858 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:50:32,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:32,858 INFO L85 PathProgramCache]: Analyzing trace with hash 647838583, now seen corresponding path program 1 times [2025-04-13 19:50:32,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:32,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764072281] [2025-04-13 19:50:32,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:32,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:32,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:50:32,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:32,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:32,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:32,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:32,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764072281] [2025-04-13 19:50:32,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764072281] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:50:32,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408600289] [2025-04-13 19:50:32,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:32,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:32,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:50:32,927 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-04-13 19:50:32,929 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-04-13 19:50:32,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:50:32,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:32,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:32,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:32,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:50:32,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:50:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:33,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:50:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:33,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408600289] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:50:33,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:50:33,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 19:50:33,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230132485] [2025-04-13 19:50:33,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:50:33,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:50:33,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:33,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:50:33,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:50:33,080 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:33,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-04-13 19:50:33,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:33,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:33,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:33,327 INFO L116 PetriNetUnfolderBase]: 1745/2383 cut-off events. [2025-04-13 19:50:33,328 INFO L117 PetriNetUnfolderBase]: For 6713/6713 co-relation queries the response was YES. [2025-04-13 19:50:33,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10384 conditions, 2383 events. 1745/2383 cut-off events. For 6713/6713 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10195 event pairs, 349 based on Foata normal form. 80/2453 useless extension candidates. Maximal degree in co-relation 9122. Up to 1174 conditions per place. [2025-04-13 19:50:33,343 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 115 selfloop transitions, 10 changer transitions 0/129 dead transitions. [2025-04-13 19:50:33,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 129 transitions, 1070 flow [2025-04-13 19:50:33,344 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:33,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-04-13 19:50:33,345 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7290322580645161 [2025-04-13 19:50:33,346 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 312 flow. Second operand 5 states and 113 transitions. [2025-04-13 19:50:33,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 129 transitions, 1070 flow [2025-04-13 19:50:33,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 129 transitions, 1012 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-04-13 19:50:33,352 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 348 flow [2025-04-13 19:50:33,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=348, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2025-04-13 19:50:33,353 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2025-04-13 19:50:33,353 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 348 flow [2025-04-13 19:50:33,353 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-04-13 19:50:33,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:33,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:33,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 19:50:33,553 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:33,554 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:50:33,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:33,554 INFO L85 PathProgramCache]: Analyzing trace with hash 6542891, now seen corresponding path program 2 times [2025-04-13 19:50:33,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:33,554 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886130161] [2025-04-13 19:50:33,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:50:33,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:33,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:50:33,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:33,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:50:33,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:33,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:33,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886130161] [2025-04-13 19:50:33,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886130161] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:50:33,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:50:33,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:50:33,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341768342] [2025-04-13 19:50:33,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:50:33,601 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:50:33,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:33,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:50:33,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:50:33,602 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:33,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 348 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-04-13 19:50:33,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:33,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:33,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:33,761 INFO L116 PetriNetUnfolderBase]: 1515/2039 cut-off events. [2025-04-13 19:50:33,761 INFO L117 PetriNetUnfolderBase]: For 6691/6691 co-relation queries the response was YES. [2025-04-13 19:50:33,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9385 conditions, 2039 events. 1515/2039 cut-off events. For 6691/6691 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8051 event pairs, 89 based on Foata normal form. 34/2069 useless extension candidates. Maximal degree in co-relation 8355. Up to 864 conditions per place. [2025-04-13 19:50:33,770 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 108 selfloop transitions, 9 changer transitions 4/125 dead transitions. [2025-04-13 19:50:33,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 125 transitions, 1021 flow [2025-04-13 19:50:33,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:33,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:33,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-04-13 19:50:33,771 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7032258064516129 [2025-04-13 19:50:33,771 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 348 flow. Second operand 5 states and 109 transitions. [2025-04-13 19:50:33,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 125 transitions, 1021 flow [2025-04-13 19:50:33,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 125 transitions, 1012 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 19:50:33,778 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 352 flow [2025-04-13 19:50:33,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=352, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2025-04-13 19:50:33,779 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2025-04-13 19:50:33,779 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 352 flow [2025-04-13 19:50:33,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-04-13 19:50:33,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:33,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:33,779 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:50:33,779 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:50:33,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:33,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1430019094, now seen corresponding path program 2 times [2025-04-13 19:50:33,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:33,779 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050709153] [2025-04-13 19:50:33,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:50:33,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:33,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:50:33,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:33,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:50:33,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:33,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:33,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050709153] [2025-04-13 19:50:33,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050709153] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:50:33,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732543050] [2025-04-13 19:50:33,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:50:33,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:33,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:50:33,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:50:33,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 19:50:33,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:50:33,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:33,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:50:33,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:33,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:50:33,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:50:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:33,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:50:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:34,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732543050] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:50:34,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:50:34,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 19:50:34,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490853031] [2025-04-13 19:50:34,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:50:34,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:50:34,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:34,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:50:34,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:50:34,018 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:34,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 352 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-04-13 19:50:34,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:34,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:34,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:34,210 INFO L116 PetriNetUnfolderBase]: 1447/1984 cut-off events. [2025-04-13 19:50:34,210 INFO L117 PetriNetUnfolderBase]: For 6774/6774 co-relation queries the response was YES. [2025-04-13 19:50:34,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9418 conditions, 1984 events. 1447/1984 cut-off events. For 6774/6774 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8186 event pairs, 375 based on Foata normal form. 68/2042 useless extension candidates. Maximal degree in co-relation 8387. Up to 1150 conditions per place. [2025-04-13 19:50:34,219 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 111 selfloop transitions, 8 changer transitions 0/123 dead transitions. [2025-04-13 19:50:34,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 123 transitions, 1041 flow [2025-04-13 19:50:34,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:34,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:34,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-04-13 19:50:34,220 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6838709677419355 [2025-04-13 19:50:34,220 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 352 flow. Second operand 5 states and 106 transitions. [2025-04-13 19:50:34,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 123 transitions, 1041 flow [2025-04-13 19:50:34,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 123 transitions, 1034 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:50:34,225 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 399 flow [2025-04-13 19:50:34,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=399, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2025-04-13 19:50:34,226 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 34 predicate places. [2025-04-13 19:50:34,226 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 399 flow [2025-04-13 19:50:34,226 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-04-13 19:50:34,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:34,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:34,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 19:50:34,427 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:34,427 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:50:34,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:34,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1545000369, now seen corresponding path program 1 times [2025-04-13 19:50:34,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:34,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680568117] [2025-04-13 19:50:34,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:34,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:34,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:50:34,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:50:34,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:34,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:34,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:34,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680568117] [2025-04-13 19:50:34,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680568117] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:50:34,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122413699] [2025-04-13 19:50:34,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:34,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:34,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:50:34,763 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:50:34,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 19:50:34,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:50:34,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:50:34,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:34,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:34,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 19:50:34,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:51:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:51:22,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:51:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:51:33,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122413699] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:51:33,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:51:33,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-04-13 19:51:33,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787067263] [2025-04-13 19:51:33,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:51:33,097 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:51:33,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:51:33,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:51:33,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=136, Unknown=2, NotChecked=0, Total=182 [2025-04-13 19:51:33,098 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:51:33,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 399 flow. Second operand has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 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-04-13 19:51:33,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:51:33,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:51:33,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:51:39,907 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:44,028 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:45,514 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:52,312 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:56,371 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:00,351 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:04,472 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:06,677 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:10,729 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:13,751 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:15,938 INFO L116 PetriNetUnfolderBase]: 2261/3116 cut-off events. [2025-04-13 19:52:15,939 INFO L117 PetriNetUnfolderBase]: For 10955/10955 co-relation queries the response was YES. [2025-04-13 19:52:15,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16090 conditions, 3116 events. 2261/3116 cut-off events. For 10955/10955 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 14050 event pairs, 123 based on Foata normal form. 2/3108 useless extension candidates. Maximal degree in co-relation 15021. Up to 2040 conditions per place. [2025-04-13 19:52:15,954 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 142 selfloop transitions, 31 changer transitions 6/183 dead transitions. [2025-04-13 19:52:15,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 183 transitions, 1501 flow [2025-04-13 19:52:15,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:52:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:52:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2025-04-13 19:52:15,955 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7526881720430108 [2025-04-13 19:52:15,955 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 399 flow. Second operand 9 states and 210 transitions. [2025-04-13 19:52:15,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 183 transitions, 1501 flow [2025-04-13 19:52:15,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 183 transitions, 1480 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-04-13 19:52:15,965 INFO L231 Difference]: Finished difference. Result has 81 places, 80 transitions, 786 flow [2025-04-13 19:52:15,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=786, PETRI_PLACES=81, PETRI_TRANSITIONS=80} [2025-04-13 19:52:15,966 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 46 predicate places. [2025-04-13 19:52:15,966 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 786 flow [2025-04-13 19:52:15,966 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 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-04-13 19:52:15,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:52:15,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:52:15,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 19:52:16,166 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 19:52:16,166 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:52:16,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:52:16,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1159116137, now seen corresponding path program 1 times [2025-04-13 19:52:16,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:52:16,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864952218] [2025-04-13 19:52:16,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:52:16,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:52:16,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:52:16,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:52:16,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:52:16,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:52:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:52:16,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:52:16,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864952218] [2025-04-13 19:52:16,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864952218] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:52:16,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79653498] [2025-04-13 19:52:16,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:52:16,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:52:16,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:52:16,460 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:52:16,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 19:52:16,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:52:16,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:52:16,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:52:16,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:52:16,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:52:16,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:52:18,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:52:18,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:52:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:52:18,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79653498] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:52:18,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:52:18,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 19:52:18,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573238737] [2025-04-13 19:52:18,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:52:18,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:52:18,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:52:18,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:52:18,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-04-13 19:52:18,594 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:52:18,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 80 transitions, 786 flow. Second operand has 16 states, 16 states have (on average 11.5625) internal successors, (185), 16 states have internal predecessors, (185), 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-04-13 19:52:18,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:52:18,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:52:18,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:52:20,729 INFO L116 PetriNetUnfolderBase]: 3517/4843 cut-off events. [2025-04-13 19:52:20,729 INFO L117 PetriNetUnfolderBase]: For 19377/19377 co-relation queries the response was YES. [2025-04-13 19:52:20,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25876 conditions, 4843 events. 3517/4843 cut-off events. For 19377/19377 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 22985 event pairs, 276 based on Foata normal form. 15/4848 useless extension candidates. Maximal degree in co-relation 23259. Up to 3228 conditions per place. [2025-04-13 19:52:20,753 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 205 selfloop transitions, 100 changer transitions 20/329 dead transitions. [2025-04-13 19:52:20,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 329 transitions, 3205 flow [2025-04-13 19:52:20,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:52:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 19:52:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 329 transitions. [2025-04-13 19:52:20,755 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6633064516129032 [2025-04-13 19:52:20,755 INFO L175 Difference]: Start difference. First operand has 81 places, 80 transitions, 786 flow. Second operand 16 states and 329 transitions. [2025-04-13 19:52:20,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 329 transitions, 3205 flow [2025-04-13 19:52:20,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 329 transitions, 3120 flow, removed 40 selfloop flow, removed 1 redundant places. [2025-04-13 19:52:20,783 INFO L231 Difference]: Finished difference. Result has 105 places, 178 transitions, 2033 flow [2025-04-13 19:52:20,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2033, PETRI_PLACES=105, PETRI_TRANSITIONS=178} [2025-04-13 19:52:20,783 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 70 predicate places. [2025-04-13 19:52:20,783 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 178 transitions, 2033 flow [2025-04-13 19:52:20,784 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.5625) internal successors, (185), 16 states have internal predecessors, (185), 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-04-13 19:52:20,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:52:20,784 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:52:20,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 19:52:20,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:52:20,984 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:52:20,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:52:20,985 INFO L85 PathProgramCache]: Analyzing trace with hash -541474483, now seen corresponding path program 2 times [2025-04-13 19:52:20,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:52:20,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627095266] [2025-04-13 19:52:20,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:52:20,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:52:20,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 19:52:21,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:52:21,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:52:21,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:52:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:52:21,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:52:21,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627095266] [2025-04-13 19:52:21,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627095266] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:52:21,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051970604] [2025-04-13 19:52:21,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:52:21,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:52:21,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:52:21,150 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:52:21,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 19:52:21,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 19:52:21,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:52:21,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:52:21,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:52:21,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:52:21,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:52:32,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:52:32,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:52:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:52:33,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051970604] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:52:33,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:52:33,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 5, 5] total 11 [2025-04-13 19:52:33,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679749380] [2025-04-13 19:52:33,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:52:33,408 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 19:52:33,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:52:33,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 19:52:33,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=103, Unknown=1, NotChecked=0, Total=156 [2025-04-13 19:52:33,409 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:52:33,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 178 transitions, 2033 flow. Second operand has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 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-04-13 19:52:33,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:52:33,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:52:33,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:52:37,767 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:41,822 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:43,597 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:56,671 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:00,681 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:04,688 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:09,678 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:13,781 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:17,793 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:21,798 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:26,094 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:30,136 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:34,982 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:38,985 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:42,999 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:46,013 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:52,654 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:53,998 INFO L116 PetriNetUnfolderBase]: 5242/7221 cut-off events. [2025-04-13 19:53:53,998 INFO L117 PetriNetUnfolderBase]: For 45440/45440 co-relation queries the response was YES. [2025-04-13 19:53:54,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43036 conditions, 7221 events. 5242/7221 cut-off events. For 45440/45440 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 35830 event pairs, 342 based on Foata normal form. 16/7227 useless extension candidates. Maximal degree in co-relation 42493. Up to 4888 conditions per place. [2025-04-13 19:53:54,042 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 311 selfloop transitions, 159 changer transitions 21/495 dead transitions. [2025-04-13 19:53:54,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 495 transitions, 5735 flow [2025-04-13 19:53:54,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 19:53:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 19:53:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 403 transitions. [2025-04-13 19:53:54,044 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-04-13 19:53:54,044 INFO L175 Difference]: Start difference. First operand has 105 places, 178 transitions, 2033 flow. Second operand 20 states and 403 transitions. [2025-04-13 19:53:54,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 495 transitions, 5735 flow [2025-04-13 19:53:54,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 495 transitions, 5454 flow, removed 138 selfloop flow, removed 1 redundant places. [2025-04-13 19:53:54,235 INFO L231 Difference]: Finished difference. Result has 137 places, 299 transitions, 3844 flow [2025-04-13 19:53:54,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1764, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3844, PETRI_PLACES=137, PETRI_TRANSITIONS=299} [2025-04-13 19:53:54,237 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 102 predicate places. [2025-04-13 19:53:54,237 INFO L485 AbstractCegarLoop]: Abstraction has has 137 places, 299 transitions, 3844 flow [2025-04-13 19:53:54,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 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-04-13 19:53:54,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:53:54,238 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:53:54,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 19:53:54,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:53:54,439 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:53:54,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:53:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash 776493149, now seen corresponding path program 2 times [2025-04-13 19:53:54,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:53:54,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881607881] [2025-04-13 19:53:54,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:53:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:53:54,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 19:53:54,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:53:54,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:53:54,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:54,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:53:54,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881607881] [2025-04-13 19:53:54,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881607881] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:53:54,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804846499] [2025-04-13 19:53:54,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:53:54,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:53:54,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:53:54,612 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:53:54,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 19:53:54,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 19:53:54,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:53:54,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:53:54,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:54,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:53:54,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:53:59,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:59,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:54:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:54:00,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804846499] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:54:00,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:54:00,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 5, 5] total 11 [2025-04-13 19:54:00,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744440708] [2025-04-13 19:54:00,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:54:00,105 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 19:54:00,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:54:00,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 19:54:00,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=105, Unknown=1, NotChecked=0, Total=156 [2025-04-13 19:54:00,106 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:54:00,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 299 transitions, 3844 flow. Second operand has 13 states, 13 states have (on average 12.23076923076923) internal successors, (159), 13 states have internal predecessors, (159), 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-04-13 19:54:00,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:54:00,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:54:00,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:54:11,328 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:54:15,507 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:54:19,350 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:54:22,398 INFO L116 PetriNetUnfolderBase]: 8762/12259 cut-off events. [2025-04-13 19:54:22,398 INFO L117 PetriNetUnfolderBase]: For 120742/120742 co-relation queries the response was YES. [2025-04-13 19:54:22,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79736 conditions, 12259 events. 8762/12259 cut-off events. For 120742/120742 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 68508 event pairs, 258 based on Foata normal form. 18/12273 useless extension candidates. Maximal degree in co-relation 78954. Up to 6522 conditions per place. [2025-04-13 19:54:22,476 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 533 selfloop transitions, 225 changer transitions 27/789 dead transitions. [2025-04-13 19:54:22,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 789 transitions, 9694 flow [2025-04-13 19:54:22,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 19:54:22,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 19:54:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 486 transitions. [2025-04-13 19:54:22,478 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7126099706744868 [2025-04-13 19:54:22,478 INFO L175 Difference]: Start difference. First operand has 137 places, 299 transitions, 3844 flow. Second operand 22 states and 486 transitions. [2025-04-13 19:54:22,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 789 transitions, 9694 flow [2025-04-13 19:54:22,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 789 transitions, 8993 flow, removed 347 selfloop flow, removed 1 redundant places. [2025-04-13 19:54:22,802 INFO L231 Difference]: Finished difference. Result has 167 places, 497 transitions, 6626 flow [2025-04-13 19:54:22,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3353, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=6626, PETRI_PLACES=167, PETRI_TRANSITIONS=497} [2025-04-13 19:54:22,804 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 132 predicate places. [2025-04-13 19:54:22,804 INFO L485 AbstractCegarLoop]: Abstraction has has 167 places, 497 transitions, 6626 flow [2025-04-13 19:54:22,804 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.23076923076923) internal successors, (159), 13 states have internal predecessors, (159), 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-04-13 19:54:22,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:54:22,804 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:54:22,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 19:54:23,005 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 19:54:23,005 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:54:23,005 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:54:23,005 INFO L85 PathProgramCache]: Analyzing trace with hash 731814889, now seen corresponding path program 3 times [2025-04-13 19:54:23,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:54:23,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855583817] [2025-04-13 19:54:23,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:54:23,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:54:23,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:54:23,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:54:23,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:54:23,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:54:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:54:23,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:54:23,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855583817] [2025-04-13 19:54:23,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855583817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:54:23,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477730081] [2025-04-13 19:54:23,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:54:23,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:54:23,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:54:23,099 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:54:23,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 19:54:23,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:54:23,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:54:23,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:54:23,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:54:23,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:54:23,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:54:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:54:43,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:55:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:55:12,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477730081] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:55:12,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:55:12,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 19:55:12,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632332411] [2025-04-13 19:55:12,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:55:12,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:55:12,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:55:12,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:55:12,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=180, Unknown=12, NotChecked=0, Total=240 [2025-04-13 19:55:12,576 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:55:12,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 497 transitions, 6626 flow. Second operand has 16 states, 16 states have (on average 11.6875) internal successors, (187), 16 states have internal predecessors, (187), 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-04-13 19:55:12,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:55:12,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:55:12,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:55:19,164 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:20,393 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:23,623 INFO L116 PetriNetUnfolderBase]: 10783/15140 cut-off events. [2025-04-13 19:55:23,623 INFO L117 PetriNetUnfolderBase]: For 201138/201138 co-relation queries the response was YES. [2025-04-13 19:55:23,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107195 conditions, 15140 events. 10783/15140 cut-off events. For 201138/201138 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 86248 event pairs, 384 based on Foata normal form. 185/15315 useless extension candidates. Maximal degree in co-relation 106325. Up to 4518 conditions per place. [2025-04-13 19:55:23,731 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 742 selfloop transitions, 166 changer transitions 25/937 dead transitions. [2025-04-13 19:55:23,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 937 transitions, 14053 flow [2025-04-13 19:55:23,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 19:55:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 19:55:23,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 252 transitions. [2025-04-13 19:55:23,733 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2025-04-13 19:55:23,733 INFO L175 Difference]: Start difference. First operand has 167 places, 497 transitions, 6626 flow. Second operand 12 states and 252 transitions. [2025-04-13 19:55:23,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 937 transitions, 14053 flow [2025-04-13 19:55:24,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 937 transitions, 12824 flow, removed 610 selfloop flow, removed 1 redundant places. [2025-04-13 19:55:24,502 INFO L231 Difference]: Finished difference. Result has 183 places, 559 transitions, 7471 flow [2025-04-13 19:55:24,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=6003, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7471, PETRI_PLACES=183, PETRI_TRANSITIONS=559} [2025-04-13 19:55:24,503 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 148 predicate places. [2025-04-13 19:55:24,503 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 559 transitions, 7471 flow [2025-04-13 19:55:24,503 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.6875) internal successors, (187), 16 states have internal predecessors, (187), 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-04-13 19:55:24,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:55:24,503 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:55:24,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 19:55:24,708 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 19:55:24,708 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:55:24,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:55:24,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2076560567, now seen corresponding path program 3 times [2025-04-13 19:55:24,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:55:24,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306877246] [2025-04-13 19:55:24,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:55:24,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:55:24,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:55:24,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:55:24,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:55:24,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:55:24,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:55:24,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306877246] [2025-04-13 19:55:24,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306877246] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:55:24,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319925662] [2025-04-13 19:55:24,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:55:24,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:55:24,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:55:24,803 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:55:24,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 19:55:24,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:55:24,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:55:24,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:55:24,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:24,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 19:55:24,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:55:49,637 WARN L286 SmtUtils]: Spent 16.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 19:56:01,649 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 19:56:17,670 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 19:56:33,687 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 19:56:49,774 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (* (div (* (- 1) c_~x1~0) 16) 4294967295) 4294967296)) (.cse1 (mod c_~n~0 4294967296)) (.cse3 (mod c_~x3~0 4294967296)) (.cse2 (div c_~x2~0 16))) (and (<= 1 .cse0) (<= .cse1 (mod c_~x1~0 4294967296)) (= (mod (* (div (* (- 1) .cse2) 16) 4294967295) 4294967296) .cse0) (= .cse3 (mod c_~x4~0 4294967296)) (= (mod c_~x2~0 16) 0) (<= (+ (mod .cse2 4294967296) 1) .cse1) (= (mod (* c_~x1~0 15) 16) 0) (<= 1 .cse3) (= (mod (* 15 .cse2) 16) 0))) is different from false [2025-04-13 19:57:05,793 WARN L286 SmtUtils]: Spent 16.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 19:57:17,808 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 19:57:33,830 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 19:57:49,846 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 19:58:18,064 WARN L286 SmtUtils]: Spent 16.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 19:58:30,076 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 19:58:46,097 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 19:59:02,117 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 19:59:30,239 WARN L286 SmtUtils]: Spent 16.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 19:59:50,270 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:00:06,298 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:00:10,304 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (div c_~x2~0 16))) (let ((.cse0 (mod (* (div (* (- 1) c_~x1~0) 16) 4294967295) 4294967296)) (.cse3 (mod c_~x3~0 4294967296)) (.cse1 (+ (mod .cse2 4294967296) 1))) (and (<= 1 .cse0) (<= .cse1 (mod c_~x1~0 4294967296)) (= (mod (* (div (* (- 1) .cse2) 16) 4294967295) 4294967296) .cse0) (= .cse3 (mod c_~x4~0 4294967296)) (= (mod c_~x2~0 16) 0) (= (mod (* c_~x1~0 15) 16) 0) (<= 1 .cse3) (<= .cse1 (mod c_~x2~0 4294967296)) (= (mod (* 15 .cse2) 16) 0)))) is different from false [2025-04-13 20:00:26,325 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:00:38,337 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:00:54,355 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:01:10,376 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:01:26,403 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:01:42,451 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:01:58,472 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:02:10,485 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:02:26,499 WARN L286 SmtUtils]: Spent 16.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:02:34,517 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:02:46,528 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:03:02,559 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:03:18,581 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:03:34,596 WARN L286 SmtUtils]: Spent 16.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:03:46,608 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:04:02,629 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:04:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-13 20:04:09,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:04:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:04:41,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319925662] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:04:41,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:04:41,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 17 [2025-04-13 20:04:41,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31590120] [2025-04-13 20:04:41,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:04:41,749 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:04:41,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:04:41,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:04:41,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=185, Unknown=10, NotChecked=58, Total=306 [2025-04-13 20:04:41,750 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 20:04:41,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 559 transitions, 7471 flow. Second operand has 18 states, 18 states have (on average 11.277777777777779) internal successors, (203), 18 states have internal predecessors, (203), 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-04-13 20:04:41,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:04:41,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 20:04:41,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:04:59,446 WARN L286 SmtUtils]: Spent 14.71s on a formula simplification. DAG size of input: 52 DAG size of output: 32 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:05:07,577 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 34 DAG size of output: 33 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2025-04-13 20:05:08,018 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:05:08,064 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:05:09,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 20:05:09,218 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-13 20:05:09,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-13 20:05:09,231 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 20:05:09,231 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:05:09,231 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-13 20:05:09,232 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 20:05:09,232 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 20:05:09,232 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 20:05:09,232 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 20:05:09,233 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 1] [2025-04-13 20:05:09,235 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:05:09,235 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:05:09,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:05:09 BasicIcfg [2025-04-13 20:05:09,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:05:09,237 INFO L158 Benchmark]: Toolchain (without parser) took 880507.68ms. Allocated memory was 167.8MB in the beginning and 671.1MB in the end (delta: 503.3MB). Free memory was 119.3MB in the beginning and 214.1MB in the end (delta: -94.7MB). Peak memory consumption was 405.6MB. Max. memory is 8.0GB. [2025-04-13 20:05:09,237 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 163.6MB. Free memory is still 90.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:05:09,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.38ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 104.6MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:05:09,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.71ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 103.0MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:05:09,238 INFO L158 Benchmark]: Boogie Preprocessor took 41.14ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 101.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:05:09,238 INFO L158 Benchmark]: RCFGBuilder took 379.34ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 67.5MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-13 20:05:09,238 INFO L158 Benchmark]: TraceAbstraction took 879840.10ms. Allocated memory was 167.8MB in the beginning and 671.1MB in the end (delta: 503.3MB). Free memory was 66.8MB in the beginning and 214.1MB in the end (delta: -147.2MB). Peak memory consumption was 355.3MB. Max. memory is 8.0GB. [2025-04-13 20:05:09,239 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.29ms. Allocated memory is still 163.6MB. Free memory is still 90.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.38ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 104.6MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.71ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 103.0MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.14ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 101.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 379.34ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 67.5MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 879840.10ms. Allocated memory was 167.8MB in the beginning and 671.1MB in the end (delta: 503.3MB). Free memory was 66.8MB in the beginning and 214.1MB in the end (delta: -147.2MB). Peak memory consumption was 355.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 44 locations, 51 edges, 5 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: 879.8s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 190.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 21 mSolverCounterUnknown, 1016 SdHoareTripleChecker+Valid, 130.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1016 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 130.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 18 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3662 IncrementalHoareTripleChecker+Invalid, 3812 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 0 mSDtfsCounter, 3662 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 557 GetRequests, 400 SyntacticMatches, 9 SemanticMatches, 148 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 194.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7471occurred in iteration=14, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 686.3s InterpolantComputationTime, 590 NumberOfCodeBlocks, 590 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 793 ConstructedInterpolants, 0 QuantifiedInterpolants, 13575 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1574 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 35 InterpolantComputations, 5 PerfectInterpolantSequences, 9/61 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown