./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs-pthread.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs-pthread.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbb282ba26be8214a1cf8ae9e386fa47ac739eda395572670b4579e50ef53b1a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:52:17,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:52:17,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:52:17,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:52:17,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:52:17,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:52:17,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:52:17,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:52:17,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:52:17,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:52:17,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:52:17,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:52:17,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:52:17,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:52:17,376 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:52:17,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:52:17,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:52:17,378 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:52:17,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:52:17,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:52:17,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:52:17,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:52:17,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:52:17,383 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:52:17,383 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:52:17,384 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:52:17,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:52:17,384 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:52:17,384 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:52:17,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:52:17,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:52:17,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:52:17,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:52:17,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:52:17,385 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:52:17,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:52:17,386 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:52:17,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:52:17,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:52:17,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:52:17,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:52:17,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:52:17,391 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dbb282ba26be8214a1cf8ae9e386fa47ac739eda395572670b4579e50ef53b1a [2024-10-13 06:52:17,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:52:17,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:52:17,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:52:17,706 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:52:17,706 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:52:17,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs-pthread.i [2024-10-13 06:52:19,066 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:52:19,278 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:52:19,279 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs-pthread.i [2024-10-13 06:52:19,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/503ef8c63/094a6e2da0b245e084b087d112aef239/FLAG39ce885d3 [2024-10-13 06:52:19,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/503ef8c63/094a6e2da0b245e084b087d112aef239 [2024-10-13 06:52:19,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:52:19,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:52:19,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:52:19,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:52:19,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:52:19,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:52:19" (1/1) ... [2024-10-13 06:52:19,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5475ba2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:52:19, skipping insertion in model container [2024-10-13 06:52:19,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:52:19" (1/1) ... [2024-10-13 06:52:19,367 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:52:19,751 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs-pthread.i[30745,30758] [2024-10-13 06:52:19,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:52:19,770 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:52:19,810 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs-pthread.i[30745,30758] [2024-10-13 06:52:19,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:52:19,846 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:52:19,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:52:19 WrapperNode [2024-10-13 06:52:19,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:52:19,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:52:19,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:52:19,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:52:19,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:52:19" (1/1) ... [2024-10-13 06:52:19,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:52:19" (1/1) ... [2024-10-13 06:52:19,886 INFO L138 Inliner]: procedures = 166, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2024-10-13 06:52:19,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:52:19,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:52:19,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:52:19,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:52:19,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:52:19" (1/1) ... [2024-10-13 06:52:19,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:52:19" (1/1) ... [2024-10-13 06:52:19,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:52:19" (1/1) ... [2024-10-13 06:52:19,914 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2024-10-13 06:52:19,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:52:19" (1/1) ... [2024-10-13 06:52:19,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:52:19" (1/1) ... [2024-10-13 06:52:19,921 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:52:19" (1/1) ... [2024-10-13 06:52:19,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:52:19" (1/1) ... [2024-10-13 06:52:19,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:52:19" (1/1) ... [2024-10-13 06:52:19,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:52:19" (1/1) ... [2024-10-13 06:52:19,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:52:19,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:52:19,934 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:52:19,934 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:52:19,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:52:19" (1/1) ... [2024-10-13 06:52:19,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:52:19,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:52:19,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:52:19,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:52:20,011 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-13 06:52:20,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-13 06:52:20,012 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 06:52:20,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 06:52:20,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:52:20,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:52:20,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:52:20,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 06:52:20,015 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 06:52:20,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:52:20,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:52:20,017 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 06:52:20,120 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:52:20,122 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:52:20,260 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 06:52:20,260 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:52:20,439 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:52:20,439 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 06:52:20,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:52:20 BoogieIcfgContainer [2024-10-13 06:52:20,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:52:20,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:52:20,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:52:20,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:52:20,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:52:19" (1/3) ... [2024-10-13 06:52:20,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a03ed46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:52:20, skipping insertion in model container [2024-10-13 06:52:20,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:52:19" (2/3) ... [2024-10-13 06:52:20,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a03ed46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:52:20, skipping insertion in model container [2024-10-13 06:52:20,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:52:20" (3/3) ... [2024-10-13 06:52:20,457 INFO L112 eAbstractionObserver]: Analyzing ICFG 39_rand_lock_p0_vs-pthread.i [2024-10-13 06:52:20,487 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:52:20,489 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:52:20,489 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 06:52:20,536 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 06:52:20,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 42 flow [2024-10-13 06:52:20,579 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2024-10-13 06:52:20,580 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 06:52:20,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 21 events. 2/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 21 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2024-10-13 06:52:20,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 19 transitions, 42 flow [2024-10-13 06:52:20,584 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 19 transitions, 42 flow [2024-10-13 06:52:20,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:52:20,604 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;@3698c639, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:52:20,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-13 06:52:20,616 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 06:52:20,616 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-10-13 06:52:20,617 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 06:52:20,617 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:52:20,617 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 06:52:20,618 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:52:20,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:52:20,631 INFO L85 PathProgramCache]: Analyzing trace with hash 198216944, now seen corresponding path program 1 times [2024-10-13 06:52:20,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:52:20,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945123283] [2024-10-13 06:52:20,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:52:20,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:52:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:52:20,875 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-13 06:52:20,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:52:20,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945123283] [2024-10-13 06:52:20,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945123283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:52:20,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:52:20,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 06:52:20,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801920908] [2024-10-13 06:52:20,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:52:20,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:52:20,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:52:20,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:52:20,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:52:20,924 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-10-13 06:52:20,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:52:20,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:52:20,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-10-13 06:52:20,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:52:20,975 INFO L124 PetriNetUnfolderBase]: 21/58 cut-off events. [2024-10-13 06:52:20,975 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 06:52:20,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 58 events. 21/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 93 event pairs, 12 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 100. Up to 35 conditions per place. [2024-10-13 06:52:20,977 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 13 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2024-10-13 06:52:20,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 18 transitions, 70 flow [2024-10-13 06:52:20,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:52:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 06:52:20,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2024-10-13 06:52:20,989 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2024-10-13 06:52:20,990 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 42 flow. Second operand 3 states and 28 transitions. [2024-10-13 06:52:20,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 18 transitions, 70 flow [2024-10-13 06:52:20,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 18 transitions, 70 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 06:52:20,994 INFO L231 Difference]: Finished difference. Result has 20 places, 16 transitions, 40 flow [2024-10-13 06:52:20,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=20, PETRI_TRANSITIONS=16} [2024-10-13 06:52:20,998 INFO L277 CegarLoopForPetriNet]: 20 programPoint places, 0 predicate places. [2024-10-13 06:52:20,999 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 16 transitions, 40 flow [2024-10-13 06:52:20,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:52:20,999 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:52:20,999 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-10-13 06:52:21,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:52:21,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:52:21,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:52:21,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1849745145, now seen corresponding path program 1 times [2024-10-13 06:52:21,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:52:21,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832676665] [2024-10-13 06:52:21,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:52:21,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:52:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:52:21,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:52:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:52:21,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:52:21,077 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:52:21,079 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-10-13 06:52:21,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-10-13 06:52:21,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-10-13 06:52:21,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:52:21,083 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 06:52:21,086 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 06:52:21,087 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-13 06:52:21,113 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 06:52:21,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 76 flow [2024-10-13 06:52:21,128 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2024-10-13 06:52:21,129 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 06:52:21,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 38 events. 4/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 69 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2024-10-13 06:52:21,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 76 flow [2024-10-13 06:52:21,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 33 transitions, 76 flow [2024-10-13 06:52:21,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:52:21,135 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;@3698c639, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:52:21,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-13 06:52:21,139 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 06:52:21,140 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-10-13 06:52:21,140 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 06:52:21,141 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:52:21,141 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 06:52:21,141 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-13 06:52:21,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:52:21,142 INFO L85 PathProgramCache]: Analyzing trace with hash 229721918, now seen corresponding path program 1 times [2024-10-13 06:52:21,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:52:21,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311792460] [2024-10-13 06:52:21,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:52:21,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:52:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:52:21,201 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-13 06:52:21,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:52:21,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311792460] [2024-10-13 06:52:21,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311792460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:52:21,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:52:21,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 06:52:21,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133501078] [2024-10-13 06:52:21,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:52:21,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:52:21,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:52:21,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:52:21,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:52:21,208 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-10-13 06:52:21,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:52:21,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:52:21,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-10-13 06:52:21,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:52:21,468 INFO L124 PetriNetUnfolderBase]: 525/911 cut-off events. [2024-10-13 06:52:21,468 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-10-13 06:52:21,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1789 conditions, 911 events. 525/911 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3647 event pairs, 252 based on Foata normal form. 0/857 useless extension candidates. Maximal degree in co-relation 1262. Up to 451 conditions per place. [2024-10-13 06:52:21,480 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 39 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2024-10-13 06:52:21,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 193 flow [2024-10-13 06:52:21,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:52:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 06:52:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2024-10-13 06:52:21,484 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6565656565656566 [2024-10-13 06:52:21,484 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 76 flow. Second operand 3 states and 65 transitions. [2024-10-13 06:52:21,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 193 flow [2024-10-13 06:52:21,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 193 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 06:52:21,487 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 91 flow [2024-10-13 06:52:21,488 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2024-10-13 06:52:21,489 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2024-10-13 06:52:21,489 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 91 flow [2024-10-13 06:52:21,489 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-13 06:52:21,489 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:52:21,490 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2024-10-13 06:52:21,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:52:21,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 06:52:21,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:52:21,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1953682181, now seen corresponding path program 1 times [2024-10-13 06:52:21,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:52:21,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186731715] [2024-10-13 06:52:21,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:52:21,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:52:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:52:21,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:52:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:52:21,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:52:21,521 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:52:21,521 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-10-13 06:52:21,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-10-13 06:52:21,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-10-13 06:52:21,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-10-13 06:52:21,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:52:21,522 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 06:52:21,522 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 06:52:21,523 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-13 06:52:21,546 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 06:52:21,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 47 transitions, 112 flow [2024-10-13 06:52:21,553 INFO L124 PetriNetUnfolderBase]: 6/55 cut-off events. [2024-10-13 06:52:21,553 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-13 06:52:21,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 6/55 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 126 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2024-10-13 06:52:21,554 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 47 transitions, 112 flow [2024-10-13 06:52:21,554 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 47 transitions, 112 flow [2024-10-13 06:52:21,555 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:52:21,556 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;@3698c639, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:52:21,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-13 06:52:21,557 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 06:52:21,557 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-10-13 06:52:21,557 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 06:52:21,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:52:21,557 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 06:52:21,558 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-13 06:52:21,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:52:21,558 INFO L85 PathProgramCache]: Analyzing trace with hash 274586746, now seen corresponding path program 1 times [2024-10-13 06:52:21,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:52:21,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170119204] [2024-10-13 06:52:21,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:52:21,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:52:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:52:21,591 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-13 06:52:21,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:52:21,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170119204] [2024-10-13 06:52:21,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170119204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:52:21,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:52:21,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 06:52:21,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777352136] [2024-10-13 06:52:21,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:52:21,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:52:21,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:52:21,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:52:21,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:52:21,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2024-10-13 06:52:21,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:52:21,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:52:21,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2024-10-13 06:52:21,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:52:22,715 INFO L124 PetriNetUnfolderBase]: 9048/13148 cut-off events. [2024-10-13 06:52:22,716 INFO L125 PetriNetUnfolderBase]: For 716/716 co-relation queries the response was YES. [2024-10-13 06:52:22,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26250 conditions, 13148 events. 9048/13148 cut-off events. For 716/716 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 70120 event pairs, 3549 based on Foata normal form. 0/12344 useless extension candidates. Maximal degree in co-relation 6698. Up to 8869 conditions per place. [2024-10-13 06:52:22,800 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 57 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2024-10-13 06:52:22,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 288 flow [2024-10-13 06:52:22,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:52:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 06:52:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-10-13 06:52:22,802 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-10-13 06:52:22,803 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 112 flow. Second operand 3 states and 93 transitions. [2024-10-13 06:52:22,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 288 flow [2024-10-13 06:52:22,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 284 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-10-13 06:52:22,807 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 132 flow [2024-10-13 06:52:22,808 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-10-13 06:52:22,809 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2024-10-13 06:52:22,809 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 132 flow [2024-10-13 06:52:22,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:52:22,810 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:52:22,810 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2024-10-13 06:52:22,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:52:22,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-13 06:52:22,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:52:22,811 INFO L85 PathProgramCache]: Analyzing trace with hash -966908328, now seen corresponding path program 1 times [2024-10-13 06:52:22,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:52:22,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328612345] [2024-10-13 06:52:22,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:52:22,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:52:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:52:22,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:52:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:52:22,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:52:22,847 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:52:22,847 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-13 06:52:22,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-10-13 06:52:22,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-10-13 06:52:22,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-10-13 06:52:22,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-10-13 06:52:22,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:52:22,849 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 06:52:22,849 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 06:52:22,849 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-13 06:52:22,875 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 06:52:22,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 61 transitions, 150 flow [2024-10-13 06:52:22,885 INFO L124 PetriNetUnfolderBase]: 8/72 cut-off events. [2024-10-13 06:52:22,885 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-13 06:52:22,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 72 events. 8/72 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 183 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 67. Up to 5 conditions per place. [2024-10-13 06:52:22,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 61 transitions, 150 flow [2024-10-13 06:52:22,890 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 61 transitions, 150 flow [2024-10-13 06:52:22,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:52:22,892 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;@3698c639, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:52:22,892 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-13 06:52:22,894 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 06:52:22,894 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-10-13 06:52:22,894 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 06:52:22,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:52:22,894 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 06:52:22,895 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-13 06:52:22,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:52:22,895 INFO L85 PathProgramCache]: Analyzing trace with hash 332812260, now seen corresponding path program 1 times [2024-10-13 06:52:22,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:52:22,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336897904] [2024-10-13 06:52:22,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:52:22,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:52:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:52:22,928 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-13 06:52:22,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:52:22,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336897904] [2024-10-13 06:52:22,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336897904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:52:22,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:52:22,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 06:52:22,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411079500] [2024-10-13 06:52:22,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:52:22,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:52:22,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:52:22,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:52:22,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:52:22,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 61 [2024-10-13 06:52:22,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:52:22,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:52:22,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 61 [2024-10-13 06:52:22,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:52:35,091 INFO L124 PetriNetUnfolderBase]: 138114/182648 cut-off events. [2024-10-13 06:52:35,091 INFO L125 PetriNetUnfolderBase]: For 13071/13071 co-relation queries the response was YES. [2024-10-13 06:52:35,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367995 conditions, 182648 events. 138114/182648 cut-off events. For 13071/13071 co-relation queries the response was YES. Maximal size of possible extension queue 3645. Compared 1116066 event pairs, 45867 based on Foata normal form. 0/170309 useless extension candidates. Maximal degree in co-relation 33284. Up to 145462 conditions per place. [2024-10-13 06:52:36,537 INFO L140 encePairwiseOnDemand]: 47/61 looper letters, 75 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2024-10-13 06:52:36,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 89 transitions, 387 flow [2024-10-13 06:52:36,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:52:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 06:52:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2024-10-13 06:52:36,545 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6612021857923497 [2024-10-13 06:52:36,545 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 150 flow. Second operand 3 states and 121 transitions. [2024-10-13 06:52:36,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 89 transitions, 387 flow [2024-10-13 06:52:36,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 89 transitions, 375 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-10-13 06:52:36,565 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 173 flow [2024-10-13 06:52:36,565 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2024-10-13 06:52:36,566 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2024-10-13 06:52:36,566 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 173 flow [2024-10-13 06:52:36,566 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-13 06:52:36,566 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:52:36,566 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2024-10-13 06:52:36,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:52:36,567 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-13 06:52:36,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:52:36,567 INFO L85 PathProgramCache]: Analyzing trace with hash 729659072, now seen corresponding path program 1 times [2024-10-13 06:52:36,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:52:36,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832502189] [2024-10-13 06:52:36,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:52:36,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:52:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:52:36,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:52:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:52:36,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:52:36,600 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:52:36,601 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-10-13 06:52:36,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-10-13 06:52:36,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-10-13 06:52:36,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-10-13 06:52:36,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-10-13 06:52:36,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-10-13 06:52:36,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:52:36,602 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 06:52:36,602 WARN L239 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 06:52:36,603 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-10-13 06:52:36,639 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 06:52:36,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 75 transitions, 190 flow [2024-10-13 06:52:36,650 INFO L124 PetriNetUnfolderBase]: 10/89 cut-off events. [2024-10-13 06:52:36,650 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-10-13 06:52:36,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 89 events. 10/89 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 231 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 90. Up to 6 conditions per place. [2024-10-13 06:52:36,652 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 75 transitions, 190 flow [2024-10-13 06:52:36,653 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 75 transitions, 190 flow [2024-10-13 06:52:36,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:52:36,656 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;@3698c639, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:52:36,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-13 06:52:36,660 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 06:52:36,660 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-10-13 06:52:36,660 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 06:52:36,660 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:52:36,660 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 06:52:36,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-13 06:52:36,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:52:36,661 INFO L85 PathProgramCache]: Analyzing trace with hash 404397212, now seen corresponding path program 1 times [2024-10-13 06:52:36,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:52:36,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994465126] [2024-10-13 06:52:36,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:52:36,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:52:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:52:36,699 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-13 06:52:36,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:52:36,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994465126] [2024-10-13 06:52:36,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994465126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:52:36,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:52:36,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 06:52:36,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033516395] [2024-10-13 06:52:36,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:52:36,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:52:36,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:52:36,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:52:36,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:52:36,711 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 75 [2024-10-13 06:52:36,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:52:36,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:52:36,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 75 [2024-10-13 06:52:36,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand