./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/39_rand_lock_p0_vs.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/39_rand_lock_p0_vs.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 13ffae79fd42fd88852ffaba2bbbf2601df90fdda2b5dc6bd9b6228e2cf540c7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:12:48,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:12:48,950 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:48,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:12:48,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:12:48,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:12:48,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:12:48,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:12:48,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:12:48,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:12:48,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:12:48,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:12:48,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:12:48,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:12:48,983 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:12:48,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:12:48,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:12:48,987 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:12:48,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:12:48,988 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:12:48,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:12:48,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:12:48,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:12:48,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:12:48,989 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:12:48,989 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:12:48,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:12:48,989 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:12:48,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:12:48,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:12:48,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:12:48,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:12:48,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:12:48,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:12:48,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:12:48,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:12:48,991 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:12:48,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:12:48,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:12:48,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:12:48,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:12:48,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:12:48,994 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 -> 13ffae79fd42fd88852ffaba2bbbf2601df90fdda2b5dc6bd9b6228e2cf540c7 [2024-10-11 14:12:49,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:12:49,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:12:49,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:12:49,241 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:12:49,241 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:12:49,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2024-10-11 14:12:50,462 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:12:50,651 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:12:50,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2024-10-11 14:12:50,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8e6e58544/6c97ad39b7e04b9d840bd815b9c39a74/FLAGb17425f87 [2024-10-11 14:12:51,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8e6e58544/6c97ad39b7e04b9d840bd815b9c39a74 [2024-10-11 14:12:51,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:12:51,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:12:51,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:12:51,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:12:51,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:12:51,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:12:51" (1/1) ... [2024-10-11 14:12:51,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cdb04b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:51, skipping insertion in model container [2024-10-11 14:12:51,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:12:51" (1/1) ... [2024-10-11 14:12:51,055 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:12:51,307 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/39_rand_lock_p0_vs.i[30959,30972] [2024-10-11 14:12:51,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:12:51,321 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:12:51,363 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/39_rand_lock_p0_vs.i[30959,30972] [2024-10-11 14:12:51,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:12:51,425 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:12:51,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:51 WrapperNode [2024-10-11 14:12:51,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:12:51,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:12:51,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:12:51,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:12:51,433 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:51" (1/1) ... [2024-10-11 14:12:51,445 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:51" (1/1) ... [2024-10-11 14:12:51,466 INFO L138 Inliner]: procedures = 174, calls = 17, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 72 [2024-10-11 14:12:51,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:12:51,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:12:51,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:12:51,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:12:51,477 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:51" (1/1) ... [2024-10-11 14:12:51,477 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:51" (1/1) ... [2024-10-11 14:12:51,481 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:51" (1/1) ... [2024-10-11 14:12:51,496 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 14:12:51,496 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:51" (1/1) ... [2024-10-11 14:12:51,497 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:51" (1/1) ... [2024-10-11 14:12:51,499 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:51" (1/1) ... [2024-10-11 14:12:51,506 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:51" (1/1) ... [2024-10-11 14:12:51,506 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:51" (1/1) ... [2024-10-11 14:12:51,507 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:51" (1/1) ... [2024-10-11 14:12:51,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:12:51,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:12:51,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:12:51,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:12:51,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:51" (1/1) ... [2024-10-11 14:12:51,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:12:51,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:12:51,547 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:51,550 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:51,612 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-11 14:12:51,612 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-11 14:12:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 14:12:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:12:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:12:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 14:12:51,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:12:51,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:12:51,616 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:51,721 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:12:51,722 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:12:51,821 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:12:51,821 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:12:51,904 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:12:51,904 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 14:12:51,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:12:51 BoogieIcfgContainer [2024-10-11 14:12:51,905 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:12:51,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:12:51,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:12:51,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:12:51,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:12:51" (1/3) ... [2024-10-11 14:12:51,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b43a135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:12:51, skipping insertion in model container [2024-10-11 14:12:51,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:51" (2/3) ... [2024-10-11 14:12:51,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b43a135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:12:51, skipping insertion in model container [2024-10-11 14:12:51,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:12:51" (3/3) ... [2024-10-11 14:12:51,913 INFO L112 eAbstractionObserver]: Analyzing ICFG 39_rand_lock_p0_vs.i [2024-10-11 14:12:51,925 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:12:51,926 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:12:51,926 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:12:51,963 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:12:51,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 42 flow [2024-10-11 14:12:52,007 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2024-10-11 14:12:52,007 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:12:52,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 21 events. 2/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 19 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2024-10-11 14:12:52,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 19 transitions, 42 flow [2024-10-11 14:12:52,011 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 19 transitions, 42 flow [2024-10-11 14:12:52,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:12:52,025 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;@4fcfbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:12:52,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-11 14:12:52,028 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:12:52,028 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-10-11 14:12:52,028 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:12:52,028 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:52,029 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 14:12:52,029 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:12:52,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:52,032 INFO L85 PathProgramCache]: Analyzing trace with hash 221356606, now seen corresponding path program 1 times [2024-10-11 14:12:52,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:52,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928287710] [2024-10-11 14:12:52,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:52,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:52,223 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:52,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:52,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928287710] [2024-10-11 14:12:52,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928287710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:52,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:52,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 14:12:52,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987607731] [2024-10-11 14:12:52,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:52,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:12:52,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:52,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:12:52,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:12:52,257 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-10-11 14:12:52,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:52,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:52,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-10-11 14:12:52,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:52,290 INFO L124 PetriNetUnfolderBase]: 21/58 cut-off events. [2024-10-11 14:12:52,291 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:12:52,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 58 events. 21/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 94 event pairs, 12 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 100. Up to 35 conditions per place. [2024-10-11 14:12:52,297 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 13 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2024-10-11 14:12:52,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 18 transitions, 70 flow [2024-10-11 14:12:52,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:12:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:12:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2024-10-11 14:12:52,308 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2024-10-11 14:12:52,309 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 42 flow. Second operand 3 states and 28 transitions. [2024-10-11 14:12:52,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 18 transitions, 70 flow [2024-10-11 14:12:52,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 18 transitions, 70 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 14:12:52,312 INFO L231 Difference]: Finished difference. Result has 20 places, 16 transitions, 40 flow [2024-10-11 14:12:52,314 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=20, PETRI_TRANSITIONS=16} [2024-10-11 14:12:52,316 INFO L277 CegarLoopForPetriNet]: 20 programPoint places, 0 predicate places. [2024-10-11 14:12:52,316 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 16 transitions, 40 flow [2024-10-11 14:12:52,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:52,317 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:52,317 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-10-11 14:12:52,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:12:52,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:12:52,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:52,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1727888453, now seen corresponding path program 1 times [2024-10-11 14:12:52,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:52,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714928490] [2024-10-11 14:12:52,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:52,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:52,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:12:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:52,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:12:52,354 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:12:52,356 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-10-11 14:12:52,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-10-11 14:12:52,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-10-11 14:12:52,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:12:52,358 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 14:12:52,359 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 14:12:52,360 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 14:12:52,382 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:12:52,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 76 flow [2024-10-11 14:12:52,393 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2024-10-11 14:12:52,394 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 14:12:52,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 38 events. 4/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 68 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2024-10-11 14:12:52,395 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 76 flow [2024-10-11 14:12:52,395 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 33 transitions, 76 flow [2024-10-11 14:12:52,396 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:12:52,397 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;@4fcfbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:12:52,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 14:12:52,400 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:12:52,400 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-10-11 14:12:52,401 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 14:12:52,401 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:52,401 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 14:12:52,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 14:12:52,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:52,401 INFO L85 PathProgramCache]: Analyzing trace with hash 252861580, now seen corresponding path program 1 times [2024-10-11 14:12:52,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:52,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439124139] [2024-10-11 14:12:52,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:52,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:52,456 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:52,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:52,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439124139] [2024-10-11 14:12:52,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439124139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:52,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:52,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 14:12:52,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818342435] [2024-10-11 14:12:52,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:52,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:12:52,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:52,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:12:52,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:12:52,462 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-10-11 14:12:52,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:52,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:52,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-10-11 14:12:52,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:52,673 INFO L124 PetriNetUnfolderBase]: 525/911 cut-off events. [2024-10-11 14:12:52,674 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-10-11 14:12:52,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1789 conditions, 911 events. 525/911 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3660 event pairs, 252 based on Foata normal form. 0/857 useless extension candidates. Maximal degree in co-relation 1262. Up to 451 conditions per place. [2024-10-11 14:12:52,685 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 39 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2024-10-11 14:12:52,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 193 flow [2024-10-11 14:12:52,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:12:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:12:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2024-10-11 14:12:52,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6565656565656566 [2024-10-11 14:12:52,691 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 76 flow. Second operand 3 states and 65 transitions. [2024-10-11 14:12:52,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 193 flow [2024-10-11 14:12:52,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 193 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 14:12:52,694 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 91 flow [2024-10-11 14:12:52,694 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2024-10-11 14:12:52,696 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2024-10-11 14:12:52,696 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 91 flow [2024-10-11 14:12:52,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:52,696 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:52,697 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2024-10-11 14:12:52,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:12:52,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 14:12:52,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:52,698 INFO L85 PathProgramCache]: Analyzing trace with hash 672243337, now seen corresponding path program 1 times [2024-10-11 14:12:52,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:52,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647300532] [2024-10-11 14:12:52,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:52,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:52,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:12:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:52,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:12:52,720 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:12:52,720 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-10-11 14:12:52,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-10-11 14:12:52,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-10-11 14:12:52,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-10-11 14:12:52,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:12:52,721 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 14:12:52,722 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 14:12:52,722 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 14:12:52,743 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:12:52,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 47 transitions, 112 flow [2024-10-11 14:12:52,750 INFO L124 PetriNetUnfolderBase]: 6/55 cut-off events. [2024-10-11 14:12:52,750 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 14:12:52,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 6/55 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 123 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2024-10-11 14:12:52,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 47 transitions, 112 flow [2024-10-11 14:12:52,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 47 transitions, 112 flow [2024-10-11 14:12:52,752 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:12:52,753 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;@4fcfbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:12:52,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-11 14:12:52,755 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:12:52,755 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-10-11 14:12:52,756 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 14:12:52,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:52,756 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 14:12:52,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 14:12:52,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash 297726408, now seen corresponding path program 1 times [2024-10-11 14:12:52,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:52,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916425571] [2024-10-11 14:12:52,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:52,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:52,782 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:52,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:52,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916425571] [2024-10-11 14:12:52,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916425571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:52,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:52,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 14:12:52,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21781784] [2024-10-11 14:12:52,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:52,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:12:52,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:52,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:12:52,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:12:52,792 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2024-10-11 14:12:52,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:52,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:52,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2024-10-11 14:12:52,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:53,726 INFO L124 PetriNetUnfolderBase]: 9048/13148 cut-off events. [2024-10-11 14:12:53,726 INFO L125 PetriNetUnfolderBase]: For 716/716 co-relation queries the response was YES. [2024-10-11 14:12:53,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26250 conditions, 13148 events. 9048/13148 cut-off events. For 716/716 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 70107 event pairs, 3549 based on Foata normal form. 0/12344 useless extension candidates. Maximal degree in co-relation 6698. Up to 8869 conditions per place. [2024-10-11 14:12:53,810 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 57 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2024-10-11 14:12:53,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 288 flow [2024-10-11 14:12:53,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:12:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:12:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-10-11 14:12:53,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-10-11 14:12:53,812 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 112 flow. Second operand 3 states and 93 transitions. [2024-10-11 14:12:53,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 288 flow [2024-10-11 14:12:53,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 284 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-10-11 14:12:53,816 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 132 flow [2024-10-11 14:12:53,816 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-10-11 14:12:53,816 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2024-10-11 14:12:53,816 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 132 flow [2024-10-11 14:12:53,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:53,817 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:53,817 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2024-10-11 14:12:53,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:12:53,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 14:12:53,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:53,817 INFO L85 PathProgramCache]: Analyzing trace with hash -554104934, now seen corresponding path program 1 times [2024-10-11 14:12:53,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:53,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358353301] [2024-10-11 14:12:53,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:53,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:53,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:12:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:53,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:12:53,842 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:12:53,842 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-11 14:12:53,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-10-11 14:12:53,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-10-11 14:12:53,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-10-11 14:12:53,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-10-11 14:12:53,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:12:53,843 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 14:12:53,843 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 14:12:53,843 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-11 14:12:53,873 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:12:53,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 61 transitions, 150 flow [2024-10-11 14:12:53,882 INFO L124 PetriNetUnfolderBase]: 8/72 cut-off events. [2024-10-11 14:12:53,882 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-11 14:12:53,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 72 events. 8/72 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 179 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 67. Up to 5 conditions per place. [2024-10-11 14:12:53,883 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 61 transitions, 150 flow [2024-10-11 14:12:53,883 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 61 transitions, 150 flow [2024-10-11 14:12:53,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:12:53,885 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;@4fcfbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:12:53,885 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 14:12:53,888 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:12:53,888 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-10-11 14:12:53,888 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 14:12:53,888 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:53,888 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 14:12:53,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-11 14:12:53,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:53,889 INFO L85 PathProgramCache]: Analyzing trace with hash 355951922, now seen corresponding path program 1 times [2024-10-11 14:12:53,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:53,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179836889] [2024-10-11 14:12:53,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:53,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:53,915 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:53,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:53,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179836889] [2024-10-11 14:12:53,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179836889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:53,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:53,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 14:12:53,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311776166] [2024-10-11 14:12:53,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:53,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:12:53,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:53,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:12:53,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:12:53,922 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 61 [2024-10-11 14:12:53,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:53,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:53,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 61 [2024-10-11 14:12:53,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:13:03,556 INFO L124 PetriNetUnfolderBase]: 138114/182648 cut-off events. [2024-10-11 14:13:03,556 INFO L125 PetriNetUnfolderBase]: For 13073/13073 co-relation queries the response was YES. [2024-10-11 14:13:03,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367995 conditions, 182648 events. 138114/182648 cut-off events. For 13073/13073 co-relation queries the response was YES. Maximal size of possible extension queue 3636. Compared 1116419 event pairs, 45867 based on Foata normal form. 0/170309 useless extension candidates. Maximal degree in co-relation 33284. Up to 145462 conditions per place. [2024-10-11 14:13:04,670 INFO L140 encePairwiseOnDemand]: 47/61 looper letters, 75 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2024-10-11 14:13:04,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 89 transitions, 387 flow [2024-10-11 14:13:04,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:13:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:13:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2024-10-11 14:13:04,676 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6612021857923497 [2024-10-11 14:13:04,676 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 150 flow. Second operand 3 states and 121 transitions. [2024-10-11 14:13:04,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 89 transitions, 387 flow [2024-10-11 14:13:04,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 89 transitions, 375 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-10-11 14:13:04,692 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 173 flow [2024-10-11 14:13:04,692 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2024-10-11 14:13:04,693 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2024-10-11 14:13:04,693 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 173 flow [2024-10-11 14:13:04,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:13:04,693 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:13:04,693 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2024-10-11 14:13:04,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:13:04,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-11 14:13:04,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:13:04,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2064227278, now seen corresponding path program 1 times [2024-10-11 14:13:04,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:13:04,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226916998] [2024-10-11 14:13:04,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:13:04,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:13:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:13:04,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:13:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:13:04,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:13:04,723 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:13:04,723 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-10-11 14:13:04,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-10-11 14:13:04,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-10-11 14:13:04,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-10-11 14:13:04,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-10-11 14:13:04,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-10-11 14:13:04,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:13:04,724 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 14:13:04,725 WARN L239 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 14:13:04,725 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-10-11 14:13:04,756 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:13:04,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 75 transitions, 190 flow [2024-10-11 14:13:04,762 INFO L124 PetriNetUnfolderBase]: 10/89 cut-off events. [2024-10-11 14:13:04,763 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-10-11 14:13:04,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 89 events. 10/89 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 231 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 90. Up to 6 conditions per place. [2024-10-11 14:13:04,764 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 75 transitions, 190 flow [2024-10-11 14:13:04,764 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 75 transitions, 190 flow [2024-10-11 14:13:04,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:13:04,767 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;@4fcfbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:13:04,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-11 14:13:04,771 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:13:04,771 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-10-11 14:13:04,771 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:13:04,771 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:13:04,771 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 14:13:04,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 14:13:04,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:13:04,771 INFO L85 PathProgramCache]: Analyzing trace with hash 427536874, now seen corresponding path program 1 times [2024-10-11 14:13:04,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:13:04,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370438033] [2024-10-11 14:13:04,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:13:04,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:13:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:13:04,794 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:13:04,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:13:04,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370438033] [2024-10-11 14:13:04,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370438033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:13:04,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:13:04,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 14:13:04,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532515841] [2024-10-11 14:13:04,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:13:04,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:13:04,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:13:04,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:13:04,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:13:04,804 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 75 [2024-10-11 14:13:04,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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:13:04,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:13:04,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 75 [2024-10-11 14:13:04,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand