./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:11:35,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:11:35,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:11:35,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:11:35,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:11:35,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:11:35,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:11:35,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:11:35,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:11:35,254 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:11:35,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:11:35,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:11:35,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:11:35,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:11:35,256 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:11:35,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:11:35,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:11:35,260 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:11:35,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:11:35,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:11:35,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:11:35,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:11:35,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:11:35,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:11:35,262 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:11:35,264 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:11:35,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:11:35,264 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:11:35,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:11:35,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:11:35,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:11:35,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:11:35,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:11:35,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:11:35,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:11:35,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:11:35,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:11:35,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:11:35,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:11:35,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:11:35,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:11:35,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:11:35,270 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d [2024-10-24 12:11:35,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:11:35,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:11:35,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:11:35,572 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:11:35,572 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:11:35,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2024-10-24 12:11:37,122 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:11:37,412 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:11:37,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2024-10-24 12:11:37,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a2ee622/074498f620a74795a12783f6b79246d4/FLAG3e9d1e6b6 [2024-10-24 12:11:37,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a2ee622/074498f620a74795a12783f6b79246d4 [2024-10-24 12:11:37,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:11:37,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:11:37,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:11:37,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:11:37,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:11:37,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:11:37" (1/1) ... [2024-10-24 12:11:37,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ba7524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:11:37, skipping insertion in model container [2024-10-24 12:11:37,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:11:37" (1/1) ... [2024-10-24 12:11:37,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:11:37,918 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i[30640,30653] [2024-10-24 12:11:37,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:11:37,942 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:11:38,000 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i[30640,30653] [2024-10-24 12:11:38,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:11:38,051 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:11:38,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:11:38 WrapperNode [2024-10-24 12:11:38,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:11:38,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:11:38,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:11:38,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:11:38,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:11:38" (1/1) ... [2024-10-24 12:11:38,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:11:38" (1/1) ... [2024-10-24 12:11:38,100 INFO L138 Inliner]: procedures = 162, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2024-10-24 12:11:38,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:11:38,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:11:38,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:11:38,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:11:38,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:11:38" (1/1) ... [2024-10-24 12:11:38,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:11:38" (1/1) ... [2024-10-24 12:11:38,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:11:38" (1/1) ... [2024-10-24 12:11:38,145 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2024-10-24 12:11:38,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:11:38" (1/1) ... [2024-10-24 12:11:38,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:11:38" (1/1) ... [2024-10-24 12:11:38,151 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:11:38" (1/1) ... [2024-10-24 12:11:38,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:11:38" (1/1) ... [2024-10-24 12:11:38,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:11:38" (1/1) ... [2024-10-24 12:11:38,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:11:38" (1/1) ... [2024-10-24 12:11:38,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:11:38,174 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:11:38,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:11:38,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:11:38,176 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:11:38" (1/1) ... [2024-10-24 12:11:38,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:11:38,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:11:38,228 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) [2024-10-24 12:11:38,233 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 [2024-10-24 12:11:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-10-24 12:11:38,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-10-24 12:11:38,291 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-24 12:11:38,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-24 12:11:38,291 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-24 12:11:38,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:11:38,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:11:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 12:11:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-24 12:11:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:11:38,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:11:38,294 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 12:11:38,426 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:11:38,429 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:11:38,613 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 12:11:38,614 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:11:38,720 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:11:38,721 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-24 12:11:38,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:11:38 BoogieIcfgContainer [2024-10-24 12:11:38,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:11:38,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:11:38,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:11:38,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:11:38,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:11:37" (1/3) ... [2024-10-24 12:11:38,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afd4666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:11:38, skipping insertion in model container [2024-10-24 12:11:38,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:11:38" (2/3) ... [2024-10-24 12:11:38,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afd4666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:11:38, skipping insertion in model container [2024-10-24 12:11:38,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:11:38" (3/3) ... [2024-10-24 12:11:38,731 INFO L112 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2024-10-24 12:11:38,767 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:11:38,768 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:11:38,768 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 12:11:38,824 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 12:11:38,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 60 flow [2024-10-24 12:11:38,981 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2024-10-24 12:11:38,982 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 12:11:38,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 3/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 60 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-10-24 12:11:38,992 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 60 flow [2024-10-24 12:11:39,008 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 25 transitions, 57 flow [2024-10-24 12:11:39,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:11:39,036 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7fcecfeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:11:39,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-24 12:11:39,045 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 12:11:39,045 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2024-10-24 12:11:39,046 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 12:11:39,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:11:39,047 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:11:39,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-24 12:11:39,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:11:39,053 INFO L85 PathProgramCache]: Analyzing trace with hash 442740158, now seen corresponding path program 1 times [2024-10-24 12:11:39,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:11:39,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857800244] [2024-10-24 12:11:39,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:11:39,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:11:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:11:39,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:11:39,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:11:39,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857800244] [2024-10-24 12:11:39,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857800244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:11:39,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:11:39,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:11:39,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502911582] [2024-10-24 12:11:39,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:11:39,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:11:39,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:11:39,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:11:39,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:11:39,503 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 26 [2024-10-24 12:11:39,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) [2024-10-24 12:11:39,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:11:39,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 26 [2024-10-24 12:11:39,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:11:39,650 INFO L124 PetriNetUnfolderBase]: 158/325 cut-off events. [2024-10-24 12:11:39,654 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-24 12:11:39,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 325 events. 158/325 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1430 event pairs, 50 based on Foata normal form. 49/359 useless extension candidates. Maximal degree in co-relation 586. Up to 134 conditions per place. [2024-10-24 12:11:39,663 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 18 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-10-24 12:11:39,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 107 flow [2024-10-24 12:11:39,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:11:39,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 12:11:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-10-24 12:11:39,680 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2024-10-24 12:11:39,682 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 57 flow. Second operand 3 states and 56 transitions. [2024-10-24 12:11:39,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 107 flow [2024-10-24 12:11:39,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 29 transitions, 106 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 12:11:39,689 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 70 flow [2024-10-24 12:11:39,691 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2024-10-24 12:11:39,694 INFO L277 CegarLoopForPetriNet]: 28 programPoint places, 0 predicate places. [2024-10-24 12:11:39,694 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 70 flow [2024-10-24 12:11:39,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) [2024-10-24 12:11:39,695 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:11:39,695 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-24 12:11:39,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:11:39,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-24 12:11:39,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:11:39,697 INFO L85 PathProgramCache]: Analyzing trace with hash 131759601, now seen corresponding path program 1 times [2024-10-24 12:11:39,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:11:39,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126970710] [2024-10-24 12:11:39,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:11:39,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:11:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:11:39,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 12:11:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:11:39,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 12:11:39,764 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 12:11:39,766 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-10-24 12:11:39,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-10-24 12:11:39,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-10-24 12:11:39,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-10-24 12:11:39,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:11:39,771 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-24 12:11:39,775 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-24 12:11:39,777 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-24 12:11:39,811 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 12:11:39,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 110 flow [2024-10-24 12:11:39,822 INFO L124 PetriNetUnfolderBase]: 4/37 cut-off events. [2024-10-24 12:11:39,822 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 12:11:39,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 37 events. 4/37 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 81 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 44. Up to 3 conditions per place. [2024-10-24 12:11:39,823 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 45 transitions, 110 flow [2024-10-24 12:11:39,824 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 32 transitions, 77 flow [2024-10-24 12:11:39,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:11:39,827 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7fcecfeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:11:39,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-24 12:11:39,831 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 12:11:39,832 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2024-10-24 12:11:39,832 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-24 12:11:39,832 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:11:39,832 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:11:39,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 12:11:39,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:11:39,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1148260080, now seen corresponding path program 1 times [2024-10-24 12:11:39,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:11:39,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92022377] [2024-10-24 12:11:39,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:11:39,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:11:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:11:39,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:11:39,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:11:39,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92022377] [2024-10-24 12:11:39,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92022377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:11:39,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:11:39,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:11:39,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147314832] [2024-10-24 12:11:39,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:11:39,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:11:39,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:11:39,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:11:39,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:11:39,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-10-24 12:11:39,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:11:39,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:11:39,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-10-24 12:11:39,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:11:40,387 INFO L124 PetriNetUnfolderBase]: 1203/1985 cut-off events. [2024-10-24 12:11:40,392 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-10-24 12:11:40,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 1985 events. 1203/1985 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10699 event pairs, 303 based on Foata normal form. 243/2162 useless extension candidates. Maximal degree in co-relation 3759. Up to 1003 conditions per place. [2024-10-24 12:11:40,421 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 25 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2024-10-24 12:11:40,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 154 flow [2024-10-24 12:11:40,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:11:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 12:11:40,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-10-24 12:11:40,427 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-10-24 12:11:40,427 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 77 flow. Second operand 3 states and 87 transitions. [2024-10-24 12:11:40,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 154 flow [2024-10-24 12:11:40,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 12:11:40,431 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 96 flow [2024-10-24 12:11:40,433 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2024-10-24 12:11:40,434 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2024-10-24 12:11:40,434 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 96 flow [2024-10-24 12:11:40,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:11:40,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:11:40,435 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2024-10-24 12:11:40,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:11:40,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 12:11:40,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:11:40,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1490065791, now seen corresponding path program 1 times [2024-10-24 12:11:40,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:11:40,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86358438] [2024-10-24 12:11:40,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:11:40,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:11:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:11:40,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 12:11:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:11:40,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 12:11:40,502 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 12:11:40,503 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-24 12:11:40,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-10-24 12:11:40,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-10-24 12:11:40,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-10-24 12:11:40,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-10-24 12:11:40,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:11:40,504 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-24 12:11:40,507 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-24 12:11:40,507 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-24 12:11:40,541 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 12:11:40,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 64 transitions, 164 flow [2024-10-24 12:11:40,554 INFO L124 PetriNetUnfolderBase]: 5/47 cut-off events. [2024-10-24 12:11:40,556 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-24 12:11:40,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 47 events. 5/47 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 101 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2024-10-24 12:11:40,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 64 transitions, 164 flow [2024-10-24 12:11:40,557 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 39 transitions, 99 flow [2024-10-24 12:11:40,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:11:40,560 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7fcecfeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:11:40,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-24 12:11:40,568 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 12:11:40,572 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2024-10-24 12:11:40,572 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-24 12:11:40,572 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:11:40,573 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:11:40,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:11:40,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:11:40,574 INFO L85 PathProgramCache]: Analyzing trace with hash 879569410, now seen corresponding path program 1 times [2024-10-24 12:11:40,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:11:40,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035444892] [2024-10-24 12:11:40,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:11:40,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:11:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:11:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:11:40,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:11:40,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035444892] [2024-10-24 12:11:40,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035444892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:11:40,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:11:40,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:11:40,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060705686] [2024-10-24 12:11:40,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:11:40,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:11:40,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:11:40,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:11:40,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:11:40,689 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2024-10-24 12:11:40,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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) [2024-10-24 12:11:40,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:11:40,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2024-10-24 12:11:40,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:11:42,043 INFO L124 PetriNetUnfolderBase]: 6995/10276 cut-off events. [2024-10-24 12:11:42,046 INFO L125 PetriNetUnfolderBase]: For 1042/1042 co-relation queries the response was YES. [2024-10-24 12:11:42,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19907 conditions, 10276 events. 6995/10276 cut-off events. For 1042/1042 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 61146 event pairs, 1712 based on Foata normal form. 1027/10990 useless extension candidates. Maximal degree in co-relation 19895. Up to 5767 conditions per place. [2024-10-24 12:11:42,357 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 32 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2024-10-24 12:11:42,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 205 flow [2024-10-24 12:11:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:11:42,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 12:11:42,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2024-10-24 12:11:42,360 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2024-10-24 12:11:42,360 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 99 flow. Second operand 3 states and 118 transitions. [2024-10-24 12:11:42,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 205 flow [2024-10-24 12:11:42,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 200 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-10-24 12:11:42,366 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 122 flow [2024-10-24 12:11:42,366 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-10-24 12:11:42,368 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2024-10-24 12:11:42,368 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 122 flow [2024-10-24 12:11:42,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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) [2024-10-24 12:11:42,369 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:11:42,369 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:11:42,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:11:42,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:11:42,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:11:42,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1979051612, now seen corresponding path program 1 times [2024-10-24 12:11:42,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:11:42,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756847366] [2024-10-24 12:11:42,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:11:42,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:11:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:11:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:11:42,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:11:42,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756847366] [2024-10-24 12:11:42,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756847366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:11:42,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:11:42,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:11:42,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457718524] [2024-10-24 12:11:42,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:11:42,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:11:42,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:11:42,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:11:42,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:11:42,477 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2024-10-24 12:11:42,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:11:42,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:11:42,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2024-10-24 12:11:42,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:11:44,441 INFO L124 PetriNetUnfolderBase]: 9157/13536 cut-off events. [2024-10-24 12:11:44,442 INFO L125 PetriNetUnfolderBase]: For 4322/4322 co-relation queries the response was YES. [2024-10-24 12:11:44,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30164 conditions, 13536 events. 9157/13536 cut-off events. For 4322/4322 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 85262 event pairs, 1070 based on Foata normal form. 135/13585 useless extension candidates. Maximal degree in co-relation 30149. Up to 6256 conditions per place. [2024-10-24 12:11:44,539 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 43 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2024-10-24 12:11:44,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 332 flow [2024-10-24 12:11:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:11:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 12:11:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2024-10-24 12:11:44,541 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.55859375 [2024-10-24 12:11:44,541 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 122 flow. Second operand 4 states and 143 transitions. [2024-10-24 12:11:44,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 332 flow [2024-10-24 12:11:44,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 12:11:44,559 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 190 flow [2024-10-24 12:11:44,559 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2024-10-24 12:11:44,561 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2024-10-24 12:11:44,562 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 190 flow [2024-10-24 12:11:44,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:11:44,562 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:11:44,562 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:11:44,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:11:44,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:11:44,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:11:44,563 INFO L85 PathProgramCache]: Analyzing trace with hash 174906068, now seen corresponding path program 1 times [2024-10-24 12:11:44,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:11:44,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319857622] [2024-10-24 12:11:44,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:11:44,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:11:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:11:44,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 12:11:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:11:44,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 12:11:44,598 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 12:11:44,598 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-10-24 12:11:44,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-10-24 12:11:44,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-10-24 12:11:44,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-10-24 12:11:44,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-10-24 12:11:44,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-10-24 12:11:44,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 12:11:44,602 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 12:11:44,603 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-24 12:11:44,603 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-24 12:11:44,637 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 12:11:44,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 83 transitions, 222 flow [2024-10-24 12:11:44,646 INFO L124 PetriNetUnfolderBase]: 6/57 cut-off events. [2024-10-24 12:11:44,647 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-24 12:11:44,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 57 events. 6/57 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 128 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 73. Up to 5 conditions per place. [2024-10-24 12:11:44,648 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 83 transitions, 222 flow [2024-10-24 12:11:44,648 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 46 transitions, 123 flow [2024-10-24 12:11:44,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:11:44,650 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7fcecfeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:11:44,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-24 12:11:44,653 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 12:11:44,653 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2024-10-24 12:11:44,654 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-24 12:11:44,654 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:11:44,654 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:11:44,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:11:44,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:11:44,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2063705964, now seen corresponding path program 1 times [2024-10-24 12:11:44,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:11:44,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510568765] [2024-10-24 12:11:44,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:11:44,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:11:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:11:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:11:44,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:11:44,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510568765] [2024-10-24 12:11:44,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510568765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:11:44,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:11:44,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:11:44,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990352006] [2024-10-24 12:11:44,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:11:44,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:11:44,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:11:44,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:11:44,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:11:44,712 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2024-10-24 12:11:44,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2024-10-24 12:11:44,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:11:44,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2024-10-24 12:11:44,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:11:49,155 INFO L124 PetriNetUnfolderBase]: 36336/49458 cut-off events. [2024-10-24 12:11:49,157 INFO L125 PetriNetUnfolderBase]: For 7744/7744 co-relation queries the response was YES. [2024-10-24 12:11:49,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97183 conditions, 49458 events. 36336/49458 cut-off events. For 7744/7744 co-relation queries the response was YES. Maximal size of possible extension queue 1821. Compared 307189 event pairs, 9261 based on Foata normal form. 4138/52287 useless extension candidates. Maximal degree in co-relation 97170. Up to 29392 conditions per place. [2024-10-24 12:11:49,528 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 39 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2024-10-24 12:11:49,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 260 flow [2024-10-24 12:11:49,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:11:49,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 12:11:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2024-10-24 12:11:49,535 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5983935742971888 [2024-10-24 12:11:49,535 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 123 flow. Second operand 3 states and 149 transitions. [2024-10-24 12:11:49,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 260 flow [2024-10-24 12:11:49,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 247 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-10-24 12:11:49,546 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 148 flow [2024-10-24 12:11:49,546 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2024-10-24 12:11:49,549 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-10-24 12:11:49,549 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 148 flow [2024-10-24 12:11:49,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2024-10-24 12:11:49,550 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:11:49,550 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:11:49,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 12:11:49,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:11:49,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:11:49,551 INFO L85 PathProgramCache]: Analyzing trace with hash -874166507, now seen corresponding path program 1 times [2024-10-24 12:11:49,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:11:49,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698534882] [2024-10-24 12:11:49,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:11:49,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:11:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:11:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:11:49,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:11:49,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698534882] [2024-10-24 12:11:49,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698534882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:11:49,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:11:49,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:11:49,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994091616] [2024-10-24 12:11:49,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:11:49,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:11:49,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:11:49,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:11:49,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:11:49,801 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2024-10-24 12:11:49,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:11:49,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:11:49,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2024-10-24 12:11:49,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:11:55,187 INFO L124 PetriNetUnfolderBase]: 43697/60206 cut-off events. [2024-10-24 12:11:55,188 INFO L125 PetriNetUnfolderBase]: For 19152/19152 co-relation queries the response was YES. [2024-10-24 12:11:55,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134949 conditions, 60206 events. 43697/60206 cut-off events. For 19152/19152 co-relation queries the response was YES. Maximal size of possible extension queue 2390. Compared 394484 event pairs, 5040 based on Foata normal form. 372/60149 useless extension candidates. Maximal degree in co-relation 134933. Up to 31321 conditions per place. [2024-10-24 12:11:56,268 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 52 selfloop transitions, 14 changer transitions 0/80 dead transitions. [2024-10-24 12:11:56,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 80 transitions, 412 flow [2024-10-24 12:11:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:11:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 12:11:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2024-10-24 12:11:56,273 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5481927710843374 [2024-10-24 12:11:56,273 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 148 flow. Second operand 4 states and 182 transitions. [2024-10-24 12:11:56,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 80 transitions, 412 flow [2024-10-24 12:11:56,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 80 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 12:11:56,316 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 235 flow [2024-10-24 12:11:56,316 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2024-10-24 12:11:56,317 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-10-24 12:11:56,317 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 235 flow [2024-10-24 12:11:56,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:11:56,317 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:11:56,317 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:11:56,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 12:11:56,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:11:56,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:11:56,319 INFO L85 PathProgramCache]: Analyzing trace with hash 224335569, now seen corresponding path program 1 times [2024-10-24 12:11:56,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:11:56,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685601061] [2024-10-24 12:11:56,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:11:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:11:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:11:56,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 12:11:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:11:56,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 12:11:56,373 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 12:11:56,374 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-10-24 12:11:56,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-10-24 12:11:56,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-10-24 12:11:56,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2024-10-24 12:11:56,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-10-24 12:11:56,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-10-24 12:11:56,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-10-24 12:11:56,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 12:11:56,375 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 12:11:56,380 WARN L239 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-24 12:11:56,380 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-10-24 12:11:56,432 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 12:11:56,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 102 transitions, 284 flow [2024-10-24 12:11:56,444 INFO L124 PetriNetUnfolderBase]: 7/67 cut-off events. [2024-10-24 12:11:56,444 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-10-24 12:11:56,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 67 events. 7/67 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 142 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 89. Up to 6 conditions per place. [2024-10-24 12:11:56,445 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 102 transitions, 284 flow [2024-10-24 12:11:56,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 53 transitions, 149 flow [2024-10-24 12:11:56,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:11:56,447 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7fcecfeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:11:56,447 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-24 12:11:56,450 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 12:11:56,450 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2024-10-24 12:11:56,450 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-24 12:11:56,450 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:11:56,450 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:11:56,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-24 12:11:56,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:11:56,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1605143622, now seen corresponding path program 1 times [2024-10-24 12:11:56,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:11:56,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81799655] [2024-10-24 12:11:56,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:11:56,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:11:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:11:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:11:56,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:11:56,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81799655] [2024-10-24 12:11:56,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81799655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:11:56,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:11:56,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:11:56,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400786996] [2024-10-24 12:11:56,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:11:56,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:11:56,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:11:56,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:11:56,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:11:56,517 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 102 [2024-10-24 12:11:56,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) [2024-10-24 12:11:56,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:11:56,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 102 [2024-10-24 12:11:56,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:12:17,480 INFO L124 PetriNetUnfolderBase]: 178118/230355 cut-off events. [2024-10-24 12:12:17,481 INFO L125 PetriNetUnfolderBase]: For 49465/49465 co-relation queries the response was YES. [2024-10-24 12:12:18,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456874 conditions, 230355 events. 178118/230355 cut-off events. For 49465/49465 co-relation queries the response was YES. Maximal size of possible extension queue 6855. Compared 1469504 event pairs, 48026 based on Foata normal form. 16512/241563 useless extension candidates. Maximal degree in co-relation 456860. Up to 141658 conditions per place. [2024-10-24 12:12:19,642 INFO L140 encePairwiseOnDemand]: 86/102 looper letters, 46 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2024-10-24 12:12:19,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 319 flow [2024-10-24 12:12:19,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:12:19,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 12:12:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2024-10-24 12:12:19,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2024-10-24 12:12:19,644 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 149 flow. Second operand 3 states and 180 transitions. [2024-10-24 12:12:19,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 319 flow [2024-10-24 12:12:19,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 294 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-10-24 12:12:19,676 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 174 flow [2024-10-24 12:12:19,676 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2024-10-24 12:12:19,677 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2024-10-24 12:12:19,677 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 174 flow [2024-10-24 12:12:19,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) [2024-10-24 12:12:19,678 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:12:19,678 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:12:19,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 12:12:19,678 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-24 12:12:19,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:12:19,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1223388690, now seen corresponding path program 1 times [2024-10-24 12:12:19,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:12:19,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424443105] [2024-10-24 12:12:19,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:12:19,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:12:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:12:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:12:19,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:12:19,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424443105] [2024-10-24 12:12:19,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424443105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:12:19,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:12:19,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:12:19,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104512211] [2024-10-24 12:12:19,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:12:19,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:12:19,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:12:19,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:12:19,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:12:19,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 102 [2024-10-24 12:12:19,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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) [2024-10-24 12:12:19,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:12:19,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 102 [2024-10-24 12:12:19,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand