./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/11_fmaxsymopt.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/11_fmaxsymopt.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 6d4b02aa42f7b4e354f6555c82b5caeb47836d867813f6f1b24237fc4ad268ae --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:11:17,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:11:17,958 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:11:17,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:11:17,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:11:17,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:11:17,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:11:17,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:11:17,999 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:11:18,001 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:11:18,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:11:18,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:11:18,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:11:18,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:11:18,004 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:11:18,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:11:18,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:11:18,005 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:11:18,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:11:18,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:11:18,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:11:18,008 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:11:18,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:11:18,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:11:18,008 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:11:18,009 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:11:18,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:11:18,009 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:11:18,009 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:11:18,009 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:11:18,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:11:18,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:11:18,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:11:18,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:11:18,010 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:11:18,011 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:11:18,011 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:11:18,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:11:18,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:11:18,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:11:18,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:11:18,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:11:18,013 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 -> 6d4b02aa42f7b4e354f6555c82b5caeb47836d867813f6f1b24237fc4ad268ae [2024-10-11 14:11:18,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:11:18,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:11:18,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:11:18,322 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:11:18,322 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:11:18,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2024-10-11 14:11:19,719 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:11:20,087 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:11:20,089 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2024-10-11 14:11:20,106 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/83b20d222/aaa031dd29134cafaf97343cdd775663/FLAG24c2516aa [2024-10-11 14:11:20,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/83b20d222/aaa031dd29134cafaf97343cdd775663 [2024-10-11 14:11:20,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:11:20,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:11:20,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:11:20,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:11:20,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:11:20,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:11:20" (1/1) ... [2024-10-11 14:11:20,141 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@418f5939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:20, skipping insertion in model container [2024-10-11 14:11:20,141 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:11:20" (1/1) ... [2024-10-11 14:11:20,189 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:11:20,537 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/11_fmaxsymopt.i[30570,30583] [2024-10-11 14:11:20,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:11:20,565 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:11:20,629 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/11_fmaxsymopt.i[30570,30583] [2024-10-11 14:11:20,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:11:20,679 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:11:20,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:20 WrapperNode [2024-10-11 14:11:20,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:11:20,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:11:20,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:11:20,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:11:20,689 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:11:20" (1/1) ... [2024-10-11 14:11:20,706 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:11:20" (1/1) ... [2024-10-11 14:11:20,734 INFO L138 Inliner]: procedures = 170, calls = 24, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 106 [2024-10-11 14:11:20,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:11:20,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:11:20,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:11:20,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:11:20,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:20" (1/1) ... [2024-10-11 14:11:20,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:20" (1/1) ... [2024-10-11 14:11:20,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:20" (1/1) ... [2024-10-11 14:11:20,765 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 1 writes are split as follows [0, 1]. [2024-10-11 14:11:20,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:20" (1/1) ... [2024-10-11 14:11:20,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:20" (1/1) ... [2024-10-11 14:11:20,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:20" (1/1) ... [2024-10-11 14:11:20,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:20" (1/1) ... [2024-10-11 14:11:20,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:20" (1/1) ... [2024-10-11 14:11:20,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:20" (1/1) ... [2024-10-11 14:11:20,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:11:20,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:11:20,780 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:11:20,781 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:11:20,781 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:20" (1/1) ... [2024-10-11 14:11:20,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:11:20,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:11:20,820 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:11:20,823 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:11:20,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:11:20,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:11:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-11 14:11:20,873 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-11 14:11:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:11:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:11:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:11:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:11:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:11:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:11:20,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:11:20,876 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:11:21,016 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:11:21,019 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:11:21,239 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:11:21,240 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:11:21,400 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:11:21,400 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 14:11:21,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:11:21 BoogieIcfgContainer [2024-10-11 14:11:21,401 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:11:21,403 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:11:21,403 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:11:21,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:11:21,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:11:20" (1/3) ... [2024-10-11 14:11:21,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35caeb4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:11:21, skipping insertion in model container [2024-10-11 14:11:21,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:20" (2/3) ... [2024-10-11 14:11:21,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35caeb4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:11:21, skipping insertion in model container [2024-10-11 14:11:21,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:11:21" (3/3) ... [2024-10-11 14:11:21,413 INFO L112 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2024-10-11 14:11:21,436 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:11:21,437 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:11:21,437 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:11:21,482 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:11:21,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 23 transitions, 50 flow [2024-10-11 14:11:21,543 INFO L124 PetriNetUnfolderBase]: 4/25 cut-off events. [2024-10-11 14:11:21,544 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:11:21,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 25 events. 4/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2024-10-11 14:11:21,547 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 23 transitions, 50 flow [2024-10-11 14:11:21,552 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 23 transitions, 50 flow [2024-10-11 14:11:21,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:11:21,572 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;@38b6f439, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:11:21,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-11 14:11:21,583 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:11:21,583 INFO L124 PetriNetUnfolderBase]: 2/13 cut-off events. [2024-10-11 14:11:21,583 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:11:21,584 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:21,584 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 14:11:21,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:11:21,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:21,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1300280328, now seen corresponding path program 1 times [2024-10-11 14:11:21,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:21,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121746762] [2024-10-11 14:11:21,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:21,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:21,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:11:21,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:11:21,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121746762] [2024-10-11 14:11:21,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121746762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:11:21,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:11:21,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:11:21,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641877886] [2024-10-11 14:11:21,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:11:21,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:11:21,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:11:21,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:11:21,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:11:21,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2024-10-11 14:11:21,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 23 transitions, 50 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:11:21,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:11:21,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2024-10-11 14:11:21,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:11:22,015 INFO L124 PetriNetUnfolderBase]: 25/69 cut-off events. [2024-10-11 14:11:22,015 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:11:22,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 69 events. 25/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 145 event pairs, 18 based on Foata normal form. 3/65 useless extension candidates. Maximal degree in co-relation 112. Up to 56 conditions per place. [2024-10-11 14:11:22,024 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 15 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2024-10-11 14:11:22,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 22 transitions, 82 flow [2024-10-11 14:11:22,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:11:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:11:22,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2024-10-11 14:11:22,082 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2024-10-11 14:11:22,084 INFO L175 Difference]: Start difference. First operand has 22 places, 23 transitions, 50 flow. Second operand 3 states and 35 transitions. [2024-10-11 14:11:22,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 22 transitions, 82 flow [2024-10-11 14:11:22,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 22 transitions, 82 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 14:11:22,091 INFO L231 Difference]: Finished difference. Result has 24 places, 22 transitions, 58 flow [2024-10-11 14:11:22,093 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=24, PETRI_TRANSITIONS=22} [2024-10-11 14:11:22,097 INFO L277 CegarLoopForPetriNet]: 22 programPoint places, 2 predicate places. [2024-10-11 14:11:22,098 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 22 transitions, 58 flow [2024-10-11 14:11:22,098 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:11:22,098 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:22,098 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-11 14:11:22,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:11:22,099 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:11:22,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:22,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2062893396, now seen corresponding path program 1 times [2024-10-11 14:11:22,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:22,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225530875] [2024-10-11 14:11:22,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:22,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:22,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:11:22,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:11:22,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225530875] [2024-10-11 14:11:22,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225530875] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:11:22,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343597264] [2024-10-11 14:11:22,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:22,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:11:22,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:11:22,182 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:11:22,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:11:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:22,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 14:11:22,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:11:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:11:22,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:11:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:11:22,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343597264] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:11:22,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:11:22,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-11 14:11:22,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419332600] [2024-10-11 14:11:22,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:11:22,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:11:22,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:11:22,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:11:22,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:11:22,328 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2024-10-11 14:11:22,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 22 transitions, 58 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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:11:22,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:11:22,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2024-10-11 14:11:22,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:11:22,435 INFO L124 PetriNetUnfolderBase]: 25/72 cut-off events. [2024-10-11 14:11:22,435 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:11:22,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 72 events. 25/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 145 event pairs, 18 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 134. Up to 56 conditions per place. [2024-10-11 14:11:22,436 INFO L140 encePairwiseOnDemand]: 20/23 looper letters, 15 selfloop transitions, 5 changer transitions 0/25 dead transitions. [2024-10-11 14:11:22,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 25 transitions, 110 flow [2024-10-11 14:11:22,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:11:22,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:11:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2024-10-11 14:11:22,438 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38405797101449274 [2024-10-11 14:11:22,438 INFO L175 Difference]: Start difference. First operand has 24 places, 22 transitions, 58 flow. Second operand 6 states and 53 transitions. [2024-10-11 14:11:22,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 25 transitions, 110 flow [2024-10-11 14:11:22,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 106 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-11 14:11:22,440 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 90 flow [2024-10-11 14:11:22,440 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-10-11 14:11:22,440 INFO L277 CegarLoopForPetriNet]: 22 programPoint places, 9 predicate places. [2024-10-11 14:11:22,441 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 90 flow [2024-10-11 14:11:22,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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:11:22,441 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:22,441 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2024-10-11 14:11:22,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:11:22,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:11:22,646 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:11:22,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:22,647 INFO L85 PathProgramCache]: Analyzing trace with hash 452969208, now seen corresponding path program 2 times [2024-10-11 14:11:22,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:22,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870074539] [2024-10-11 14:11:22,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:22,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:11:22,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:11:22,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870074539] [2024-10-11 14:11:22,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870074539] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:11:22,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250862544] [2024-10-11 14:11:22,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:11:22,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:11:22,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:11:22,823 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:11:22,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:11:22,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:11:22,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:11:22,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 14:11:22,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:11:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:11:22,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:11:22,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:11:22,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250862544] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:11:22,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:11:22,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-10-11 14:11:22,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300441506] [2024-10-11 14:11:22,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:11:22,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:11:22,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:11:22,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:11:22,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:11:22,955 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2024-10-11 14:11:22,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 90 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:11:22,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:11:22,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2024-10-11 14:11:22,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:11:23,036 INFO L124 PetriNetUnfolderBase]: 25/74 cut-off events. [2024-10-11 14:11:23,036 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-11 14:11:23,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 74 events. 25/74 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 145 event pairs, 18 based on Foata normal form. 2/70 useless extension candidates. Maximal degree in co-relation 125. Up to 56 conditions per place. [2024-10-11 14:11:23,037 INFO L140 encePairwiseOnDemand]: 20/23 looper letters, 15 selfloop transitions, 7 changer transitions 0/27 dead transitions. [2024-10-11 14:11:23,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 146 flow [2024-10-11 14:11:23,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:11:23,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 14:11:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2024-10-11 14:11:23,042 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.34782608695652173 [2024-10-11 14:11:23,042 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 90 flow. Second operand 8 states and 64 transitions. [2024-10-11 14:11:23,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 146 flow [2024-10-11 14:11:23,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 132 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-10-11 14:11:23,044 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 112 flow [2024-10-11 14:11:23,044 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=112, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2024-10-11 14:11:23,047 INFO L277 CegarLoopForPetriNet]: 22 programPoint places, 17 predicate places. [2024-10-11 14:11:23,047 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 112 flow [2024-10-11 14:11:23,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:11:23,047 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:23,047 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 2, 1, 1, 1, 1, 1] [2024-10-11 14:11:23,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 14:11:23,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:11:23,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:11:23,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:23,249 INFO L85 PathProgramCache]: Analyzing trace with hash 192720504, now seen corresponding path program 3 times [2024-10-11 14:11:23,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:23,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536396592] [2024-10-11 14:11:23,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:23,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:11:23,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:11:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:11:23,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:11:23,317 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:11:23,318 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-10-11 14:11:23,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-10-11 14:11:23,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-10-11 14:11:23,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:11:23,321 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-11 14:11:23,323 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 14:11:23,323 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 14:11:23,343 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:11:23,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 39 transitions, 88 flow [2024-10-11 14:11:23,353 INFO L124 PetriNetUnfolderBase]: 7/44 cut-off events. [2024-10-11 14:11:23,353 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 14:11:23,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 44 events. 7/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 101 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 33. Up to 3 conditions per place. [2024-10-11 14:11:23,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 39 transitions, 88 flow [2024-10-11 14:11:23,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 39 transitions, 88 flow [2024-10-11 14:11:23,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:11:23,358 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;@38b6f439, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:11:23,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 14:11:23,366 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:11:23,367 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2024-10-11 14:11:23,367 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 14:11:23,368 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:23,368 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:11:23,368 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:11:23,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:23,369 INFO L85 PathProgramCache]: Analyzing trace with hash -982383914, now seen corresponding path program 1 times [2024-10-11 14:11:23,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:23,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294072753] [2024-10-11 14:11:23,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:23,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:23,432 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:11:23,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:11:23,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294072753] [2024-10-11 14:11:23,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294072753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:11:23,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:11:23,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:11:23,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715486328] [2024-10-11 14:11:23,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:11:23,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:11:23,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:11:23,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:11:23,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:11:23,435 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-10-11 14:11:23,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:11:23,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:11:23,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-10-11 14:11:23,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:11:23,658 INFO L124 PetriNetUnfolderBase]: 553/1026 cut-off events. [2024-10-11 14:11:23,659 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-10-11 14:11:23,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 1026 events. 553/1026 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4732 event pairs, 468 based on Foata normal form. 95/1006 useless extension candidates. Maximal degree in co-relation 1168. Up to 866 conditions per place. [2024-10-11 14:11:23,672 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 26 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2024-10-11 14:11:23,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 140 flow [2024-10-11 14:11:23,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:11:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:11:23,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-10-11 14:11:23,675 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5042735042735043 [2024-10-11 14:11:23,675 INFO L175 Difference]: Start difference. First operand has 37 places, 39 transitions, 88 flow. Second operand 3 states and 59 transitions. [2024-10-11 14:11:23,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 140 flow [2024-10-11 14:11:23,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 14:11:23,677 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 94 flow [2024-10-11 14:11:23,677 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2024-10-11 14:11:23,678 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2024-10-11 14:11:23,678 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 94 flow [2024-10-11 14:11:23,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:11:23,678 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:23,678 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:11:23,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:11:23,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 14:11:23,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:23,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1574460895, now seen corresponding path program 1 times [2024-10-11 14:11:23,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:23,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350118313] [2024-10-11 14:11:23,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:23,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:11:23,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:11:23,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350118313] [2024-10-11 14:11:23,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350118313] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:11:23,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516434050] [2024-10-11 14:11:23,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:23,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:11:23,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:11:23,751 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:11:23,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 14:11:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:23,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 14:11:23,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:11:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:11:23,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:11:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:11:23,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516434050] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:11:23,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:11:23,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-11 14:11:23,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014427595] [2024-10-11 14:11:23,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:11:23,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:11:23,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:11:23,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:11:23,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:11:23,862 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-10-11 14:11:23,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 94 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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:11:23,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:11:23,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-10-11 14:11:23,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:11:24,047 INFO L124 PetriNetUnfolderBase]: 553/1029 cut-off events. [2024-10-11 14:11:24,048 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-10-11 14:11:24,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1944 conditions, 1029 events. 553/1029 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4732 event pairs, 468 based on Foata normal form. 0/914 useless extension candidates. Maximal degree in co-relation 1931. Up to 866 conditions per place. [2024-10-11 14:11:24,054 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 26 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2024-10-11 14:11:24,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 168 flow [2024-10-11 14:11:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:11:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:11:24,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-10-11 14:11:24,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37606837606837606 [2024-10-11 14:11:24,056 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 94 flow. Second operand 6 states and 88 transitions. [2024-10-11 14:11:24,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 168 flow [2024-10-11 14:11:24,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 164 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-11 14:11:24,058 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 126 flow [2024-10-11 14:11:24,058 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2024-10-11 14:11:24,058 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2024-10-11 14:11:24,059 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 126 flow [2024-10-11 14:11:24,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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:11:24,059 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:24,059 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:11:24,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 14:11:24,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:11:24,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 14:11:24,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:24,265 INFO L85 PathProgramCache]: Analyzing trace with hash 361037206, now seen corresponding path program 2 times [2024-10-11 14:11:24,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:24,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305607217] [2024-10-11 14:11:24,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:24,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:11:24,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:11:24,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305607217] [2024-10-11 14:11:24,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305607217] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:11:24,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345134681] [2024-10-11 14:11:24,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:11:24,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:11:24,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:11:24,376 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:11:24,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 14:11:24,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 14:11:24,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:11:24,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 14:11:24,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:11:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 14:11:24,472 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:11:24,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345134681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:11:24,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 14:11:24,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-11 14:11:24,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130561043] [2024-10-11 14:11:24,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:11:24,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:11:24,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:11:24,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:11:24,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:11:24,479 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-10-11 14:11:24,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 126 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:11:24,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:11:24,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-10-11 14:11:24,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:11:24,703 INFO L124 PetriNetUnfolderBase]: 951/1747 cut-off events. [2024-10-11 14:11:24,703 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-10-11 14:11:24,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3331 conditions, 1747 events. 951/1747 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9306 event pairs, 418 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 3296. Up to 784 conditions per place. [2024-10-11 14:11:24,716 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 50 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-10-11 14:11:24,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 60 transitions, 275 flow [2024-10-11 14:11:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:11:24,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:11:24,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-10-11 14:11:24,717 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6239316239316239 [2024-10-11 14:11:24,718 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 126 flow. Second operand 3 states and 73 transitions. [2024-10-11 14:11:24,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 60 transitions, 275 flow [2024-10-11 14:11:24,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 261 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-10-11 14:11:24,720 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 126 flow [2024-10-11 14:11:24,720 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2024-10-11 14:11:24,722 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2024-10-11 14:11:24,723 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 126 flow [2024-10-11 14:11:24,723 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:11:24,723 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:24,724 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2024-10-11 14:11:24,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 14:11:24,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-11 14:11:24,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 14:11:24,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:24,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1858755249, now seen corresponding path program 1 times [2024-10-11 14:11:24,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:24,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097925379] [2024-10-11 14:11:24,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:24,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 14:11:25,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:11:25,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097925379] [2024-10-11 14:11:25,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097925379] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:11:25,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198966996] [2024-10-11 14:11:25,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:25,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:11:25,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:11:25,042 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:11:25,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 14:11:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:25,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 14:11:25,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:11:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 14:11:25,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:11:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 14:11:25,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198966996] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:11:25,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:11:25,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-10-11 14:11:25,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735054433] [2024-10-11 14:11:25,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:11:25,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:11:25,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:11:25,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:11:25,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:11:25,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-10-11 14:11:25,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 126 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:11:25,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:11:25,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-10-11 14:11:25,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:11:25,429 INFO L124 PetriNetUnfolderBase]: 966/1792 cut-off events. [2024-10-11 14:11:25,429 INFO L125 PetriNetUnfolderBase]: For 266/266 co-relation queries the response was YES. [2024-10-11 14:11:25,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3575 conditions, 1792 events. 966/1792 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9539 event pairs, 818 based on Foata normal form. 2/1650 useless extension candidates. Maximal degree in co-relation 3537. Up to 1501 conditions per place. [2024-10-11 14:11:25,442 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 28 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-10-11 14:11:25,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 208 flow [2024-10-11 14:11:25,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:11:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 14:11:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-10-11 14:11:25,445 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.34294871794871795 [2024-10-11 14:11:25,445 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 126 flow. Second operand 8 states and 107 transitions. [2024-10-11 14:11:25,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 208 flow [2024-10-11 14:11:25,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:11:25,451 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 158 flow [2024-10-11 14:11:25,452 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=158, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2024-10-11 14:11:25,453 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2024-10-11 14:11:25,453 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 158 flow [2024-10-11 14:11:25,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:11:25,453 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:25,453 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1] [2024-10-11 14:11:25,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 14:11:25,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:11:25,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 14:11:25,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:25,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2012022447, now seen corresponding path program 2 times [2024-10-11 14:11:25,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:25,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535359013] [2024-10-11 14:11:25,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:25,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:11:25,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:11:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:11:25,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:11:25,716 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:11:25,717 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-10-11 14:11:25,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-10-11 14:11:25,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-10-11 14:11:25,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-10-11 14:11:25,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:11:25,717 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1] [2024-10-11 14:11:25,718 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 14:11:25,718 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 14:11:25,749 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:11:25,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 55 transitions, 128 flow [2024-10-11 14:11:25,759 INFO L124 PetriNetUnfolderBase]: 10/63 cut-off events. [2024-10-11 14:11:25,759 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 14:11:25,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 10/63 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 163 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2024-10-11 14:11:25,759 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 55 transitions, 128 flow [2024-10-11 14:11:25,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 55 transitions, 128 flow [2024-10-11 14:11:25,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:11:25,765 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;@38b6f439, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:11:25,765 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-11 14:11:25,767 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:11:25,768 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2024-10-11 14:11:25,768 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 14:11:25,768 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:25,768 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:11:25,768 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:11:25,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:25,769 INFO L85 PathProgramCache]: Analyzing trace with hash -703058203, now seen corresponding path program 1 times [2024-10-11 14:11:25,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:25,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430792997] [2024-10-11 14:11:25,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:25,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:25,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:11:25,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:11:25,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430792997] [2024-10-11 14:11:25,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430792997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:11:25,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:11:25,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:11:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467745937] [2024-10-11 14:11:25,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:11:25,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:11:25,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:11:25,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:11:25,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:11:25,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 55 [2024-10-11 14:11:25,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:11:25,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:11:25,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 55 [2024-10-11 14:11:25,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:11:26,874 INFO L124 PetriNetUnfolderBase]: 8815/13572 cut-off events. [2024-10-11 14:11:26,874 INFO L125 PetriNetUnfolderBase]: For 700/700 co-relation queries the response was YES. [2024-10-11 14:11:26,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25975 conditions, 13572 events. 8815/13572 cut-off events. For 700/700 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 81305 event pairs, 7668 based on Foata normal form. 1610/13657 useless extension candidates. Maximal degree in co-relation 5896. Up to 11966 conditions per place. [2024-10-11 14:11:26,956 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 37 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-10-11 14:11:26,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 200 flow [2024-10-11 14:11:26,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:11:26,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:11:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-10-11 14:11:26,958 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.503030303030303 [2024-10-11 14:11:26,958 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 128 flow. Second operand 3 states and 83 transitions. [2024-10-11 14:11:26,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 200 flow [2024-10-11 14:11:26,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 198 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-11 14:11:26,961 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 130 flow [2024-10-11 14:11:26,961 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2024-10-11 14:11:26,961 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2024-10-11 14:11:26,962 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 130 flow [2024-10-11 14:11:26,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:11:26,962 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:26,962 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:11:26,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:11:26,962 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 14:11:26,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:26,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1920882841, now seen corresponding path program 1 times [2024-10-11 14:11:26,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:26,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106175292] [2024-10-11 14:11:26,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:26,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:11:26,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:11:26,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106175292] [2024-10-11 14:11:26,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106175292] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:11:26,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73718088] [2024-10-11 14:11:26,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:26,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:11:26,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:11:26,998 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:11:27,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 14:11:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:27,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 14:11:27,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:11:27,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:11:27,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:11:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:11:27,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73718088] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:11:27,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:11:27,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-11 14:11:27,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518346452] [2024-10-11 14:11:27,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:11:27,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:11:27,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:11:27,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:11:27,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:11:27,093 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 55 [2024-10-11 14:11:27,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 130 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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:11:27,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:11:27,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 55 [2024-10-11 14:11:27,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:11:28,218 INFO L124 PetriNetUnfolderBase]: 8815/13575 cut-off events. [2024-10-11 14:11:28,218 INFO L125 PetriNetUnfolderBase]: For 404/404 co-relation queries the response was YES. [2024-10-11 14:11:28,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25891 conditions, 13575 events. 8815/13575 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 81278 event pairs, 7668 based on Foata normal form. 0/12050 useless extension candidates. Maximal degree in co-relation 25877. Up to 11966 conditions per place. [2024-10-11 14:11:28,308 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 37 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2024-10-11 14:11:28,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 226 flow [2024-10-11 14:11:28,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:11:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:11:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-10-11 14:11:28,310 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2024-10-11 14:11:28,310 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 130 flow. Second operand 6 states and 123 transitions. [2024-10-11 14:11:28,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 226 flow [2024-10-11 14:11:28,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 55 transitions, 222 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-11 14:11:28,313 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 162 flow [2024-10-11 14:11:28,313 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2024-10-11 14:11:28,313 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2024-10-11 14:11:28,314 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 162 flow [2024-10-11 14:11:28,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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:11:28,314 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:28,314 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:11:28,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 14:11:28,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 14:11:28,515 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 14:11:28,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:28,516 INFO L85 PathProgramCache]: Analyzing trace with hash 552812389, now seen corresponding path program 2 times [2024-10-11 14:11:28,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:28,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972972003] [2024-10-11 14:11:28,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:28,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 14:11:28,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:11:28,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972972003] [2024-10-11 14:11:28,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972972003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:11:28,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:11:28,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:11:28,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207860889] [2024-10-11 14:11:28,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:11:28,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:11:28,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:11:28,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:11:28,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:11:28,601 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-10-11 14:11:28,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:11:28,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:11:28,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-10-11 14:11:28,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:11:30,171 INFO L124 PetriNetUnfolderBase]: 15165/23116 cut-off events. [2024-10-11 14:11:30,171 INFO L125 PetriNetUnfolderBase]: For 627/627 co-relation queries the response was YES. [2024-10-11 14:11:30,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44381 conditions, 23116 events. 15165/23116 cut-off events. For 627/627 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 151294 event pairs, 6868 based on Foata normal form. 0/20536 useless extension candidates. Maximal degree in co-relation 44345. Up to 10774 conditions per place. [2024-10-11 14:11:30,323 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 72 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2024-10-11 14:11:30,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 382 flow [2024-10-11 14:11:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:11:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:11:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-10-11 14:11:30,325 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2024-10-11 14:11:30,325 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 162 flow. Second operand 3 states and 107 transitions. [2024-10-11 14:11:30,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 382 flow [2024-10-11 14:11:30,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 86 transitions, 368 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-10-11 14:11:30,328 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 162 flow [2024-10-11 14:11:30,328 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2024-10-11 14:11:30,329 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2024-10-11 14:11:30,329 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 162 flow [2024-10-11 14:11:30,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:11:30,330 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:30,330 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:11:30,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:11:30,330 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 14:11:30,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:30,331 INFO L85 PathProgramCache]: Analyzing trace with hash -903534563, now seen corresponding path program 1 times [2024-10-11 14:11:30,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:30,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476602738] [2024-10-11 14:11:30,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:30,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 14:11:30,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:11:30,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476602738] [2024-10-11 14:11:30,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476602738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:11:30,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:11:30,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:11:30,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347705426] [2024-10-11 14:11:30,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:11:30,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:11:30,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:11:30,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:11:30,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:11:30,402 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-10-11 14:11:30,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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:11:30,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:11:30,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-10-11 14:11:30,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:11:33,128 INFO L124 PetriNetUnfolderBase]: 26272/39836 cut-off events. [2024-10-11 14:11:33,128 INFO L125 PetriNetUnfolderBase]: For 5442/5442 co-relation queries the response was YES. [2024-10-11 14:11:33,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79790 conditions, 39836 events. 26272/39836 cut-off events. For 5442/5442 co-relation queries the response was YES. Maximal size of possible extension queue 1144. Compared 277970 event pairs, 11890 based on Foata normal form. 0/36383 useless extension candidates. Maximal degree in co-relation 79759. Up to 18619 conditions per place. [2024-10-11 14:11:33,345 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 75 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2024-10-11 14:11:33,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 88 transitions, 397 flow [2024-10-11 14:11:33,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:11:33,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:11:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-10-11 14:11:33,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-10-11 14:11:33,346 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 162 flow. Second operand 3 states and 106 transitions. [2024-10-11 14:11:33,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 88 transitions, 397 flow [2024-10-11 14:11:33,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 88 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:11:33,361 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 172 flow [2024-10-11 14:11:33,362 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-10-11 14:11:33,362 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2024-10-11 14:11:33,362 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 172 flow [2024-10-11 14:11:33,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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:11:33,362 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:33,363 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:11:33,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 14:11:33,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 14:11:33,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:33,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1225656256, now seen corresponding path program 1 times [2024-10-11 14:11:33,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:33,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379186766] [2024-10-11 14:11:33,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:33,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 14:11:33,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:11:33,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379186766] [2024-10-11 14:11:33,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379186766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:11:33,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:11:33,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:11:33,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007590523] [2024-10-11 14:11:33,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:11:33,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:11:33,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:11:33,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:11:33,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:11:33,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 55 [2024-10-11 14:11:33,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:11:33,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:11:33,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 55 [2024-10-11 14:11:33,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:11:35,382 INFO L124 PetriNetUnfolderBase]: 18188/28196 cut-off events. [2024-10-11 14:11:35,382 INFO L125 PetriNetUnfolderBase]: For 4576/4576 co-relation queries the response was YES. [2024-10-11 14:11:35,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57691 conditions, 28196 events. 18188/28196 cut-off events. For 4576/4576 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 193330 event pairs, 12332 based on Foata normal form. 564/26927 useless extension candidates. Maximal degree in co-relation 57659. Up to 20630 conditions per place. [2024-10-11 14:11:35,496 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 70 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-10-11 14:11:35,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 83 transitions, 388 flow [2024-10-11 14:11:35,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:11:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:11:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-10-11 14:11:35,497 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2024-10-11 14:11:35,498 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 172 flow. Second operand 3 states and 104 transitions. [2024-10-11 14:11:35,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 83 transitions, 388 flow [2024-10-11 14:11:35,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:11:35,535 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 176 flow [2024-10-11 14:11:35,535 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2024-10-11 14:11:35,536 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2024-10-11 14:11:35,536 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 176 flow [2024-10-11 14:11:35,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:11:35,536 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:35,536 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1] [2024-10-11 14:11:35,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 14:11:35,536 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 14:11:35,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:35,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2079753419, now seen corresponding path program 1 times [2024-10-11 14:11:35,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:35,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641785414] [2024-10-11 14:11:35,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:35,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:35,598 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 14:11:35,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:11:35,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641785414] [2024-10-11 14:11:35,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641785414] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:11:35,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016898483] [2024-10-11 14:11:35,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:35,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:11:35,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:11:35,602 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:11:35,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 14:11:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:35,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 14:11:35,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:11:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 14:11:35,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:11:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 14:11:35,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016898483] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:11:35,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:11:35,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-10-11 14:11:35,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745331128] [2024-10-11 14:11:35,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:11:35,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:11:35,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:11:35,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:11:35,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:11:35,733 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 55 [2024-10-11 14:11:35,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 176 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 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:11:35,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:11:35,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 55 [2024-10-11 14:11:35,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:11:37,618 INFO L124 PetriNetUnfolderBase]: 18248/28518 cut-off events. [2024-10-11 14:11:37,618 INFO L125 PetriNetUnfolderBase]: For 6735/6735 co-relation queries the response was YES. [2024-10-11 14:11:37,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60048 conditions, 28518 events. 18248/28518 cut-off events. For 6735/6735 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 195335 event pairs, 16009 based on Foata normal form. 2/26585 useless extension candidates. Maximal degree in co-relation 60007. Up to 24750 conditions per place. [2024-10-11 14:11:37,823 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 41 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2024-10-11 14:11:37,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 59 transitions, 284 flow [2024-10-11 14:11:37,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:11:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 14:11:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-10-11 14:11:37,825 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2024-10-11 14:11:37,825 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 176 flow. Second operand 8 states and 150 transitions. [2024-10-11 14:11:37,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 59 transitions, 284 flow [2024-10-11 14:11:37,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 59 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:11:37,878 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 210 flow [2024-10-11 14:11:37,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2024-10-11 14:11:37,879 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2024-10-11 14:11:37,879 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 210 flow [2024-10-11 14:11:37,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 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:11:37,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:37,880 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 4, 3, 1, 1, 1, 1, 1, 1] [2024-10-11 14:11:37,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 14:11:38,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:11:38,081 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 14:11:38,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:38,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1524059403, now seen corresponding path program 2 times [2024-10-11 14:11:38,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:38,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247335554] [2024-10-11 14:11:38,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:38,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:11:38,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:11:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:11:38,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:11:38,119 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:11:38,120 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-11 14:11:38,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-10-11 14:11:38,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-10-11 14:11:38,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-10-11 14:11:38,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-10-11 14:11:38,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 14:11:38,121 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2024-10-11 14:11:38,122 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 14:11:38,122 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-11 14:11:38,164 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:11:38,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 71 transitions, 170 flow [2024-10-11 14:11:38,176 INFO L124 PetriNetUnfolderBase]: 13/82 cut-off events. [2024-10-11 14:11:38,176 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-11 14:11:38,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 82 events. 13/82 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 240 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 73. Up to 5 conditions per place. [2024-10-11 14:11:38,177 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 71 transitions, 170 flow [2024-10-11 14:11:38,178 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 71 transitions, 170 flow [2024-10-11 14:11:38,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:11:38,179 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;@38b6f439, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:11:38,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 14:11:38,182 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:11:38,182 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2024-10-11 14:11:38,183 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 14:11:38,183 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:38,183 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:11:38,183 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:11:38,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:38,184 INFO L85 PathProgramCache]: Analyzing trace with hash -814584140, now seen corresponding path program 1 times [2024-10-11 14:11:38,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:38,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716684965] [2024-10-11 14:11:38,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:38,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:38,212 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:11:38,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:11:38,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716684965] [2024-10-11 14:11:38,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716684965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:11:38,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:11:38,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:11:38,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100478602] [2024-10-11 14:11:38,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:11:38,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:11:38,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:11:38,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:11:38,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:11:38,214 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 71 [2024-10-11 14:11:38,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:11:38,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:11:38,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 71 [2024-10-11 14:11:38,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:11:49,191 INFO L124 PetriNetUnfolderBase]: 121435/168971 cut-off events. [2024-10-11 14:11:49,192 INFO L125 PetriNetUnfolderBase]: For 12016/12016 co-relation queries the response was YES. [2024-10-11 14:11:49,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327375 conditions, 168971 events. 121435/168971 cut-off events. For 12016/12016 co-relation queries the response was YES. Maximal size of possible extension queue 3686. Compared 1155694 event pairs, 106668 based on Foata normal form. 22769/173133 useless extension candidates. Maximal degree in co-relation 26075. Up to 152966 conditions per place. [2024-10-11 14:11:50,386 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 48 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2024-10-11 14:11:50,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 67 transitions, 262 flow [2024-10-11 14:11:50,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:11:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:11:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-10-11 14:11:50,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5023474178403756 [2024-10-11 14:11:50,387 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 170 flow. Second operand 3 states and 107 transitions. [2024-10-11 14:11:50,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 67 transitions, 262 flow [2024-10-11 14:11:50,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 256 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-10-11 14:11:50,393 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 166 flow [2024-10-11 14:11:50,393 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2024-10-11 14:11:50,394 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, 2 predicate places. [2024-10-11 14:11:50,394 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 166 flow [2024-10-11 14:11:50,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:11:50,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:11:50,394 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:11:50,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 14:11:50,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-11 14:11:50,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:11:50,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1512656771, now seen corresponding path program 1 times [2024-10-11 14:11:50,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:11:50,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883725157] [2024-10-11 14:11:50,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:50,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:11:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:11:50,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:11:50,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883725157] [2024-10-11 14:11:50,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883725157] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:11:50,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348357341] [2024-10-11 14:11:50,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:11:50,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:11:50,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:11:50,433 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:11:50,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 14:11:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:11:50,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 14:11:50,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:11:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:11:50,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:11:50,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:11:50,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348357341] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:11:50,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:11:50,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-11 14:11:50,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887606830] [2024-10-11 14:11:50,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:11:50,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:11:50,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:11:50,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:11:50,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:11:50,541 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 71 [2024-10-11 14:11:50,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 166 flow. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 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:11:50,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:11:50,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 71 [2024-10-11 14:11:50,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand