./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-pthread.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs-pthread.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 389f5b7d6579b5ac06564f3c82f3f69fea502868b761df6187d49f96e1a317cd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:12:24,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:12:24,291 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:12:24,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:12:24,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:12:24,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:12:24,326 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:12:24,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:12:24,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:12:24,326 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:12:24,327 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:12:24,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:12:24,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:12:24,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:12:24,331 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:12:24,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:12:24,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:12:24,333 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:12:24,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:12:24,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:12:24,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:12:24,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:12:24,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:12:24,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:12:24,338 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:12:24,338 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:12:24,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:12:24,339 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:12:24,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:12:24,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:12:24,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:12:24,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:12:24,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:12:24,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:12:24,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:12:24,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:12:24,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:12:24,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:12:24,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:12:24,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:12:24,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:12:24,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:12:24,343 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-clean/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-clean/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 -> 389f5b7d6579b5ac06564f3c82f3f69fea502868b761df6187d49f96e1a317cd [2024-10-11 14:12:24,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:12:24,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:12:24,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:12:24,556 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:12:24,557 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:12:24,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs-pthread.i [2024-10-11 14:12:25,957 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:12:26,191 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:12:26,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs-pthread.i [2024-10-11 14:12:26,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/37e416c03/64e1dde54a064685bdc61e8969ed0435/FLAGdfb0e1cad [2024-10-11 14:12:26,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/37e416c03/64e1dde54a064685bdc61e8969ed0435 [2024-10-11 14:12:26,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:12:26,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:12:26,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:12:26,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:12:26,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:12:26,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:12:26" (1/1) ... [2024-10-11 14:12:26,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f2c77fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:26, skipping insertion in model container [2024-10-11 14:12:26,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:12:26" (1/1) ... [2024-10-11 14:12:26,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:12:26,913 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-pthread.i[30648,30661] [2024-10-11 14:12:26,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:12:26,930 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:12:26,968 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-pthread.i[30648,30661] [2024-10-11 14:12:26,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:12:27,004 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:12:27,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27 WrapperNode [2024-10-11 14:12:27,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:12:27,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:12:27,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:12:27,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:12:27,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,051 INFO L138 Inliner]: procedures = 162, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2024-10-11 14:12:27,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:12:27,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:12:27,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:12:27,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:12:27,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,073 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-11 14:12:27,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,079 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:12:27,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:12:27,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:12:27,086 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:12:27,087 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:12:27,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:12:27,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:12:27,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:12:27,164 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-10-11 14:12:27,164 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-10-11 14:12:27,165 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-11 14:12:27,165 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-11 14:12:27,165 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 14:12:27,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:12:27,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:12:27,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:12:27,166 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 14:12:27,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:12:27,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:12:27,168 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:12:27,287 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:12:27,288 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:12:27,370 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:12:27,370 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:12:27,458 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:12:27,458 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 14:12:27,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:12:27 BoogieIcfgContainer [2024-10-11 14:12:27,459 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:12:27,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:12:27,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:12:27,463 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:12:27,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:12:26" (1/3) ... [2024-10-11 14:12:27,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d218c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:12:27, skipping insertion in model container [2024-10-11 14:12:27,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (2/3) ... [2024-10-11 14:12:27,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d218c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:12:27, skipping insertion in model container [2024-10-11 14:12:27,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:12:27" (3/3) ... [2024-10-11 14:12:27,466 INFO L112 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs-pthread.i [2024-10-11 14:12:27,479 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:12:27,479 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:12:27,479 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:12:27,507 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:12:27,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 60 flow [2024-10-11 14:12:27,551 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2024-10-11 14:12:27,552 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:12:27,554 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-11 14:12:27,554 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 60 flow [2024-10-11 14:12:27,557 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 25 transitions, 57 flow [2024-10-11 14:12:27,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:12:27,568 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;@50c056a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:12:27,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 14:12:27,574 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:12:27,575 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2024-10-11 14:12:27,575 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:12:27,575 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:27,576 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:27,576 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-11 14:12:27,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:27,582 INFO L85 PathProgramCache]: Analyzing trace with hash 442740158, now seen corresponding path program 1 times [2024-10-11 14:12:27,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:27,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368800326] [2024-10-11 14:12:27,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:27,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:27,834 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-11 14:12:27,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:27,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368800326] [2024-10-11 14:12:27,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368800326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:27,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:27,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:12:27,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913837943] [2024-10-11 14:12:27,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:27,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:12:27,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:27,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:12:27,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:12:27,888 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 26 [2024-10-11 14:12:27,890 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-11 14:12:27,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:27,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 26 [2024-10-11 14:12:27,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:28,032 INFO L124 PetriNetUnfolderBase]: 158/325 cut-off events. [2024-10-11 14:12:28,032 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 14:12:28,034 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-11 14:12:28,037 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 18 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-10-11 14:12:28,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 107 flow [2024-10-11 14:12:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:12:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:12:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-10-11 14:12:28,047 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2024-10-11 14:12:28,048 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 57 flow. Second operand 3 states and 56 transitions. [2024-10-11 14:12:28,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 107 flow [2024-10-11 14:12:28,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 29 transitions, 106 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:12:28,053 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 70 flow [2024-10-11 14:12:28,056 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-11 14:12:28,058 INFO L277 CegarLoopForPetriNet]: 28 programPoint places, 0 predicate places. [2024-10-11 14:12:28,058 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 70 flow [2024-10-11 14:12:28,059 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-11 14:12:28,059 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:28,059 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:28,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:12:28,060 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-11 14:12:28,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:28,061 INFO L85 PathProgramCache]: Analyzing trace with hash 131759601, now seen corresponding path program 1 times [2024-10-11 14:12:28,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:28,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680101049] [2024-10-11 14:12:28,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:28,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:28,079 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:12:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:28,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:12:28,100 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:12:28,101 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-10-11 14:12:28,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-10-11 14:12:28,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-10-11 14:12:28,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-10-11 14:12:28,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:12:28,104 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 14:12:28,109 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 14:12:28,109 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 14:12:28,135 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:12:28,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 110 flow [2024-10-11 14:12:28,159 INFO L124 PetriNetUnfolderBase]: 4/37 cut-off events. [2024-10-11 14:12:28,159 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 14:12:28,159 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-11 14:12:28,159 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 45 transitions, 110 flow [2024-10-11 14:12:28,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 32 transitions, 77 flow [2024-10-11 14:12:28,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:12:28,162 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;@50c056a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:12:28,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-11 14:12:28,173 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:12:28,173 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2024-10-11 14:12:28,176 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 14:12:28,176 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:28,176 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:28,176 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-11 14:12:28,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:28,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1148260080, now seen corresponding path program 1 times [2024-10-11 14:12:28,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:28,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446126766] [2024-10-11 14:12:28,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:28,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:28,239 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-11 14:12:28,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:28,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446126766] [2024-10-11 14:12:28,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446126766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:28,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:28,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:12:28,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042244299] [2024-10-11 14:12:28,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:28,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:12:28,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:28,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:12:28,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:12:28,247 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-10-11 14:12:28,248 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-11 14:12:28,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:28,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-10-11 14:12:28,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:28,463 INFO L124 PetriNetUnfolderBase]: 1203/1985 cut-off events. [2024-10-11 14:12:28,463 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-10-11 14:12:28,471 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-11 14:12:28,483 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 25 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2024-10-11 14:12:28,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 154 flow [2024-10-11 14:12:28,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:12:28,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:12:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-10-11 14:12:28,488 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-10-11 14:12:28,488 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 77 flow. Second operand 3 states and 87 transitions. [2024-10-11 14:12:28,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 154 flow [2024-10-11 14:12:28,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:12:28,491 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 96 flow [2024-10-11 14:12:28,491 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-11 14:12:28,492 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2024-10-11 14:12:28,493 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 96 flow [2024-10-11 14:12:28,494 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-11 14:12:28,494 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:28,495 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:28,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:12:28,495 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-11 14:12:28,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:28,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1490065791, now seen corresponding path program 1 times [2024-10-11 14:12:28,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:28,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122721408] [2024-10-11 14:12:28,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:28,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:28,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:12:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:28,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:12:28,522 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:12:28,522 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-11 14:12:28,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-10-11 14:12:28,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-10-11 14:12:28,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-10-11 14:12:28,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-10-11 14:12:28,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:12:28,523 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 14:12:28,526 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 14:12:28,526 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 14:12:28,562 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:12:28,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 64 transitions, 164 flow [2024-10-11 14:12:28,567 INFO L124 PetriNetUnfolderBase]: 5/47 cut-off events. [2024-10-11 14:12:28,568 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 14:12:28,568 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-11 14:12:28,568 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 64 transitions, 164 flow [2024-10-11 14:12:28,568 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 39 transitions, 99 flow [2024-10-11 14:12:28,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:12:28,570 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;@50c056a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:12:28,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 14:12:28,571 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:12:28,571 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2024-10-11 14:12:28,571 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 14:12:28,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:28,572 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:28,572 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-11 14:12:28,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:28,572 INFO L85 PathProgramCache]: Analyzing trace with hash 879569410, now seen corresponding path program 1 times [2024-10-11 14:12:28,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:28,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946823114] [2024-10-11 14:12:28,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:28,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:28,601 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-11 14:12:28,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:28,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946823114] [2024-10-11 14:12:28,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946823114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:28,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:28,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:12:28,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95570733] [2024-10-11 14:12:28,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:28,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:12:28,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:28,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:12:28,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:12:28,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2024-10-11 14:12:28,609 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-11 14:12:28,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:28,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2024-10-11 14:12:28,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:29,305 INFO L124 PetriNetUnfolderBase]: 6995/10276 cut-off events. [2024-10-11 14:12:29,305 INFO L125 PetriNetUnfolderBase]: For 1042/1042 co-relation queries the response was YES. [2024-10-11 14:12:29,324 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-11 14:12:29,424 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 32 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2024-10-11 14:12:29,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 205 flow [2024-10-11 14:12:29,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:12:29,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:12:29,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2024-10-11 14:12:29,427 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2024-10-11 14:12:29,427 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 99 flow. Second operand 3 states and 118 transitions. [2024-10-11 14:12:29,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 205 flow [2024-10-11 14:12:29,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 200 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-10-11 14:12:29,430 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 122 flow [2024-10-11 14:12:29,431 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-11 14:12:29,431 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2024-10-11 14:12:29,432 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 122 flow [2024-10-11 14:12:29,433 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-11 14:12:29,433 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:29,433 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:29,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:12:29,433 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-11 14:12:29,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:29,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1979051612, now seen corresponding path program 1 times [2024-10-11 14:12:29,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:29,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688859421] [2024-10-11 14:12:29,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:29,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:29,502 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-11 14:12:29,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:29,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688859421] [2024-10-11 14:12:29,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688859421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:29,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:29,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:12:29,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455330406] [2024-10-11 14:12:29,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:29,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:12:29,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:29,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:12:29,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:12:29,532 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2024-10-11 14:12:29,533 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-11 14:12:29,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:29,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2024-10-11 14:12:29,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:30,451 INFO L124 PetriNetUnfolderBase]: 9157/13536 cut-off events. [2024-10-11 14:12:30,453 INFO L125 PetriNetUnfolderBase]: For 4322/4322 co-relation queries the response was YES. [2024-10-11 14:12:30,473 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-11 14:12:30,551 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 43 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2024-10-11 14:12:30,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 332 flow [2024-10-11 14:12:30,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:12:30,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:12:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2024-10-11 14:12:30,553 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.55859375 [2024-10-11 14:12:30,553 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 122 flow. Second operand 4 states and 143 transitions. [2024-10-11 14:12:30,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 332 flow [2024-10-11 14:12:30,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:12:30,566 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 190 flow [2024-10-11 14:12:30,566 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-11 14:12:30,568 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2024-10-11 14:12:30,568 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 190 flow [2024-10-11 14:12:30,569 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-11 14:12:30,569 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:30,569 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:30,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:12:30,569 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-11 14:12:30,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash 174906068, now seen corresponding path program 1 times [2024-10-11 14:12:30,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:30,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233316864] [2024-10-11 14:12:30,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:30,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:30,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:12:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:30,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:12:30,602 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:12:30,602 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-10-11 14:12:30,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-10-11 14:12:30,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-10-11 14:12:30,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-10-11 14:12:30,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-10-11 14:12:30,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-10-11 14:12:30,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:12:30,603 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 14:12:30,604 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 14:12:30,604 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-11 14:12:30,636 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:12:30,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 83 transitions, 222 flow [2024-10-11 14:12:30,645 INFO L124 PetriNetUnfolderBase]: 6/57 cut-off events. [2024-10-11 14:12:30,646 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-11 14:12:30,646 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-11 14:12:30,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 83 transitions, 222 flow [2024-10-11 14:12:30,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 46 transitions, 123 flow [2024-10-11 14:12:30,648 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:12:30,649 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;@50c056a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:12:30,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-11 14:12:30,653 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:12:30,653 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2024-10-11 14:12:30,653 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 14:12:30,653 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:30,654 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:30,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-11 14:12:30,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:30,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2063705964, now seen corresponding path program 1 times [2024-10-11 14:12:30,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:30,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905219861] [2024-10-11 14:12:30,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:30,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:30,693 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-11 14:12:30,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:30,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905219861] [2024-10-11 14:12:30,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905219861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:30,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:30,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:12:30,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130384616] [2024-10-11 14:12:30,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:30,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:12:30,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:30,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:12:30,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:12:30,705 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2024-10-11 14:12:30,706 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-11 14:12:30,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:30,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2024-10-11 14:12:30,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:33,746 INFO L124 PetriNetUnfolderBase]: 36336/49458 cut-off events. [2024-10-11 14:12:33,746 INFO L125 PetriNetUnfolderBase]: For 7744/7744 co-relation queries the response was YES. [2024-10-11 14:12:33,837 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-11 14:12:34,035 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 39 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2024-10-11 14:12:34,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 260 flow [2024-10-11 14:12:34,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:12:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:12:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2024-10-11 14:12:34,040 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5983935742971888 [2024-10-11 14:12:34,040 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 123 flow. Second operand 3 states and 149 transitions. [2024-10-11 14:12:34,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 260 flow [2024-10-11 14:12:34,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 247 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-10-11 14:12:34,046 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 148 flow [2024-10-11 14:12:34,046 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-11 14:12:34,047 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-10-11 14:12:34,048 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 148 flow [2024-10-11 14:12:34,048 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-11 14:12:34,048 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:34,048 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:34,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:12:34,048 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-11 14:12:34,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:34,049 INFO L85 PathProgramCache]: Analyzing trace with hash -874166507, now seen corresponding path program 1 times [2024-10-11 14:12:34,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:34,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294523636] [2024-10-11 14:12:34,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:34,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:34,095 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-11 14:12:34,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:34,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294523636] [2024-10-11 14:12:34,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294523636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:34,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:34,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:12:34,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797119252] [2024-10-11 14:12:34,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:34,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:12:34,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:34,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:12:34,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:12:34,108 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2024-10-11 14:12:34,109 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-11 14:12:34,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:34,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2024-10-11 14:12:34,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:38,067 INFO L124 PetriNetUnfolderBase]: 43697/60206 cut-off events. [2024-10-11 14:12:38,068 INFO L125 PetriNetUnfolderBase]: For 19152/19152 co-relation queries the response was YES. [2024-10-11 14:12:38,252 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-11 14:12:38,511 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 52 selfloop transitions, 14 changer transitions 0/80 dead transitions. [2024-10-11 14:12:38,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 80 transitions, 412 flow [2024-10-11 14:12:38,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:12:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:12:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2024-10-11 14:12:38,517 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5481927710843374 [2024-10-11 14:12:38,518 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 148 flow. Second operand 4 states and 182 transitions. [2024-10-11 14:12:38,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 80 transitions, 412 flow [2024-10-11 14:12:38,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 80 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:12:38,545 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 235 flow [2024-10-11 14:12:38,545 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-11 14:12:38,547 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-10-11 14:12:38,547 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 235 flow [2024-10-11 14:12:38,547 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-11 14:12:38,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:38,548 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:38,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:12:38,548 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-11 14:12:38,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:38,548 INFO L85 PathProgramCache]: Analyzing trace with hash 224335569, now seen corresponding path program 1 times [2024-10-11 14:12:38,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:38,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320026295] [2024-10-11 14:12:38,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:38,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:38,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:12:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:38,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:12:38,574 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:12:38,574 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-10-11 14:12:38,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-10-11 14:12:38,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-10-11 14:12:38,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2024-10-11 14:12:38,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-10-11 14:12:38,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-10-11 14:12:38,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-10-11 14:12:38,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:12:38,576 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 14:12:38,577 WARN L239 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 14:12:38,577 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-10-11 14:12:38,608 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:12:38,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 102 transitions, 284 flow [2024-10-11 14:12:38,615 INFO L124 PetriNetUnfolderBase]: 7/67 cut-off events. [2024-10-11 14:12:38,615 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-10-11 14:12:38,616 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-11 14:12:38,616 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 102 transitions, 284 flow [2024-10-11 14:12:38,617 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 53 transitions, 149 flow [2024-10-11 14:12:38,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:12:38,618 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;@50c056a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:12:38,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 14:12:38,619 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:12:38,619 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2024-10-11 14:12:38,619 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 14:12:38,619 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:38,619 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:38,619 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-11 14:12:38,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:38,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1605143622, now seen corresponding path program 1 times [2024-10-11 14:12:38,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:38,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812783609] [2024-10-11 14:12:38,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:38,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:38,646 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-11 14:12:38,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:38,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812783609] [2024-10-11 14:12:38,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812783609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:38,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:38,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:12:38,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404107073] [2024-10-11 14:12:38,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:38,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:12:38,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:38,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:12:38,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:12:38,659 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 102 [2024-10-11 14:12:38,660 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-11 14:12:38,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:38,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 102 [2024-10-11 14:12:38,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:53,688 INFO L124 PetriNetUnfolderBase]: 178118/230355 cut-off events. [2024-10-11 14:12:53,688 INFO L125 PetriNetUnfolderBase]: For 49465/49465 co-relation queries the response was YES. [2024-10-11 14:12:54,335 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-11 14:12:55,651 INFO L140 encePairwiseOnDemand]: 86/102 looper letters, 46 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2024-10-11 14:12:55,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 319 flow [2024-10-11 14:12:55,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:12:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:12:55,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2024-10-11 14:12:55,652 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2024-10-11 14:12:55,653 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 149 flow. Second operand 3 states and 180 transitions. [2024-10-11 14:12:55,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 319 flow [2024-10-11 14:12:55,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 294 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-10-11 14:12:55,673 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 174 flow [2024-10-11 14:12:55,673 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-11 14:12:55,674 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2024-10-11 14:12:55,674 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 174 flow [2024-10-11 14:12:55,674 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-11 14:12:55,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:55,674 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:55,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:12:55,674 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-11 14:12:55,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:55,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1223388690, now seen corresponding path program 1 times [2024-10-11 14:12:55,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:55,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575024923] [2024-10-11 14:12:55,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:55,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:55,713 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-11 14:12:55,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:55,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575024923] [2024-10-11 14:12:55,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575024923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:55,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:55,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:12:55,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831516268] [2024-10-11 14:12:55,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:55,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:12:55,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:55,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:12:55,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:12:55,724 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 102 [2024-10-11 14:12:55,725 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-11 14:12:55,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:55,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 102 [2024-10-11 14:12:55,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand