./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/39_rand_lock_p0_vs-pthread.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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 ../../../trunk/examples/svcomp/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.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:21:28,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:21:28,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:21:28,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:21:28,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:21:28,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:21:28,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:21:28,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:21:28,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:21:28,291 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:21:28,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:21:28,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:21:28,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:21:28,293 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:21:28,294 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:21:28,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:21:28,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:21:28,294 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:21:28,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:21:28,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:21:28,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:21:28,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:21:28,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:21:28,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:21:28,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:21:28,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:21:28,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:21:28,297 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:21:28,297 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:21:28,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:21:28,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:21:28,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:21:28,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:21:28,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:21:28,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:21:28,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:21:28,299 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:21:28,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:21:28,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:21:28,300 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:21:28,300 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:21:28,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:21:28,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:21:28,301 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-06-27 16:21:28,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:21:28,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:21:28,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:21:28,530 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:21:28,531 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:21:28,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/39_rand_lock_p0_vs-pthread.i [2024-06-27 16:21:29,623 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:21:29,830 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:21:29,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/39_rand_lock_p0_vs-pthread.i [2024-06-27 16:21:29,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/599af991d/f858f9eec4b042feae8ea4c914773737/FLAG91debf913 [2024-06-27 16:21:29,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/599af991d/f858f9eec4b042feae8ea4c914773737 [2024-06-27 16:21:29,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:21:29,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:21:29,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:21:29,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:21:29,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:21:29,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:21:29" (1/1) ... [2024-06-27 16:21:29,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f7f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:29, skipping insertion in model container [2024-06-27 16:21:29,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:21:29" (1/1) ... [2024-06-27 16:21:29,922 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:21:30,212 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/39_rand_lock_p0_vs-pthread.i[30745,30758] [2024-06-27 16:21:30,242 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:21:30,253 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:21:30,295 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/39_rand_lock_p0_vs-pthread.i[30745,30758] [2024-06-27 16:21:30,297 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:21:30,335 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:21:30,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:30 WrapperNode [2024-06-27 16:21:30,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:21:30,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:21:30,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:21:30,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:21:30,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:30" (1/1) ... [2024-06-27 16:21:30,354 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:30" (1/1) ... [2024-06-27 16:21:30,379 INFO L138 Inliner]: procedures = 166, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2024-06-27 16:21:30,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:21:30,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:21:30,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:21:30,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:21:30,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:30" (1/1) ... [2024-06-27 16:21:30,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:30" (1/1) ... [2024-06-27 16:21:30,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:30" (1/1) ... [2024-06-27 16:21:30,414 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-06-27 16:21:30,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:30" (1/1) ... [2024-06-27 16:21:30,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:30" (1/1) ... [2024-06-27 16:21:30,418 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:30" (1/1) ... [2024-06-27 16:21:30,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:30" (1/1) ... [2024-06-27 16:21:30,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:30" (1/1) ... [2024-06-27 16:21:30,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:30" (1/1) ... [2024-06-27 16:21:30,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:21:30,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:21:30,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:21:30,428 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:21:30,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:30" (1/1) ... [2024-06-27 16:21:30,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:21:30,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:21:30,457 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-06-27 16:21:30,476 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-06-27 16:21:30,495 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-06-27 16:21:30,496 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-06-27 16:21:30,496 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-27 16:21:30,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 16:21:30,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:21:30,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:21:30,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 16:21:30,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 16:21:30,496 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-27 16:21:30,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:21:30,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:21:30,498 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 16:21:30,631 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:21:30,633 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:21:30,759 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:21:30,759 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:21:30,844 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:21:30,844 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-27 16:21:30,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:21:30 BoogieIcfgContainer [2024-06-27 16:21:30,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:21:30,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:21:30,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:21:30,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:21:30,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:21:29" (1/3) ... [2024-06-27 16:21:30,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7212045c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:21:30, skipping insertion in model container [2024-06-27 16:21:30,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:30" (2/3) ... [2024-06-27 16:21:30,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7212045c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:21:30, skipping insertion in model container [2024-06-27 16:21:30,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:21:30" (3/3) ... [2024-06-27 16:21:30,859 INFO L112 eAbstractionObserver]: Analyzing ICFG 39_rand_lock_p0_vs-pthread.i [2024-06-27 16:21:30,865 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:21:30,872 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:21:30,872 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:21:30,873 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:21:30,902 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:30,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 42 flow [2024-06-27 16:21:30,946 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2024-06-27 16:21:30,947 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 16:21:30,952 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-06-27 16:21:30,952 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 19 transitions, 42 flow [2024-06-27 16:21:30,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 19 transitions, 42 flow [2024-06-27 16:21:30,962 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:30,968 INFO L357 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, mHoare=true, 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;@27daa4d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:30,968 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 16:21:30,972 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:30,972 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-06-27 16:21:30,973 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 16:21:30,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:30,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 16:21:30,974 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-06-27 16:21:30,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:30,978 INFO L85 PathProgramCache]: Analyzing trace with hash 198216944, now seen corresponding path program 1 times [2024-06-27 16:21:30,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:30,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593990763] [2024-06-27 16:21:30,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:30,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:31,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:21:31,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:31,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593990763] [2024-06-27 16:21:31,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593990763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:31,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:31,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 16:21:31,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883312072] [2024-06-27 16:21:31,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:31,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:31,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:31,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:31,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:31,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-06-27 16:21:31,226 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-06-27 16:21:31,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:31,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-06-27 16:21:31,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:31,275 INFO L124 PetriNetUnfolderBase]: 21/58 cut-off events. [2024-06-27 16:21:31,276 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 16:21:31,276 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-06-27 16:21:31,278 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 13 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2024-06-27 16:21:31,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 18 transitions, 70 flow [2024-06-27 16:21:31,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:21:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:21:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2024-06-27 16:21:31,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2024-06-27 16:21:31,308 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 42 flow. Second operand 3 states and 28 transitions. [2024-06-27 16:21:31,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 18 transitions, 70 flow [2024-06-27 16:21:31,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 18 transitions, 70 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:31,322 INFO L231 Difference]: Finished difference. Result has 20 places, 16 transitions, 40 flow [2024-06-27 16:21:31,324 INFO L264 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-06-27 16:21:31,360 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 0 predicate places. [2024-06-27 16:21:31,360 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 16 transitions, 40 flow [2024-06-27 16:21:31,360 INFO L496 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-06-27 16:21:31,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:31,360 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-06-27 16:21:31,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:21:31,361 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-06-27 16:21:31,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:31,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1849745145, now seen corresponding path program 1 times [2024-06-27 16:21:31,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:31,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004883646] [2024-06-27 16:21:31,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:31,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:31,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:31,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:31,430 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:31,432 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-06-27 16:21:31,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-06-27 16:21:31,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-06-27 16:21:31,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:21:31,435 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-06-27 16:21:31,439 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:31,440 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-06-27 16:21:31,469 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:31,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 76 flow [2024-06-27 16:21:31,487 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2024-06-27 16:21:31,491 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:21:31,492 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-06-27 16:21:31,493 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 76 flow [2024-06-27 16:21:31,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 33 transitions, 76 flow [2024-06-27 16:21:31,495 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:31,496 INFO L357 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, mHoare=true, 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;@27daa4d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:31,497 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 16:21:31,502 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:31,504 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-06-27 16:21:31,504 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 16:21:31,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:31,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 16:21:31,505 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-06-27 16:21:31,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:31,505 INFO L85 PathProgramCache]: Analyzing trace with hash 229721918, now seen corresponding path program 1 times [2024-06-27 16:21:31,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:31,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589475693] [2024-06-27 16:21:31,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:31,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:31,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:21:31,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:31,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589475693] [2024-06-27 16:21:31,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589475693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:31,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:31,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 16:21:31,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936131829] [2024-06-27 16:21:31,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:31,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:31,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:31,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:31,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:31,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-27 16:21:31,552 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-06-27 16:21:31,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:31,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-27 16:21:31,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:31,745 INFO L124 PetriNetUnfolderBase]: 525/911 cut-off events. [2024-06-27 16:21:31,746 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-06-27 16:21:31,751 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 3652 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-06-27 16:21:31,758 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 39 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2024-06-27 16:21:31,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 193 flow [2024-06-27 16:21:31,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:21:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:21:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2024-06-27 16:21:31,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6565656565656566 [2024-06-27 16:21:31,761 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 76 flow. Second operand 3 states and 65 transitions. [2024-06-27 16:21:31,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 193 flow [2024-06-27 16:21:31,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 193 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:31,766 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 91 flow [2024-06-27 16:21:31,766 INFO L264 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-06-27 16:21:31,767 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2024-06-27 16:21:31,767 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 91 flow [2024-06-27 16:21:31,767 INFO L496 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-06-27 16:21:31,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:31,768 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2024-06-27 16:21:31,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 16:21:31,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-06-27 16:21:31,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:31,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1953682181, now seen corresponding path program 1 times [2024-06-27 16:21:31,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:31,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656842299] [2024-06-27 16:21:31,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:31,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:31,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:31,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:31,824 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:31,824 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-27 16:21:31,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-06-27 16:21:31,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-06-27 16:21:31,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-06-27 16:21:31,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 16:21:31,825 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-06-27 16:21:31,826 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:31,826 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-06-27 16:21:31,852 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:31,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 47 transitions, 112 flow [2024-06-27 16:21:31,864 INFO L124 PetriNetUnfolderBase]: 6/55 cut-off events. [2024-06-27 16:21:31,864 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-06-27 16:21:31,864 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-06-27 16:21:31,864 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 47 transitions, 112 flow [2024-06-27 16:21:31,865 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 47 transitions, 112 flow [2024-06-27 16:21:31,866 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:31,868 INFO L357 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, mHoare=true, 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;@27daa4d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:31,868 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 16:21:31,869 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:31,869 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-06-27 16:21:31,870 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 16:21:31,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:31,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 16:21:31,873 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 16:21:31,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:31,874 INFO L85 PathProgramCache]: Analyzing trace with hash 274586746, now seen corresponding path program 1 times [2024-06-27 16:21:31,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:31,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263516854] [2024-06-27 16:21:31,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:31,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:21:31,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:31,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263516854] [2024-06-27 16:21:31,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263516854] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:31,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:31,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 16:21:31,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082402923] [2024-06-27 16:21:31,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:31,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:31,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:31,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:31,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:31,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2024-06-27 16:21:31,938 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-06-27 16:21:31,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:31,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2024-06-27 16:21:31,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:32,943 INFO L124 PetriNetUnfolderBase]: 9048/13148 cut-off events. [2024-06-27 16:21:32,943 INFO L125 PetriNetUnfolderBase]: For 716/716 co-relation queries the response was YES. [2024-06-27 16:21:32,965 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 70100 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-06-27 16:21:33,024 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 57 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2024-06-27 16:21:33,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 288 flow [2024-06-27 16:21:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:21:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:21:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-06-27 16:21:33,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-06-27 16:21:33,027 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 112 flow. Second operand 3 states and 93 transitions. [2024-06-27 16:21:33,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 288 flow [2024-06-27 16:21:33,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 284 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:33,032 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 132 flow [2024-06-27 16:21:33,032 INFO L264 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-06-27 16:21:33,033 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2024-06-27 16:21:33,034 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 132 flow [2024-06-27 16:21:33,034 INFO L496 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-06-27 16:21:33,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:33,034 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2024-06-27 16:21:33,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 16:21:33,034 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 16:21:33,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:33,035 INFO L85 PathProgramCache]: Analyzing trace with hash -966908328, now seen corresponding path program 1 times [2024-06-27 16:21:33,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:33,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602093952] [2024-06-27 16:21:33,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:33,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:33,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:33,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:33,078 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:33,079 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-06-27 16:21:33,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-06-27 16:21:33,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-06-27 16:21:33,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-06-27 16:21:33,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-06-27 16:21:33,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 16:21:33,080 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-06-27 16:21:33,080 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:33,081 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-06-27 16:21:33,114 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:33,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 61 transitions, 150 flow [2024-06-27 16:21:33,122 INFO L124 PetriNetUnfolderBase]: 8/72 cut-off events. [2024-06-27 16:21:33,123 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-06-27 16:21:33,123 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-06-27 16:21:33,123 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 61 transitions, 150 flow [2024-06-27 16:21:33,123 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 61 transitions, 150 flow [2024-06-27 16:21:33,124 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:33,125 INFO L357 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, mHoare=true, 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;@27daa4d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:33,125 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-27 16:21:33,126 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:33,126 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-06-27 16:21:33,126 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 16:21:33,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:33,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 16:21:33,126 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-06-27 16:21:33,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:33,126 INFO L85 PathProgramCache]: Analyzing trace with hash 332812260, now seen corresponding path program 1 times [2024-06-27 16:21:33,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:33,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220786824] [2024-06-27 16:21:33,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:33,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:33,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:21:33,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:33,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220786824] [2024-06-27 16:21:33,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220786824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:33,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:33,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 16:21:33,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560979065] [2024-06-27 16:21:33,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:33,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:33,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:33,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:33,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:33,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 61 [2024-06-27 16:21:33,152 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-06-27 16:21:33,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:33,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 61 [2024-06-27 16:21:33,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:43,190 INFO L124 PetriNetUnfolderBase]: 138114/182648 cut-off events. [2024-06-27 16:21:43,190 INFO L125 PetriNetUnfolderBase]: For 13071/13071 co-relation queries the response was YES. [2024-06-27 16:21:43,484 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 1116097 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-06-27 16:21:44,174 INFO L140 encePairwiseOnDemand]: 47/61 looper letters, 75 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2024-06-27 16:21:44,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 89 transitions, 387 flow [2024-06-27 16:21:44,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:21:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:21:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2024-06-27 16:21:44,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6612021857923497 [2024-06-27 16:21:44,176 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 150 flow. Second operand 3 states and 121 transitions. [2024-06-27 16:21:44,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 89 transitions, 387 flow [2024-06-27 16:21:44,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 89 transitions, 375 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:44,189 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 173 flow [2024-06-27 16:21:44,189 INFO L264 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-06-27 16:21:44,191 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2024-06-27 16:21:44,191 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 173 flow [2024-06-27 16:21:44,191 INFO L496 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-06-27 16:21:44,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:44,191 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:44,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 16:21:44,192 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-06-27 16:21:44,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:44,192 INFO L85 PathProgramCache]: Analyzing trace with hash 729659072, now seen corresponding path program 1 times [2024-06-27 16:21:44,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:44,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630538019] [2024-06-27 16:21:44,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:44,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:44,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:44,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:44,230 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:44,231 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-06-27 16:21:44,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-06-27 16:21:44,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-06-27 16:21:44,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-06-27 16:21:44,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-06-27 16:21:44,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-06-27 16:21:44,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 16:21:44,232 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-06-27 16:21:44,233 WARN L234 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:44,233 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-06-27 16:21:44,268 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:44,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 75 transitions, 190 flow [2024-06-27 16:21:44,278 INFO L124 PetriNetUnfolderBase]: 10/89 cut-off events. [2024-06-27 16:21:44,279 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-06-27 16:21:44,280 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-06-27 16:21:44,280 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 75 transitions, 190 flow [2024-06-27 16:21:44,281 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 75 transitions, 190 flow [2024-06-27 16:21:44,282 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:44,284 INFO L357 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, mHoare=true, 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;@27daa4d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:44,284 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 16:21:44,286 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:44,286 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-06-27 16:21:44,286 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 16:21:44,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:44,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 16:21:44,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-06-27 16:21:44,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:44,287 INFO L85 PathProgramCache]: Analyzing trace with hash 404397212, now seen corresponding path program 1 times [2024-06-27 16:21:44,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:44,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117303435] [2024-06-27 16:21:44,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:44,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:21:44,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:44,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117303435] [2024-06-27 16:21:44,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117303435] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:44,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:44,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 16:21:44,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031306786] [2024-06-27 16:21:44,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:44,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:44,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:44,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:44,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:44,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 75 [2024-06-27 16:21:44,328 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-06-27 16:21:44,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:44,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 75 [2024-06-27 16:21:44,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand