./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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/46_monabsex2_vs.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 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:09:41,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:09:41,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:09:41,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:09:41,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:09:41,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:09:41,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:09:41,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:09:41,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:09:41,777 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:09:41,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:09:41,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:09:41,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:09:41,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:09:41,779 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:09:41,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:09:41,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:09:41,780 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:09:41,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:09:41,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:09:41,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:09:41,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:09:41,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:09:41,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:09:41,789 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:09:41,789 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:09:41,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:09:41,789 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:09:41,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:09:41,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:09:41,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:09:41,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:09:41,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:09:41,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:09:41,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:09:41,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:09:41,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:09:41,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:09:41,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:09:41,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:09:41,792 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:09:41,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:09:41,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:09:41,793 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 -> 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 [2024-01-27 15:09:42,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:09:42,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:09:42,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:09:42,029 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:09:42,029 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:09:42,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i [2024-01-27 15:09:43,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:09:43,351 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:09:43,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i [2024-01-27 15:09:43,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f10077f2/f3298e72eee54c0a9eafa1d6b75a5b9d/FLAG7cc2e932e [2024-01-27 15:09:43,377 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f10077f2/f3298e72eee54c0a9eafa1d6b75a5b9d [2024-01-27 15:09:43,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:09:43,380 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:09:43,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:09:43,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:09:43,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:09:43,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c55edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43, skipping insertion in model container [2024-01-27 15:09:43,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,440 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:09:43,730 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i[30494,30507] [2024-01-27 15:09:43,741 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:09:43,749 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:09:43,787 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i[30494,30507] [2024-01-27 15:09:43,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:09:43,818 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:09:43,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43 WrapperNode [2024-01-27 15:09:43,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:09:43,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:09:43,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:09:43,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:09:43,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,876 INFO L138 Inliner]: procedures = 169, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-01-27 15:09:43,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:09:43,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:09:43,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:09:43,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:09:43,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,907 INFO L175 MemorySlicer]: Split 3 memory accesses to 2 slices as follows [2, 1]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-01-27 15:09:43,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,922 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:09:43,928 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:09:43,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:09:43,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:09:43,929 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:09:43,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:09:43,987 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-01-27 15:09:44,021 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-01-27 15:09:44,055 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-01-27 15:09:44,055 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-01-27 15:09:44,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:09:44,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:09:44,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:09:44,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:09:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:09:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:09:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:09:44,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:09:44,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:09:44,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:09:44,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:09:44,059 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:09:44,180 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:09:44,185 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:09:44,297 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:09:44,298 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:09:44,343 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:09:44,344 INFO L320 CfgBuilder]: Removed 1 assume(true) statements. [2024-01-27 15:09:44,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:09:44 BoogieIcfgContainer [2024-01-27 15:09:44,344 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:09:44,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:09:44,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:09:44,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:09:44,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:09:43" (1/3) ... [2024-01-27 15:09:44,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285252ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:09:44, skipping insertion in model container [2024-01-27 15:09:44,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (2/3) ... [2024-01-27 15:09:44,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285252ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:09:44, skipping insertion in model container [2024-01-27 15:09:44,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:09:44" (3/3) ... [2024-01-27 15:09:44,351 INFO L112 eAbstractionObserver]: Analyzing ICFG 46_monabsex2_vs.i [2024-01-27 15:09:44,357 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:09:44,365 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:09:44,365 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:09:44,365 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:09:44,386 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 15:09:44,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 14 places, 11 transitions, 26 flow [2024-01-27 15:09:44,422 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2024-01-27 15:09:44,423 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 15:09:44,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17 conditions, 13 events. 0/13 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-01-27 15:09:44,424 INFO L82 GeneralOperation]: Start removeDead. Operand has 14 places, 11 transitions, 26 flow [2024-01-27 15:09:44,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 14 places, 11 transitions, 26 flow [2024-01-27 15:09:44,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:09:44,440 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;@10b2682c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:09:44,440 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-01-27 15:09:44,454 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:09:44,454 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-01-27 15:09:44,454 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 15:09:44,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:44,455 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-01-27 15:09:44,455 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-27 15:09:44,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:44,461 INFO L85 PathProgramCache]: Analyzing trace with hash 106924488, now seen corresponding path program 1 times [2024-01-27 15:09:44,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:44,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45193506] [2024-01-27 15:09:44,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:44,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:09:44,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 15:09:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:09:44,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 15:09:44,670 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 15:09:44,672 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-01-27 15:09:44,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-01-27 15:09:44,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-01-27 15:09:44,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:09:44,676 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-01-27 15:09:44,705 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-01-27 15:09:44,706 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-01-27 15:09:44,717 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 15:09:44,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 18 transitions, 46 flow [2024-01-27 15:09:44,723 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-01-27 15:09:44,733 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:09:44,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2024-01-27 15:09:44,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 18 transitions, 46 flow [2024-01-27 15:09:44,734 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 46 flow [2024-01-27 15:09:44,735 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:09:44,736 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;@10b2682c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:09:44,736 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-01-27 15:09:44,739 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:09:44,743 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-01-27 15:09:44,743 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 15:09:44,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:44,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 15:09:44,744 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-01-27 15:09:44,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash 124108086, now seen corresponding path program 1 times [2024-01-27 15:09:44,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:44,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062252729] [2024-01-27 15:09:44,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:44,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:09:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:09:44,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:09:44,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062252729] [2024-01-27 15:09:44,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062252729] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:09:44,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:09:44,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 15:09:44,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827872432] [2024-01-27 15:09:44,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:09:44,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:09:44,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:09:45,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:09:45,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:09:45,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2024-01-27 15:09:45,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-01-27 15:09:45,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:09:45,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2024-01-27 15:09:45,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:09:45,087 INFO L124 PetriNetUnfolderBase]: 47/107 cut-off events. [2024-01-27 15:09:45,088 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-27 15:09:45,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 107 events. 47/107 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 367 event pairs, 15 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 111. Up to 77 conditions per place. [2024-01-27 15:09:45,093 INFO L140 encePairwiseOnDemand]: 12/18 looper letters, 15 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2024-01-27 15:09:45,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 23 transitions, 97 flow [2024-01-27 15:09:45,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:09:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:09:45,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2024-01-27 15:09:45,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2024-01-27 15:09:45,103 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 3 states and 37 transitions. [2024-01-27 15:09:45,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 23 transitions, 97 flow [2024-01-27 15:09:45,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 97 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:09:45,107 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 65 flow [2024-01-27 15:09:45,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2024-01-27 15:09:45,111 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2024-01-27 15:09:45,111 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 65 flow [2024-01-27 15:09:45,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-01-27 15:09:45,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:45,112 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2024-01-27 15:09:45,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:09:45,112 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-01-27 15:09:45,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:45,112 INFO L85 PathProgramCache]: Analyzing trace with hash -991531367, now seen corresponding path program 1 times [2024-01-27 15:09:45,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:45,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641566961] [2024-01-27 15:09:45,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:45,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:09:45,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 15:09:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:09:45,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 15:09:45,140 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 15:09:45,141 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-01-27 15:09:45,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-01-27 15:09:45,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-01-27 15:09:45,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-01-27 15:09:45,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:09:45,141 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-01-27 15:09:45,142 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-01-27 15:09:45,142 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-01-27 15:09:45,153 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 15:09:45,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 68 flow [2024-01-27 15:09:45,159 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-01-27 15:09:45,159 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-27 15:09:45,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 0/31 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 67 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2024-01-27 15:09:45,159 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 25 transitions, 68 flow [2024-01-27 15:09:45,159 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 68 flow [2024-01-27 15:09:45,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:09:45,161 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;@10b2682c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:09:45,161 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-01-27 15:09:45,163 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:09:45,163 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-01-27 15:09:45,163 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 15:09:45,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:45,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 15:09:45,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-01-27 15:09:45,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:45,163 INFO L85 PathProgramCache]: Analyzing trace with hash 147971477, now seen corresponding path program 1 times [2024-01-27 15:09:45,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:45,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19974068] [2024-01-27 15:09:45,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:45,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:09:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:09:45,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:09:45,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19974068] [2024-01-27 15:09:45,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19974068] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:09:45,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:09:45,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 15:09:45,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242118833] [2024-01-27 15:09:45,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:09:45,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:09:45,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:09:45,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:09:45,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:09:45,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2024-01-27 15:09:45,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-01-27 15:09:45,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:09:45,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2024-01-27 15:09:45,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:09:45,398 INFO L124 PetriNetUnfolderBase]: 447/731 cut-off events. [2024-01-27 15:09:45,398 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2024-01-27 15:09:45,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 731 events. 447/731 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3394 event pairs, 161 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 464. Up to 653 conditions per place. [2024-01-27 15:09:45,405 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 22 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2024-01-27 15:09:45,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 148 flow [2024-01-27 15:09:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:09:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:09:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-01-27 15:09:45,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6933333333333334 [2024-01-27 15:09:45,406 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 68 flow. Second operand 3 states and 52 transitions. [2024-01-27 15:09:45,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 148 flow [2024-01-27 15:09:45,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 144 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-01-27 15:09:45,407 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 94 flow [2024-01-27 15:09:45,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-01-27 15:09:45,408 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2024-01-27 15:09:45,408 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 94 flow [2024-01-27 15:09:45,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-01-27 15:09:45,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:45,409 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2024-01-27 15:09:45,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 15:09:45,409 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-01-27 15:09:45,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:45,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1492942590, now seen corresponding path program 1 times [2024-01-27 15:09:45,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:45,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237371052] [2024-01-27 15:09:45,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:45,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:09:45,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 15:09:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:09:45,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 15:09:45,431 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 15:09:45,431 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-01-27 15:09:45,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-01-27 15:09:45,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-01-27 15:09:45,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-01-27 15:09:45,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-01-27 15:09:45,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 15:09:45,432 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-01-27 15:09:45,432 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-01-27 15:09:45,432 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-01-27 15:09:45,445 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 15:09:45,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 92 flow [2024-01-27 15:09:45,453 INFO L124 PetriNetUnfolderBase]: 0/40 cut-off events. [2024-01-27 15:09:45,454 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-01-27 15:09:45,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 40 events. 0/40 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2024-01-27 15:09:45,454 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 32 transitions, 92 flow [2024-01-27 15:09:45,455 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 32 transitions, 92 flow [2024-01-27 15:09:45,456 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:09:45,456 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;@10b2682c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:09:45,456 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-01-27 15:09:45,458 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:09:45,458 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-01-27 15:09:45,458 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 15:09:45,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:45,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 15:09:45,459 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 15:09:45,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:45,459 INFO L85 PathProgramCache]: Analyzing trace with hash 178515195, now seen corresponding path program 1 times [2024-01-27 15:09:45,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:45,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013271169] [2024-01-27 15:09:45,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:45,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:09:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:09:45,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:09:45,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013271169] [2024-01-27 15:09:45,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013271169] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:09:45,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:09:45,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 15:09:45,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122450268] [2024-01-27 15:09:45,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:09:45,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:09:45,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:09:45,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:09:45,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:09:45,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-01-27 15:09:45,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:09:45,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:09:45,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-01-27 15:09:45,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:09:45,923 INFO L124 PetriNetUnfolderBase]: 3473/4901 cut-off events. [2024-01-27 15:09:45,923 INFO L125 PetriNetUnfolderBase]: For 1240/1240 co-relation queries the response was YES. [2024-01-27 15:09:45,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10386 conditions, 4901 events. 3473/4901 cut-off events. For 1240/1240 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 25230 event pairs, 1433 based on Foata normal form. 0/3983 useless extension candidates. Maximal degree in co-relation 1769. Up to 4711 conditions per place. [2024-01-27 15:09:45,958 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 29 selfloop transitions, 5 changer transitions 0/43 dead transitions. [2024-01-27 15:09:45,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 203 flow [2024-01-27 15:09:45,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:09:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:09:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-01-27 15:09:45,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2024-01-27 15:09:45,974 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 92 flow. Second operand 3 states and 67 transitions. [2024-01-27 15:09:45,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 203 flow [2024-01-27 15:09:45,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 191 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-01-27 15:09:45,976 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 123 flow [2024-01-27 15:09:45,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2024-01-27 15:09:45,977 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2024-01-27 15:09:45,977 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 123 flow [2024-01-27 15:09:45,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:09:45,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:45,978 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2024-01-27 15:09:45,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 15:09:45,978 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-01-27 15:09:45,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:45,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1121575831, now seen corresponding path program 1 times [2024-01-27 15:09:45,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:45,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576617314] [2024-01-27 15:09:45,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:45,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:09:45,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 15:09:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:09:46,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 15:09:46,001 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 15:09:46,002 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-01-27 15:09:46,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-01-27 15:09:46,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-01-27 15:09:46,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-01-27 15:09:46,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-01-27 15:09:46,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-01-27 15:09:46,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 15:09:46,003 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-01-27 15:09:46,003 WARN L234 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-01-27 15:09:46,004 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-01-27 15:09:46,020 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 15:09:46,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 39 transitions, 118 flow [2024-01-27 15:09:46,028 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2024-01-27 15:09:46,028 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-01-27 15:09:46,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 49 events. 0/49 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 125 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2024-01-27 15:09:46,029 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 39 transitions, 118 flow [2024-01-27 15:09:46,030 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 39 transitions, 118 flow [2024-01-27 15:09:46,031 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:09:46,032 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;@10b2682c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:09:46,032 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-01-27 15:09:46,033 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:09:46,033 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-01-27 15:09:46,034 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 15:09:46,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:46,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 15:09:46,034 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-01-27 15:09:46,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:46,034 INFO L85 PathProgramCache]: Analyzing trace with hash 215738664, now seen corresponding path program 1 times [2024-01-27 15:09:46,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:46,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480104604] [2024-01-27 15:09:46,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:46,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:09:46,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:09:46,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:09:46,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480104604] [2024-01-27 15:09:46,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480104604] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:09:46,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:09:46,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 15:09:46,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331739386] [2024-01-27 15:09:46,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:09:46,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:09:46,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:09:46,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:09:46,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:09:46,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-27 15:09:46,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-01-27 15:09:46,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:09:46,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-27 15:09:46,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:09:48,099 INFO L124 PetriNetUnfolderBase]: 24009/31313 cut-off events. [2024-01-27 15:09:48,105 INFO L125 PetriNetUnfolderBase]: For 9784/9784 co-relation queries the response was YES. [2024-01-27 15:09:48,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66523 conditions, 31313 events. 24009/31313 cut-off events. For 9784/9784 co-relation queries the response was YES. Maximal size of possible extension queue 1441. Compared 169789 event pairs, 11031 based on Foata normal form. 0/24923 useless extension candidates. Maximal degree in co-relation 10509. Up to 30867 conditions per place. [2024-01-27 15:09:48,291 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 36 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2024-01-27 15:09:48,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 262 flow [2024-01-27 15:09:48,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:09:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:09:48,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-01-27 15:09:48,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7008547008547008 [2024-01-27 15:09:48,293 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 118 flow. Second operand 3 states and 82 transitions. [2024-01-27 15:09:48,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 262 flow [2024-01-27 15:09:48,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 238 flow, removed 12 selfloop flow, removed 0 redundant places. [2024-01-27 15:09:48,299 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 152 flow [2024-01-27 15:09:48,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2024-01-27 15:09:48,300 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-01-27 15:09:48,300 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 152 flow [2024-01-27 15:09:48,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-01-27 15:09:48,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:48,300 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:09:48,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 15:09:48,301 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-01-27 15:09:48,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:48,301 INFO L85 PathProgramCache]: Analyzing trace with hash 884792230, now seen corresponding path program 1 times [2024-01-27 15:09:48,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:48,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842560027] [2024-01-27 15:09:48,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:48,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:09:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:09:48,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:09:48,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842560027] [2024-01-27 15:09:48,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842560027] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:09:48,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:09:48,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:09:48,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697833028] [2024-01-27 15:09:48,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:09:48,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:09:48,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:09:48,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:09:48,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:09:48,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-27 15:09:48,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-01-27 15:09:48,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:09:48,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-27 15:09:48,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:09:49,601 INFO L124 PetriNetUnfolderBase]: 13439/19846 cut-off events. [2024-01-27 15:09:49,601 INFO L125 PetriNetUnfolderBase]: For 7894/7894 co-relation queries the response was YES. [2024-01-27 15:09:49,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41509 conditions, 19846 events. 13439/19846 cut-off events. For 7894/7894 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 135205 event pairs, 5255 based on Foata normal form. 5668/24391 useless extension candidates. Maximal degree in co-relation 32130. Up to 15240 conditions per place. [2024-01-27 15:09:49,714 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 32 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2024-01-27 15:09:49,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 256 flow [2024-01-27 15:09:49,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:09:49,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:09:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-01-27 15:09:49,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2024-01-27 15:09:49,716 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 152 flow. Second operand 3 states and 75 transitions. [2024-01-27 15:09:49,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 256 flow [2024-01-27 15:09:49,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:09:49,719 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 161 flow [2024-01-27 15:09:49,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2024-01-27 15:09:49,719 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2024-01-27 15:09:49,720 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 161 flow [2024-01-27 15:09:49,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-01-27 15:09:49,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:49,720 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:09:49,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 15:09:49,720 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-01-27 15:09:49,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:49,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1312859396, now seen corresponding path program 1 times [2024-01-27 15:09:49,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:49,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791942742] [2024-01-27 15:09:49,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:49,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:09:49,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 15:09:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:09:49,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 15:09:49,741 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 15:09:49,741 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-01-27 15:09:49,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-01-27 15:09:49,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2024-01-27 15:09:49,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2024-01-27 15:09:49,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-01-27 15:09:49,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-01-27 15:09:49,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-01-27 15:09:49,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 15:09:49,742 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-01-27 15:09:49,743 WARN L234 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-01-27 15:09:49,743 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-01-27 15:09:49,759 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 15:09:49,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 46 transitions, 146 flow [2024-01-27 15:09:49,764 INFO L124 PetriNetUnfolderBase]: 0/58 cut-off events. [2024-01-27 15:09:49,764 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-01-27 15:09:49,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 58 events. 0/58 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 148 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2024-01-27 15:09:49,765 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 46 transitions, 146 flow [2024-01-27 15:09:49,765 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 46 transitions, 146 flow [2024-01-27 15:09:49,766 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:09:49,766 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;@10b2682c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:09:49,766 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-01-27 15:09:49,767 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:09:49,767 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-01-27 15:09:49,767 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 15:09:49,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:49,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 15:09:49,768 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-01-27 15:09:49,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:49,768 INFO L85 PathProgramCache]: Analyzing trace with hash 259642460, now seen corresponding path program 1 times [2024-01-27 15:09:49,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:49,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552589498] [2024-01-27 15:09:49,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:49,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:09:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:09:49,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:09:49,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552589498] [2024-01-27 15:09:49,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552589498] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:09:49,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:09:49,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 15:09:49,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172911645] [2024-01-27 15:09:49,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:09:49,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:09:49,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:09:49,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:09:49,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:09:49,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-01-27 15:09:49,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-01-27 15:09:49,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:09:49,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-01-27 15:09:49,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:10:00,057 INFO L124 PetriNetUnfolderBase]: 153983/191303 cut-off events. [2024-01-27 15:10:00,060 INFO L125 PetriNetUnfolderBase]: For 71426/71426 co-relation queries the response was YES. [2024-01-27 15:10:00,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406806 conditions, 191303 events. 153983/191303 cut-off events. For 71426/71426 co-relation queries the response was YES. Maximal size of possible extension queue 6618. Compared 1068945 event pairs, 76663 based on Foata normal form. 0/150265 useless extension candidates. Maximal degree in co-relation 67205. Up to 190281 conditions per place. [2024-01-27 15:10:01,646 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 43 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-01-27 15:10:01,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 325 flow [2024-01-27 15:10:01,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:10:01,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:10:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-01-27 15:10:01,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7028985507246377 [2024-01-27 15:10:01,650 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 146 flow. Second operand 3 states and 97 transitions. [2024-01-27 15:10:01,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 325 flow [2024-01-27 15:10:01,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 63 transitions, 285 flow, removed 20 selfloop flow, removed 0 redundant places. [2024-01-27 15:10:01,670 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 181 flow [2024-01-27 15:10:01,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-01-27 15:10:01,671 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2024-01-27 15:10:01,671 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 181 flow [2024-01-27 15:10:01,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-01-27 15:10:01,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:10:01,672 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:10:01,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 15:10:01,672 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-01-27 15:10:01,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:10:01,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1616412648, now seen corresponding path program 1 times [2024-01-27 15:10:01,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:10:01,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008250871] [2024-01-27 15:10:01,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:10:01,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:10:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:10:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:10:01,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:10:01,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008250871] [2024-01-27 15:10:01,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008250871] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:10:01,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:10:01,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:10:01,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103260444] [2024-01-27 15:10:01,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:10:01,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:10:01,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:10:01,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:10:01,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:10:01,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-01-27 15:10:01,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:10:01,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:10:01,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-01-27 15:10:01,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:10:08,102 INFO L124 PetriNetUnfolderBase]: 78146/108409 cut-off events. [2024-01-27 15:10:08,102 INFO L125 PetriNetUnfolderBase]: For 48322/48322 co-relation queries the response was YES. [2024-01-27 15:10:08,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224306 conditions, 108409 events. 78146/108409 cut-off events. For 48322/48322 co-relation queries the response was YES. Maximal size of possible extension queue 4489. Compared 790940 event pairs, 35211 based on Foata normal form. 34312/134944 useless extension candidates. Maximal degree in co-relation 175157. Up to 83683 conditions per place. [2024-01-27 15:10:08,915 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 38 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2024-01-27 15:10:08,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 63 transitions, 306 flow [2024-01-27 15:10:08,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:10:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:10:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-01-27 15:10:08,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.644927536231884 [2024-01-27 15:10:08,918 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 181 flow. Second operand 3 states and 89 transitions. [2024-01-27 15:10:08,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 63 transitions, 306 flow [2024-01-27 15:10:08,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:10:08,932 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 192 flow [2024-01-27 15:10:08,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-01-27 15:10:08,933 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2024-01-27 15:10:08,933 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 192 flow [2024-01-27 15:10:08,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:10:08,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:10:08,933 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:10:08,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 15:10:08,933 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-01-27 15:10:08,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:10:08,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1286908901, now seen corresponding path program 1 times [2024-01-27 15:10:08,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:10:08,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170531090] [2024-01-27 15:10:08,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:10:08,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:10:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:10:08,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 15:10:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:10:08,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 15:10:08,958 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 15:10:08,959 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-01-27 15:10:08,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-01-27 15:10:08,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-01-27 15:10:08,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-01-27 15:10:08,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-01-27 15:10:08,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-01-27 15:10:08,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2024-01-27 15:10:08,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2024-01-27 15:10:08,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 15:10:08,964 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-01-27 15:10:08,966 WARN L234 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-01-27 15:10:08,966 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-01-27 15:10:08,991 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 15:10:08,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 53 transitions, 176 flow [2024-01-27 15:10:08,999 INFO L124 PetriNetUnfolderBase]: 0/67 cut-off events. [2024-01-27 15:10:08,999 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-01-27 15:10:08,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 67 events. 0/67 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 184 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2024-01-27 15:10:08,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 53 transitions, 176 flow [2024-01-27 15:10:09,000 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 53 transitions, 176 flow [2024-01-27 15:10:09,003 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:10:09,005 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;@10b2682c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:10:09,005 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-01-27 15:10:09,006 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:10:09,006 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-01-27 15:10:09,006 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 15:10:09,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:10:09,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 15:10:09,007 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2024-01-27 15:10:09,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:10:09,007 INFO L85 PathProgramCache]: Analyzing trace with hash 310226967, now seen corresponding path program 1 times [2024-01-27 15:10:09,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:10:09,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736358508] [2024-01-27 15:10:09,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:10:09,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:10:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:10:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:10:09,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:10:09,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736358508] [2024-01-27 15:10:09,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736358508] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:10:09,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:10:09,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 15:10:09,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182686624] [2024-01-27 15:10:09,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:10:09,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:10:09,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:10:09,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:10:09,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:10:09,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2024-01-27 15:10:09,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-01-27 15:10:09,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:10:09,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2024-01-27 15:10:09,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand