./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a 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/weaver/chl-poker-hand-symm.wvr.c -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 83dad307cba3d7607e136206fd160e874fd8a32bc88cbef3e5973f117a7651cc --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 14:34:35,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 14:34:36,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 14:34:36,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 14:34:36,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 14:34:36,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 14:34:36,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 14:34:36,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 14:34:36,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 14:34:36,059 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 14:34:36,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 14:34:36,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 14:34:36,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 14:34:36,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 14:34:36,061 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 14:34:36,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 14:34:36,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 14:34:36,061 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 14:34:36,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 14:34:36,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 14:34:36,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 14:34:36,063 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 14:34:36,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 14:34:36,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 14:34:36,064 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 14:34:36,064 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 14:34:36,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 14:34:36,064 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 14:34:36,065 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 14:34:36,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 14:34:36,066 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 14:34:36,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 14:34:36,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:34:36,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 14:34:36,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 14:34:36,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 14:34:36,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 14:34:36,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 14:34:36,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 14:34:36,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 14:34:36,068 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 14:34:36,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 14:34:36,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 14:34:36,069 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 -> 83dad307cba3d7607e136206fd160e874fd8a32bc88cbef3e5973f117a7651cc Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 14:34:36,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 14:34:36,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 14:34:36,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 14:34:36,371 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 14:34:36,371 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 14:34:36,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c [2024-02-19 14:34:37,602 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 14:34:37,796 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 14:34:37,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c [2024-02-19 14:34:37,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2955bc84/1087b89ea02348d59dacebf8cb9bc1f9/FLAG68e6c461f [2024-02-19 14:34:37,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2955bc84/1087b89ea02348d59dacebf8cb9bc1f9 [2024-02-19 14:34:37,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 14:34:37,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 14:34:37,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 14:34:37,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 14:34:37,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 14:34:37,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:34:37" (1/1) ... [2024-02-19 14:34:37,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b7d3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:37, skipping insertion in model container [2024-02-19 14:34:37,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:34:37" (1/1) ... [2024-02-19 14:34:37,867 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:34:38,167 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c[12821,12834] [2024-02-19 14:34:38,187 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:34:38,199 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 14:34:38,252 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c[12821,12834] [2024-02-19 14:34:38,254 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:34:38,276 INFO L206 MainTranslator]: Completed translation [2024-02-19 14:34:38,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:38 WrapperNode [2024-02-19 14:34:38,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 14:34:38,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 14:34:38,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 14:34:38,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 14:34:38,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:38" (1/1) ... [2024-02-19 14:34:38,312 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:38" (1/1) ... [2024-02-19 14:34:38,378 INFO L138 Inliner]: procedures = 25, calls = 307, calls flagged for inlining = 69, calls inlined = 97, statements flattened = 1553 [2024-02-19 14:34:38,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 14:34:38,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 14:34:38,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 14:34:38,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 14:34:38,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:38" (1/1) ... [2024-02-19 14:34:38,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:38" (1/1) ... [2024-02-19 14:34:38,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:38" (1/1) ... [2024-02-19 14:34:38,417 INFO L175 MemorySlicer]: Split 190 memory accesses to 4 slices as follows [2, 2, 2, 184]. 97 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 10 writes are split as follows [0, 1, 1, 8]. [2024-02-19 14:34:38,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:38" (1/1) ... [2024-02-19 14:34:38,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:38" (1/1) ... [2024-02-19 14:34:38,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:38" (1/1) ... [2024-02-19 14:34:38,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:38" (1/1) ... [2024-02-19 14:34:38,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:38" (1/1) ... [2024-02-19 14:34:38,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:38" (1/1) ... [2024-02-19 14:34:38,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 14:34:38,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 14:34:38,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 14:34:38,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 14:34:38,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:38" (1/1) ... [2024-02-19 14:34:38,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:34:38,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:34:38,546 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-02-19 14:34:38,575 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-02-19 14:34:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 14:34:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 14:34:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 14:34:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 14:34:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 14:34:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 14:34:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 14:34:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 14:34:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 14:34:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 14:34:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 14:34:38,601 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 14:34:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 14:34:38,601 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 14:34:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 14:34:38,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 14:34:38,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 14:34:38,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 14:34:38,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 14:34:38,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 14:34:38,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 14:34:38,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 14:34:38,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 14:34:38,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 14:34:38,604 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 14:34:38,775 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 14:34:38,777 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 14:34:39,849 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 14:34:39,850 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 14:34:40,918 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 14:34:40,918 INFO L320 CfgBuilder]: Removed 12 assume(true) statements. [2024-02-19 14:34:40,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:34:40 BoogieIcfgContainer [2024-02-19 14:34:40,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 14:34:40,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 14:34:40,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 14:34:40,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 14:34:40,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 02:34:37" (1/3) ... [2024-02-19 14:34:40,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dce5158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:34:40, skipping insertion in model container [2024-02-19 14:34:40,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:38" (2/3) ... [2024-02-19 14:34:40,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dce5158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:34:40, skipping insertion in model container [2024-02-19 14:34:40,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:34:40" (3/3) ... [2024-02-19 14:34:40,926 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-poker-hand-symm.wvr.c [2024-02-19 14:34:40,942 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 14:34:40,942 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 14:34:40,942 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 14:34:41,188 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-19 14:34:41,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 95 transitions, 204 flow [2024-02-19 14:34:41,250 INFO L124 PetriNetUnfolderBase]: 28/93 cut-off events. [2024-02-19 14:34:41,250 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 14:34:41,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 93 events. 28/93 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 252 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 71. Up to 7 conditions per place. [2024-02-19 14:34:41,254 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 95 transitions, 204 flow [2024-02-19 14:34:41,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 92 transitions, 196 flow [2024-02-19 14:34:41,263 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:34:41,268 INFO L369 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=All, 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;@1c88b503, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:34:41,268 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 14:34:41,294 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:34:41,295 INFO L124 PetriNetUnfolderBase]: 28/91 cut-off events. [2024-02-19 14:34:41,295 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 14:34:41,295 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:41,296 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:34:41,296 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:34:41,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:41,300 INFO L85 PathProgramCache]: Analyzing trace with hash 526357867, now seen corresponding path program 1 times [2024-02-19 14:34:41,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:41,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878859226] [2024-02-19 14:34:41,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:41,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:34:41,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:41,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878859226] [2024-02-19 14:34:41,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878859226] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:41,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:41,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:34:41,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388335475] [2024-02-19 14:34:41,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:41,850 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:34:41,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:41,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:34:41,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:34:41,872 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:34:41,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 92 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-02-19 14:34:41,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:41,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:34:41,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:42,750 INFO L124 PetriNetUnfolderBase]: 2032/3104 cut-off events. [2024-02-19 14:34:42,751 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-02-19 14:34:42,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6187 conditions, 3104 events. 2032/3104 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16287 event pairs, 1320 based on Foata normal form. 176/2546 useless extension candidates. Maximal degree in co-relation 5914. Up to 3010 conditions per place. [2024-02-19 14:34:42,765 INFO L140 encePairwiseOnDemand]: 82/95 looper letters, 77 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2024-02-19 14:34:42,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 92 transitions, 366 flow [2024-02-19 14:34:42,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:34:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:34:42,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-02-19 14:34:42,775 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2024-02-19 14:34:42,778 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 2 predicate places. [2024-02-19 14:34:42,778 INFO L507 AbstractCegarLoop]: Abstraction has has 73 places, 92 transitions, 366 flow [2024-02-19 14:34:42,778 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-02-19 14:34:42,778 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:42,778 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:34:42,779 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 14:34:42,779 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:34:42,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:42,779 INFO L85 PathProgramCache]: Analyzing trace with hash -9668434, now seen corresponding path program 1 times [2024-02-19 14:34:42,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:42,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088366400] [2024-02-19 14:34:42,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:42,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:42,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 14:34:42,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:42,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088366400] [2024-02-19 14:34:42,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088366400] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:42,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:42,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:34:42,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145595690] [2024-02-19 14:34:42,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:42,904 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:34:42,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:42,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:34:42,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:34:42,905 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:34:42,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 92 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02-19 14:34:42,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:42,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:34:42,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:43,575 INFO L124 PetriNetUnfolderBase]: 2032/3109 cut-off events. [2024-02-19 14:34:43,576 INFO L125 PetriNetUnfolderBase]: For 188/242 co-relation queries the response was YES. [2024-02-19 14:34:43,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9210 conditions, 3109 events. 2032/3109 cut-off events. For 188/242 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 16297 event pairs, 1320 based on Foata normal form. 0/2378 useless extension candidates. Maximal degree in co-relation 8808. Up to 3014 conditions per place. [2024-02-19 14:34:43,589 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 83 selfloop transitions, 4 changer transitions 0/94 dead transitions. [2024-02-19 14:34:43,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 94 transitions, 548 flow [2024-02-19 14:34:43,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:34:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:34:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-02-19 14:34:43,591 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3929824561403509 [2024-02-19 14:34:43,591 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 4 predicate places. [2024-02-19 14:34:43,592 INFO L507 AbstractCegarLoop]: Abstraction has has 75 places, 94 transitions, 548 flow [2024-02-19 14:34:43,592 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02-19 14:34:43,592 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:43,592 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:34:43,592 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 14:34:43,593 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:34:43,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash 502434250, now seen corresponding path program 1 times [2024-02-19 14:34:43,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:43,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648280729] [2024-02-19 14:34:43,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:43,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 14:34:43,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:43,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648280729] [2024-02-19 14:34:43,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648280729] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:34:43,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495580785] [2024-02-19 14:34:43,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:43,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:34:43,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:34:43,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:34:43,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-19 14:34:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:44,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 14:34:44,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:34:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:44,111 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:34:44,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495580785] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:44,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-19 14:34:44,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-02-19 14:34:44,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915735417] [2024-02-19 14:34:44,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:44,112 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:34:44,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:44,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:34:44,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:34:44,113 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:34:44,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 94 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-02-19 14:34:44,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:44,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:34:44,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:44,845 INFO L124 PetriNetUnfolderBase]: 2032/3111 cut-off events. [2024-02-19 14:34:44,845 INFO L125 PetriNetUnfolderBase]: For 403/487 co-relation queries the response was YES. [2024-02-19 14:34:44,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12234 conditions, 3111 events. 2032/3111 cut-off events. For 403/487 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 16316 event pairs, 1320 based on Foata normal form. 0/2383 useless extension candidates. Maximal degree in co-relation 11699. Up to 3016 conditions per place. [2024-02-19 14:34:44,865 INFO L140 encePairwiseOnDemand]: 86/95 looper letters, 81 selfloop transitions, 8 changer transitions 0/96 dead transitions. [2024-02-19 14:34:44,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 96 transitions, 738 flow [2024-02-19 14:34:44,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:34:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:34:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-02-19 14:34:44,870 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-02-19 14:34:44,871 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 6 predicate places. [2024-02-19 14:34:44,871 INFO L507 AbstractCegarLoop]: Abstraction has has 77 places, 96 transitions, 738 flow [2024-02-19 14:34:44,872 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-02-19 14:34:44,872 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:44,872 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:34:44,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-02-19 14:34:45,085 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:34:45,086 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:34:45,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:45,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1736364512, now seen corresponding path program 1 times [2024-02-19 14:34:45,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:45,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637649188] [2024-02-19 14:34:45,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:45,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-02-19 14:34:45,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:45,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637649188] [2024-02-19 14:34:45,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637649188] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:34:45,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459818192] [2024-02-19 14:34:45,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:45,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:34:45,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:34:45,254 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:34:45,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-19 14:34:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:45,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-19 14:34:45,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:34:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-02-19 14:34:45,639 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:34:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-02-19 14:34:45,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459818192] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:34:45,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:34:45,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2024-02-19 14:34:45,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300945943] [2024-02-19 14:34:45,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:34:45,660 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 14:34:45,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:45,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 14:34:45,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-02-19 14:34:45,661 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:34:45,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 96 transitions, 738 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 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-02-19 14:34:45,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:45,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:34:45,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:46,412 INFO L124 PetriNetUnfolderBase]: 2032/3132 cut-off events. [2024-02-19 14:34:46,412 INFO L125 PetriNetUnfolderBase]: For 738/906 co-relation queries the response was YES. [2024-02-19 14:34:46,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15369 conditions, 3132 events. 2032/3132 cut-off events. For 738/906 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16273 event pairs, 1320 based on Foata normal form. 0/2398 useless extension candidates. Maximal degree in co-relation 14587. Up to 3040 conditions per place. [2024-02-19 14:34:46,436 INFO L140 encePairwiseOnDemand]: 78/95 looper letters, 73 selfloop transitions, 40 changer transitions 0/120 dead transitions. [2024-02-19 14:34:46,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 120 transitions, 1156 flow [2024-02-19 14:34:46,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-19 14:34:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-19 14:34:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2024-02-19 14:34:46,438 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.275 [2024-02-19 14:34:46,439 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 13 predicate places. [2024-02-19 14:34:46,439 INFO L507 AbstractCegarLoop]: Abstraction has has 84 places, 120 transitions, 1156 flow [2024-02-19 14:34:46,439 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 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-02-19 14:34:46,439 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:46,439 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:34:46,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-19 14:34:46,652 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-02-19 14:34:46,653 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:34:46,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:46,654 INFO L85 PathProgramCache]: Analyzing trace with hash 258007497, now seen corresponding path program 2 times [2024-02-19 14:34:46,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:46,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353327513] [2024-02-19 14:34:46,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:46,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-02-19 14:34:46,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:46,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353327513] [2024-02-19 14:34:46,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353327513] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:34:46,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956445712] [2024-02-19 14:34:46,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 14:34:46,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:34:46,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:34:46,949 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:34:46,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-19 14:34:47,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-19 14:34:47,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:34:47,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 14:34:47,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:34:47,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:34:47,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2024-02-19 14:34:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-02-19 14:34:47,398 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:34:47,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956445712] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:47,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-19 14:34:47,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-02-19 14:34:47,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729181573] [2024-02-19 14:34:47,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:47,402 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:34:47,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:47,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:34:47,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-02-19 14:34:47,405 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:34:47,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 120 transitions, 1156 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-19 14:34:47,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:47,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:34:47,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:48,523 INFO L124 PetriNetUnfolderBase]: 3096/4864 cut-off events. [2024-02-19 14:34:48,524 INFO L125 PetriNetUnfolderBase]: For 2517/2789 co-relation queries the response was YES. [2024-02-19 14:34:48,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28209 conditions, 4864 events. 3096/4864 cut-off events. For 2517/2789 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 28026 event pairs, 1050 based on Foata normal form. 1/3787 useless extension candidates. Maximal degree in co-relation 26608. Up to 4645 conditions per place. [2024-02-19 14:34:48,557 INFO L140 encePairwiseOnDemand]: 74/95 looper letters, 180 selfloop transitions, 22 changer transitions 10/219 dead transitions. [2024-02-19 14:34:48,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 219 transitions, 2588 flow [2024-02-19 14:34:48,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:34:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:34:48,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2024-02-19 14:34:48,559 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.47789473684210526 [2024-02-19 14:34:48,559 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 17 predicate places. [2024-02-19 14:34:48,559 INFO L507 AbstractCegarLoop]: Abstraction has has 88 places, 219 transitions, 2588 flow [2024-02-19 14:34:48,560 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-19 14:34:48,560 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:48,560 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:34:48,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-02-19 14:34:48,772 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:34:48,775 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:34:48,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:48,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1724753711, now seen corresponding path program 3 times [2024-02-19 14:34:48,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:48,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594627141] [2024-02-19 14:34:48,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:48,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:48,993 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-02-19 14:34:48,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:48,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594627141] [2024-02-19 14:34:48,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594627141] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:34:48,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537965080] [2024-02-19 14:34:48,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 14:34:48,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:34:48,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:34:49,009 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:34:49,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-19 14:34:49,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-02-19 14:34:49,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:34:49,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 14:34:49,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:34:49,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:34:49,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2024-02-19 14:34:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-02-19 14:34:49,455 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:34:49,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537965080] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:49,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-19 14:34:49,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-02-19 14:34:49,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126026917] [2024-02-19 14:34:49,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:49,457 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:34:49,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:49,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:34:49,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-02-19 14:34:49,457 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:34:49,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 219 transitions, 2588 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-19 14:34:49,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:49,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:34:49,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:50,768 INFO L124 PetriNetUnfolderBase]: 3216/5088 cut-off events. [2024-02-19 14:34:50,769 INFO L125 PetriNetUnfolderBase]: For 3751/4091 co-relation queries the response was YES. [2024-02-19 14:34:50,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34424 conditions, 5088 events. 3216/5088 cut-off events. For 3751/4091 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 29900 event pairs, 1066 based on Foata normal form. 21/3999 useless extension candidates. Maximal degree in co-relation 32453. Up to 4868 conditions per place. [2024-02-19 14:34:50,805 INFO L140 encePairwiseOnDemand]: 74/95 looper letters, 210 selfloop transitions, 22 changer transitions 20/259 dead transitions. [2024-02-19 14:34:50,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 259 transitions, 3584 flow [2024-02-19 14:34:50,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:34:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:34:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2024-02-19 14:34:50,807 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2024-02-19 14:34:50,807 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 21 predicate places. [2024-02-19 14:34:50,807 INFO L507 AbstractCegarLoop]: Abstraction has has 92 places, 259 transitions, 3584 flow [2024-02-19 14:34:50,808 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-19 14:34:50,808 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:50,815 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:34:50,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-19 14:34:51,028 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:34:51,028 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:34:51,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:51,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1398570761, now seen corresponding path program 1 times [2024-02-19 14:34:51,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:51,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504036406] [2024-02-19 14:34:51,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:51,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-02-19 14:34:51,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:51,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504036406] [2024-02-19 14:34:51,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504036406] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:34:51,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249913192] [2024-02-19 14:34:51,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:51,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:34:51,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:34:51,253 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:34:51,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-19 14:34:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:51,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 14:34:51,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:34:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-02-19 14:34:51,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:34:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-02-19 14:34:51,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249913192] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:34:51,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:34:51,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-02-19 14:34:51,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100198119] [2024-02-19 14:34:51,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:34:51,753 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-19 14:34:51,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:51,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-19 14:34:51,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2024-02-19 14:34:51,754 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:34:51,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 259 transitions, 3584 flow. Second operand has 13 states, 13 states have (on average 12.461538461538462) internal successors, (162), 13 states have internal predecessors, (162), 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-02-19 14:34:51,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:51,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:34:51,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:52,981 INFO L124 PetriNetUnfolderBase]: 3216/5092 cut-off events. [2024-02-19 14:34:52,981 INFO L125 PetriNetUnfolderBase]: For 5215/5603 co-relation queries the response was YES. [2024-02-19 14:34:52,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39326 conditions, 5092 events. 3216/5092 cut-off events. For 5215/5603 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 29861 event pairs, 1066 based on Foata normal form. 0/3982 useless extension candidates. Maximal degree in co-relation 37050. Up to 4872 conditions per place. [2024-02-19 14:34:53,052 INFO L140 encePairwiseOnDemand]: 78/95 looper letters, 192 selfloop transitions, 44 changer transitions 20/263 dead transitions. [2024-02-19 14:34:53,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 263 transitions, 4152 flow [2024-02-19 14:34:53,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-19 14:34:53,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-19 14:34:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2024-02-19 14:34:53,054 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.21052631578947367 [2024-02-19 14:34:53,054 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 31 predicate places. [2024-02-19 14:34:53,055 INFO L507 AbstractCegarLoop]: Abstraction has has 102 places, 263 transitions, 4152 flow [2024-02-19 14:34:53,055 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.461538461538462) internal successors, (162), 13 states have internal predecessors, (162), 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-02-19 14:34:53,055 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:53,055 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:34:53,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-02-19 14:34:53,268 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:34:53,269 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:34:53,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:53,269 INFO L85 PathProgramCache]: Analyzing trace with hash -726520865, now seen corresponding path program 2 times [2024-02-19 14:34:53,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:53,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048515991] [2024-02-19 14:34:53,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:53,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-02-19 14:34:53,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:53,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048515991] [2024-02-19 14:34:53,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048515991] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:34:53,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319879620] [2024-02-19 14:34:53,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 14:34:53,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:34:53,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:34:53,489 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:34:53,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-02-19 14:34:53,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-19 14:34:53,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:34:53,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 14:34:53,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:34:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-02-19 14:34:53,903 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:34:53,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319879620] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:53,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-19 14:34:53,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-02-19 14:34:53,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461074821] [2024-02-19 14:34:53,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:53,904 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:34:53,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:53,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:34:53,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-02-19 14:34:53,905 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:34:53,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 263 transitions, 4152 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-02-19 14:34:53,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:53,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:34:53,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:55,077 INFO L124 PetriNetUnfolderBase]: 3352/5460 cut-off events. [2024-02-19 14:34:55,077 INFO L125 PetriNetUnfolderBase]: For 8660/8940 co-relation queries the response was YES. [2024-02-19 14:34:55,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46959 conditions, 5460 events. 3352/5460 cut-off events. For 8660/8940 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 33551 event pairs, 536 based on Foata normal form. 68/4371 useless extension candidates. Maximal degree in co-relation 43717. Up to 5168 conditions per place. [2024-02-19 14:34:55,117 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 283 selfloop transitions, 24 changer transitions 42/356 dead transitions. [2024-02-19 14:34:55,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 356 transitions, 6359 flow [2024-02-19 14:34:55,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:34:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:34:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-02-19 14:34:55,118 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2024-02-19 14:34:55,132 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 33 predicate places. [2024-02-19 14:34:55,132 INFO L507 AbstractCegarLoop]: Abstraction has has 104 places, 356 transitions, 6359 flow [2024-02-19 14:34:55,132 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-02-19 14:34:55,133 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:55,133 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:34:55,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-02-19 14:34:55,348 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:34:55,348 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:34:55,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:55,349 INFO L85 PathProgramCache]: Analyzing trace with hash 751125893, now seen corresponding path program 3 times [2024-02-19 14:34:55,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:55,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331698448] [2024-02-19 14:34:55,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:55,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-02-19 14:34:55,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:55,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331698448] [2024-02-19 14:34:55,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331698448] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:34:55,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19926725] [2024-02-19 14:34:55,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 14:34:55,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:34:55,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:34:55,641 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:34:55,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-02-19 14:34:56,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-02-19 14:34:56,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:34:56,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 14:34:56,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:34:56,080 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-02-19 14:34:56,081 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:34:56,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19926725] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:56,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-19 14:34:56,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-02-19 14:34:56,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332542715] [2024-02-19 14:34:56,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:56,082 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:34:56,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:56,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:34:56,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-02-19 14:34:56,083 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:34:56,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 356 transitions, 6359 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-02-19 14:34:56,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:56,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:34:56,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:57,315 INFO L124 PetriNetUnfolderBase]: 3292/5380 cut-off events. [2024-02-19 14:34:57,315 INFO L125 PetriNetUnfolderBase]: For 10292/10536 co-relation queries the response was YES. [2024-02-19 14:34:57,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51509 conditions, 5380 events. 3292/5380 cut-off events. For 10292/10536 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 32934 event pairs, 536 based on Foata normal form. 60/4286 useless extension candidates. Maximal degree in co-relation 48040. Up to 5108 conditions per place. [2024-02-19 14:34:57,348 INFO L140 encePairwiseOnDemand]: 81/95 looper letters, 265 selfloop transitions, 0 changer transitions 72/344 dead transitions. [2024-02-19 14:34:57,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 344 transitions, 6817 flow [2024-02-19 14:34:57,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:34:57,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:34:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2024-02-19 14:34:57,349 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5403508771929825 [2024-02-19 14:34:57,350 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 35 predicate places. [2024-02-19 14:34:57,350 INFO L507 AbstractCegarLoop]: Abstraction has has 106 places, 344 transitions, 6817 flow [2024-02-19 14:34:57,350 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-02-19 14:34:57,350 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:57,351 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:34:57,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-02-19 14:34:57,563 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:34:57,564 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:34:57,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:57,564 INFO L85 PathProgramCache]: Analyzing trace with hash -124437791, now seen corresponding path program 1 times [2024-02-19 14:34:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:57,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943387666] [2024-02-19 14:34:57,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-02-19 14:34:58,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:58,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943387666] [2024-02-19 14:34:58,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943387666] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:58,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:58,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 14:34:58,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677588846] [2024-02-19 14:34:58,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:58,126 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:34:58,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:58,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:34:58,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:34:58,128 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:34:58,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 344 transitions, 6817 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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-02-19 14:34:58,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:58,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:34:58,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:59,709 INFO L124 PetriNetUnfolderBase]: 3652/6043 cut-off events. [2024-02-19 14:34:59,709 INFO L125 PetriNetUnfolderBase]: For 13393/13687 co-relation queries the response was YES. [2024-02-19 14:34:59,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63850 conditions, 6043 events. 3652/6043 cut-off events. For 13393/13687 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 38528 event pairs, 548 based on Foata normal form. 15/4804 useless extension candidates. Maximal degree in co-relation 58475. Up to 5761 conditions per place. [2024-02-19 14:34:59,758 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 289 selfloop transitions, 43 changer transitions 93/432 dead transitions. [2024-02-19 14:34:59,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 432 transitions, 9448 flow [2024-02-19 14:34:59,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:34:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:34:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2024-02-19 14:34:59,759 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-02-19 14:34:59,760 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 37 predicate places. [2024-02-19 14:34:59,760 INFO L507 AbstractCegarLoop]: Abstraction has has 108 places, 432 transitions, 9448 flow [2024-02-19 14:34:59,760 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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-02-19 14:34:59,760 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:59,760 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:34:59,761 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-19 14:34:59,761 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:34:59,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:59,761 INFO L85 PathProgramCache]: Analyzing trace with hash 175415469, now seen corresponding path program 1 times [2024-02-19 14:34:59,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:59,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143715739] [2024-02-19 14:34:59,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:59,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:00,000 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-02-19 14:35:00,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:00,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143715739] [2024-02-19 14:35:00,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143715739] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:35:00,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277732103] [2024-02-19 14:35:00,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:00,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:35:00,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:35:00,002 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:35:00,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-02-19 14:35:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:00,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 14:35:00,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:35:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-02-19 14:35:00,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:35:00,595 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-02-19 14:35:00,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277732103] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:35:00,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:35:00,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-02-19 14:35:00,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746691718] [2024-02-19 14:35:00,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:35:00,597 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-02-19 14:35:00,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:00,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-02-19 14:35:00,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=200, Unknown=0, NotChecked=0, Total=380 [2024-02-19 14:35:00,598 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:35:00,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 432 transitions, 9448 flow. Second operand has 20 states, 20 states have (on average 11.7) internal successors, (234), 20 states have internal predecessors, (234), 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-02-19 14:35:00,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:00,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:35:00,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:02,190 INFO L124 PetriNetUnfolderBase]: 3652/6057 cut-off events. [2024-02-19 14:35:02,191 INFO L125 PetriNetUnfolderBase]: For 15962/16136 co-relation queries the response was YES. [2024-02-19 14:35:02,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69781 conditions, 6057 events. 3652/6057 cut-off events. For 15962/16136 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 38451 event pairs, 548 based on Foata normal form. 2/4803 useless extension candidates. Maximal degree in co-relation 63760. Up to 5775 conditions per place. [2024-02-19 14:35:02,233 INFO L140 encePairwiseOnDemand]: 78/95 looper letters, 288 selfloop transitions, 58 changer transitions 93/446 dead transitions. [2024-02-19 14:35:02,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 446 transitions, 10634 flow [2024-02-19 14:35:02,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 14:35:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 14:35:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 271 transitions. [2024-02-19 14:35:02,235 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.2037593984962406 [2024-02-19 14:35:02,236 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 50 predicate places. [2024-02-19 14:35:02,236 INFO L507 AbstractCegarLoop]: Abstraction has has 121 places, 446 transitions, 10634 flow [2024-02-19 14:35:02,236 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.7) internal successors, (234), 20 states have internal predecessors, (234), 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-02-19 14:35:02,236 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:02,237 INFO L234 CegarLoopForPetriNet]: trace histogram [12, 12, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:35:02,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-02-19 14:35:02,448 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-02-19 14:35:02,448 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:35:02,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:02,450 INFO L85 PathProgramCache]: Analyzing trace with hash -780417637, now seen corresponding path program 2 times [2024-02-19 14:35:02,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:02,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405911488] [2024-02-19 14:35:02,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:02,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:02,838 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-02-19 14:35:02,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:02,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405911488] [2024-02-19 14:35:02,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405911488] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:35:02,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938982586] [2024-02-19 14:35:02,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 14:35:02,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:35:02,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:35:02,850 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:35:02,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-02-19 14:35:03,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-19 14:35:03,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:35:03,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 14:35:03,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:35:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-02-19 14:35:03,364 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:35:03,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938982586] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:03,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-19 14:35:03,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 16 [2024-02-19 14:35:03,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008695235] [2024-02-19 14:35:03,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:03,365 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:35:03,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:03,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:35:03,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2024-02-19 14:35:03,366 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:35:03,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 446 transitions, 10634 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-02-19 14:35:03,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:03,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:35:03,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:04,957 INFO L124 PetriNetUnfolderBase]: 3672/6316 cut-off events. [2024-02-19 14:35:04,957 INFO L125 PetriNetUnfolderBase]: For 20813/20901 co-relation queries the response was YES. [2024-02-19 14:35:04,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78558 conditions, 6316 events. 3672/6316 cut-off events. For 20813/20901 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 42084 event pairs, 532 based on Foata normal form. 220/5210 useless extension candidates. Maximal degree in co-relation 70971. Up to 6001 conditions per place. [2024-02-19 14:35:05,002 INFO L140 encePairwiseOnDemand]: 83/95 looper letters, 368 selfloop transitions, 8 changer transitions 153/536 dead transitions. [2024-02-19 14:35:05,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 536 transitions, 13879 flow [2024-02-19 14:35:05,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:35:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:35:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2024-02-19 14:35:05,003 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5649122807017544 [2024-02-19 14:35:05,004 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 52 predicate places. [2024-02-19 14:35:05,004 INFO L507 AbstractCegarLoop]: Abstraction has has 123 places, 536 transitions, 13879 flow [2024-02-19 14:35:05,004 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-02-19 14:35:05,004 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:05,004 INFO L234 CegarLoopForPetriNet]: trace histogram [12, 12, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:35:05,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-02-19 14:35:05,220 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:35:05,221 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:35:05,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:05,221 INFO L85 PathProgramCache]: Analyzing trace with hash 898252845, now seen corresponding path program 3 times [2024-02-19 14:35:05,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:05,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506419760] [2024-02-19 14:35:05,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:05,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-02-19 14:35:05,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:05,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506419760] [2024-02-19 14:35:05,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506419760] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:35:05,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726849924] [2024-02-19 14:35:05,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 14:35:05,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:35:05,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:35:05,677 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:35:05,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-02-19 14:35:06,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-02-19 14:35:06,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:35:06,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 14:35:06,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:35:06,177 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-02-19 14:35:06,178 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:35:06,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726849924] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:06,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-19 14:35:06,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 16 [2024-02-19 14:35:06,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641187413] [2024-02-19 14:35:06,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:06,179 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:35:06,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:06,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:35:06,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2024-02-19 14:35:06,180 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:35:06,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 536 transitions, 13879 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-02-19 14:35:06,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:06,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:35:06,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:07,757 INFO L124 PetriNetUnfolderBase]: 3288/5630 cut-off events. [2024-02-19 14:35:07,757 INFO L125 PetriNetUnfolderBase]: For 20299/20395 co-relation queries the response was YES. [2024-02-19 14:35:07,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75661 conditions, 5630 events. 3288/5630 cut-off events. For 20299/20395 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 36389 event pairs, 552 based on Foata normal form. 44/4436 useless extension candidates. Maximal degree in co-relation 68794. Up to 5371 conditions per place. [2024-02-19 14:35:07,796 INFO L140 encePairwiseOnDemand]: 83/95 looper letters, 298 selfloop transitions, 10 changer transitions 149/464 dead transitions. [2024-02-19 14:35:07,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 464 transitions, 12897 flow [2024-02-19 14:35:07,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:35:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:35:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2024-02-19 14:35:07,798 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5368421052631579 [2024-02-19 14:35:07,798 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 54 predicate places. [2024-02-19 14:35:07,798 INFO L507 AbstractCegarLoop]: Abstraction has has 125 places, 464 transitions, 12897 flow [2024-02-19 14:35:07,799 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-02-19 14:35:07,799 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:07,799 INFO L234 CegarLoopForPetriNet]: trace histogram [12, 12, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:35:07,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-02-19 14:35:08,011 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-02-19 14:35:08,011 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:35:08,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:08,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1179565557, now seen corresponding path program 1 times [2024-02-19 14:35:08,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:08,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260269698] [2024-02-19 14:35:08,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:08,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-02-19 14:35:08,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:08,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260269698] [2024-02-19 14:35:08,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260269698] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:35:08,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662195370] [2024-02-19 14:35:08,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:08,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:35:08,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:35:08,378 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:35:08,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-02-19 14:35:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:08,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 16 conjunts are in the unsatisfiable core [2024-02-19 14:35:08,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:35:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-02-19 14:35:09,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:35:09,194 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-02-19 14:35:09,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662195370] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:35:09,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:35:09,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2024-02-19 14:35:09,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911346069] [2024-02-19 14:35:09,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:35:09,195 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-02-19 14:35:09,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:09,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-02-19 14:35:09,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=484, Unknown=0, NotChecked=0, Total=812 [2024-02-19 14:35:09,197 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:35:09,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 464 transitions, 12897 flow. Second operand has 29 states, 29 states have (on average 11.206896551724139) internal successors, (325), 29 states have internal predecessors, (325), 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-02-19 14:35:09,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:09,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:35:09,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:10,949 INFO L124 PetriNetUnfolderBase]: 3288/5632 cut-off events. [2024-02-19 14:35:10,949 INFO L125 PetriNetUnfolderBase]: For 23653/23757 co-relation queries the response was YES. [2024-02-19 14:35:10,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81064 conditions, 5632 events. 3288/5632 cut-off events. For 23653/23757 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 36408 event pairs, 552 based on Foata normal form. 0/4394 useless extension candidates. Maximal degree in co-relation 73685. Up to 5373 conditions per place. [2024-02-19 14:35:10,996 INFO L140 encePairwiseOnDemand]: 78/95 looper letters, 250 selfloop transitions, 60 changer transitions 149/466 dead transitions. [2024-02-19 14:35:10,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 466 transitions, 13871 flow [2024-02-19 14:35:10,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-02-19 14:35:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-02-19 14:35:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 315 transitions. [2024-02-19 14:35:10,998 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.16578947368421051 [2024-02-19 14:35:10,999 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 73 predicate places. [2024-02-19 14:35:10,999 INFO L507 AbstractCegarLoop]: Abstraction has has 144 places, 466 transitions, 13871 flow [2024-02-19 14:35:10,999 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 11.206896551724139) internal successors, (325), 29 states have internal predecessors, (325), 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-02-19 14:35:10,999 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:11,006 INFO L234 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:35:11,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-02-19 14:35:11,219 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-02-19 14:35:11,220 INFO L432 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:35:11,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:11,220 INFO L85 PathProgramCache]: Analyzing trace with hash -161780707, now seen corresponding path program 2 times [2024-02-19 14:35:11,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:11,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520529750] [2024-02-19 14:35:11,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:11,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-02-19 14:35:11,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:11,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520529750] [2024-02-19 14:35:11,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520529750] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:11,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:35:11,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:35:11,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201448891] [2024-02-19 14:35:11,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:11,750 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:35:11,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:11,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:35:11,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:35:11,751 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:35:11,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 466 transitions, 13871 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-02-19 14:35:11,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:11,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:35:11,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:13,448 INFO L124 PetriNetUnfolderBase]: 3428/5909 cut-off events. [2024-02-19 14:35:13,448 INFO L125 PetriNetUnfolderBase]: For 26664/26776 co-relation queries the response was YES. [2024-02-19 14:35:13,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90960 conditions, 5909 events. 3428/5909 cut-off events. For 26664/26776 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 38993 event pairs, 540 based on Foata normal form. 7/4636 useless extension candidates. Maximal degree in co-relation 81552. Up to 5654 conditions per place. [2024-02-19 14:35:13,487 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 337 selfloop transitions, 4 changer transitions 160/508 dead transitions. [2024-02-19 14:35:13,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 508 transitions, 16154 flow [2024-02-19 14:35:13,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:35:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:35:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2024-02-19 14:35:13,488 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4052631578947368 [2024-02-19 14:35:13,489 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 76 predicate places. [2024-02-19 14:35:13,489 INFO L507 AbstractCegarLoop]: Abstraction has has 147 places, 508 transitions, 16154 flow [2024-02-19 14:35:13,489 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-02-19 14:35:13,489 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:13,489 INFO L234 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:35:13,489 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-19 14:35:13,490 INFO L432 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:35:13,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:13,490 INFO L85 PathProgramCache]: Analyzing trace with hash 155082333, now seen corresponding path program 3 times [2024-02-19 14:35:13,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:13,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577149253] [2024-02-19 14:35:13,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:13,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-02-19 14:35:13,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:13,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577149253] [2024-02-19 14:35:13,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577149253] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:13,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:35:13,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:35:13,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898578543] [2024-02-19 14:35:13,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:13,901 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:35:13,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:13,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:35:13,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:35:13,902 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:35:13,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 508 transitions, 16154 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-02-19 14:35:13,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:13,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:35:13,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:15,616 INFO L124 PetriNetUnfolderBase]: 3530/6124 cut-off events. [2024-02-19 14:35:15,616 INFO L125 PetriNetUnfolderBase]: For 32227/32617 co-relation queries the response was YES. [2024-02-19 14:35:15,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100152 conditions, 6124 events. 3530/6124 cut-off events. For 32227/32617 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 41062 event pairs, 560 based on Foata normal form. 17/4835 useless extension candidates. Maximal degree in co-relation 89761. Up to 5861 conditions per place. [2024-02-19 14:35:15,678 INFO L140 encePairwiseOnDemand]: 74/95 looper letters, 344 selfloop transitions, 28 changer transitions 170/549 dead transitions. [2024-02-19 14:35:15,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 549 transitions, 18568 flow [2024-02-19 14:35:15,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:35:15,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:35:15,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2024-02-19 14:35:15,680 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4610526315789474 [2024-02-19 14:35:15,681 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 80 predicate places. [2024-02-19 14:35:15,681 INFO L507 AbstractCegarLoop]: Abstraction has has 151 places, 549 transitions, 18568 flow [2024-02-19 14:35:15,681 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-02-19 14:35:15,681 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:15,682 INFO L234 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:35:15,682 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-19 14:35:15,682 INFO L432 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:35:15,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:15,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1146750943, now seen corresponding path program 1 times [2024-02-19 14:35:15,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:15,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65421731] [2024-02-19 14:35:15,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:15,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-02-19 14:35:16,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:16,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65421731] [2024-02-19 14:35:16,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65421731] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:16,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:35:16,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:35:16,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170246961] [2024-02-19 14:35:16,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:16,549 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:35:16,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:16,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:35:16,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:35:16,549 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:35:16,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 549 transitions, 18568 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-02-19 14:35:16,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:16,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:35:16,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:18,404 INFO L124 PetriNetUnfolderBase]: 3632/6419 cut-off events. [2024-02-19 14:35:18,404 INFO L125 PetriNetUnfolderBase]: For 37247/37375 co-relation queries the response was YES. [2024-02-19 14:35:18,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111062 conditions, 6419 events. 3632/6419 cut-off events. For 37247/37375 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 44092 event pairs, 540 based on Foata normal form. 88/5139 useless extension candidates. Maximal degree in co-relation 98676. Up to 6139 conditions per place. [2024-02-19 14:35:18,472 INFO L140 encePairwiseOnDemand]: 85/95 looper letters, 386 selfloop transitions, 18 changer transitions 189/600 dead transitions. [2024-02-19 14:35:18,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 600 transitions, 21512 flow [2024-02-19 14:35:18,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:35:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:35:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2024-02-19 14:35:18,474 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5298245614035088 [2024-02-19 14:35:18,474 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 82 predicate places. [2024-02-19 14:35:18,474 INFO L507 AbstractCegarLoop]: Abstraction has has 153 places, 600 transitions, 21512 flow [2024-02-19 14:35:18,474 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-02-19 14:35:18,474 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:18,474 INFO L234 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:35:18,475 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-19 14:35:18,475 INFO L432 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:35:18,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:18,475 INFO L85 PathProgramCache]: Analyzing trace with hash -682114967, now seen corresponding path program 2 times [2024-02-19 14:35:18,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:18,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127416488] [2024-02-19 14:35:18,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:18,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-02-19 14:35:19,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:19,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127416488] [2024-02-19 14:35:19,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127416488] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:19,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:35:19,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:35:19,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884266195] [2024-02-19 14:35:19,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:19,432 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:35:19,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:19,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:35:19,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:35:19,435 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:35:19,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 600 transitions, 21512 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-02-19 14:35:19,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:19,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:35:19,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:21,270 INFO L124 PetriNetUnfolderBase]: 3468/6111 cut-off events. [2024-02-19 14:35:21,270 INFO L125 PetriNetUnfolderBase]: For 38169/38305 co-relation queries the response was YES. [2024-02-19 14:35:21,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111837 conditions, 6111 events. 3468/6111 cut-off events. For 38169/38305 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 41869 event pairs, 556 based on Foata normal form. 60/4823 useless extension candidates. Maximal degree in co-relation 100167. Up to 5859 conditions per place. [2024-02-19 14:35:21,332 INFO L140 encePairwiseOnDemand]: 85/95 looper letters, 325 selfloop transitions, 4 changer transitions 202/538 dead transitions. [2024-02-19 14:35:21,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 538 transitions, 20315 flow [2024-02-19 14:35:21,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:35:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:35:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2024-02-19 14:35:21,333 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5298245614035088 [2024-02-19 14:35:21,334 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 84 predicate places. [2024-02-19 14:35:21,334 INFO L507 AbstractCegarLoop]: Abstraction has has 155 places, 538 transitions, 20315 flow [2024-02-19 14:35:21,334 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-02-19 14:35:21,334 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:21,334 INFO L234 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:35:21,334 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-19 14:35:21,334 INFO L432 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:35:21,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:21,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1338269484, now seen corresponding path program 1 times [2024-02-19 14:35:21,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:21,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621377542] [2024-02-19 14:35:21,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:21,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-02-19 14:35:22,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:22,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621377542] [2024-02-19 14:35:22,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621377542] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:22,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:35:22,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:35:22,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318256005] [2024-02-19 14:35:22,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:22,365 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:35:22,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:22,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:35:22,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:35:22,366 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:35:22,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 538 transitions, 20315 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-02-19 14:35:22,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:22,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:35:22,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:24,767 INFO L124 PetriNetUnfolderBase]: 3648/6500 cut-off events. [2024-02-19 14:35:24,767 INFO L125 PetriNetUnfolderBase]: For 42660/42804 co-relation queries the response was YES. [2024-02-19 14:35:24,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125450 conditions, 6500 events. 3648/6500 cut-off events. For 42660/42804 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 45727 event pairs, 556 based on Foata normal form. 30/5112 useless extension candidates. Maximal degree in co-relation 111386. Up to 6245 conditions per place. [2024-02-19 14:35:24,818 INFO L140 encePairwiseOnDemand]: 85/95 looper letters, 340 selfloop transitions, 10 changer transitions 236/593 dead transitions. [2024-02-19 14:35:24,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 593 transitions, 23598 flow [2024-02-19 14:35:24,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:35:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:35:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-02-19 14:35:24,819 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5578947368421052 [2024-02-19 14:35:24,820 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 86 predicate places. [2024-02-19 14:35:24,820 INFO L507 AbstractCegarLoop]: Abstraction has has 157 places, 593 transitions, 23598 flow [2024-02-19 14:35:24,820 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-02-19 14:35:24,820 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:24,821 INFO L234 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:35:24,821 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-02-19 14:35:24,821 INFO L432 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:35:24,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:24,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2031526764, now seen corresponding path program 2 times [2024-02-19 14:35:24,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:24,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906549494] [2024-02-19 14:35:24,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:24,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-02-19 14:35:25,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:25,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906549494] [2024-02-19 14:35:25,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906549494] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:25,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:35:25,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:35:25,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506265049] [2024-02-19 14:35:25,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:25,478 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:35:25,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:25,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:35:25,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:35:25,478 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:35:25,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 593 transitions, 23598 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-02-19 14:35:25,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:25,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:35:25,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:27,707 INFO L124 PetriNetUnfolderBase]: 3530/6292 cut-off events. [2024-02-19 14:35:27,707 INFO L125 PetriNetUnfolderBase]: For 47349/47501 co-relation queries the response was YES. [2024-02-19 14:35:27,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127394 conditions, 6292 events. 3530/6292 cut-off events. For 47349/47501 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 44149 event pairs, 556 based on Foata normal form. 54/4938 useless extension candidates. Maximal degree in co-relation 113747. Up to 6041 conditions per place. [2024-02-19 14:35:27,760 INFO L140 encePairwiseOnDemand]: 85/95 looper letters, 274 selfloop transitions, 5 changer transitions 263/549 dead transitions. [2024-02-19 14:35:27,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 549 transitions, 22898 flow [2024-02-19 14:35:27,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:35:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:35:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2024-02-19 14:35:27,762 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5298245614035088 [2024-02-19 14:35:27,762 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 88 predicate places. [2024-02-19 14:35:27,762 INFO L507 AbstractCegarLoop]: Abstraction has has 159 places, 549 transitions, 22898 flow [2024-02-19 14:35:27,762 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-02-19 14:35:27,762 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:27,763 INFO L234 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:35:27,763 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-02-19 14:35:27,763 INFO L432 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:35:27,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:27,763 INFO L85 PathProgramCache]: Analyzing trace with hash -869072853, now seen corresponding path program 1 times [2024-02-19 14:35:27,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:27,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463976079] [2024-02-19 14:35:27,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:27,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-02-19 14:35:27,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:27,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463976079] [2024-02-19 14:35:27,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463976079] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:27,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:35:27,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:35:27,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566113577] [2024-02-19 14:35:27,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:27,904 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:35:27,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:27,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:35:27,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:35:27,906 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:35:27,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 549 transitions, 22898 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-02-19 14:35:27,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:27,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:35:27,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:30,238 INFO L124 PetriNetUnfolderBase]: 3466/6199 cut-off events. [2024-02-19 14:35:30,238 INFO L125 PetriNetUnfolderBase]: For 53139/53299 co-relation queries the response was YES. [2024-02-19 14:35:30,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131322 conditions, 6199 events. 3466/6199 cut-off events. For 53139/53299 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 43479 event pairs, 556 based on Foata normal form. 34/4831 useless extension candidates. Maximal degree in co-relation 117568. Up to 5945 conditions per place. [2024-02-19 14:35:30,288 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 252 selfloop transitions, 5 changer transitions 276/540 dead transitions. [2024-02-19 14:35:30,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 540 transitions, 23583 flow [2024-02-19 14:35:30,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:35:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:35:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-02-19 14:35:30,290 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.512280701754386 [2024-02-19 14:35:30,290 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 90 predicate places. [2024-02-19 14:35:30,290 INFO L507 AbstractCegarLoop]: Abstraction has has 161 places, 540 transitions, 23583 flow [2024-02-19 14:35:30,291 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-02-19 14:35:30,291 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:30,291 INFO L234 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:35:30,291 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-02-19 14:35:30,291 INFO L432 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:35:30,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:30,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1176993533, now seen corresponding path program 2 times [2024-02-19 14:35:30,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:30,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797576854] [2024-02-19 14:35:30,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:30,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:30,397 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-02-19 14:35:30,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:30,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797576854] [2024-02-19 14:35:30,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797576854] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:30,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:35:30,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:35:30,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375305135] [2024-02-19 14:35:30,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:30,398 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:35:30,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:30,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:35:30,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:35:30,399 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:35:30,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 540 transitions, 23583 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-02-19 14:35:30,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:30,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:35:30,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:32,629 INFO L124 PetriNetUnfolderBase]: 3440/6142 cut-off events. [2024-02-19 14:35:32,629 INFO L125 PetriNetUnfolderBase]: For 57504/57672 co-relation queries the response was YES. [2024-02-19 14:35:32,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136065 conditions, 6142 events. 3440/6142 cut-off events. For 57504/57672 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 42993 event pairs, 556 based on Foata normal form. 4/4748 useless extension candidates. Maximal degree in co-relation 121881. Up to 5893 conditions per place. [2024-02-19 14:35:32,687 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 238 selfloop transitions, 0 changer transitions 283/528 dead transitions. [2024-02-19 14:35:32,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 528 transitions, 24091 flow [2024-02-19 14:35:32,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:35:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:35:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2024-02-19 14:35:32,688 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5017543859649123 [2024-02-19 14:35:32,689 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 92 predicate places. [2024-02-19 14:35:32,689 INFO L507 AbstractCegarLoop]: Abstraction has has 163 places, 528 transitions, 24091 flow [2024-02-19 14:35:32,689 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-02-19 14:35:32,689 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:32,689 INFO L234 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:35:32,689 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-02-19 14:35:32,690 INFO L432 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:35:32,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:32,690 INFO L85 PathProgramCache]: Analyzing trace with hash 562450911, now seen corresponding path program 1 times [2024-02-19 14:35:32,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:32,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144250090] [2024-02-19 14:35:32,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:32,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-02-19 14:35:32,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:32,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144250090] [2024-02-19 14:35:32,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144250090] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:32,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:35:32,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:35:32,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039777100] [2024-02-19 14:35:32,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:32,932 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:35:32,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:32,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:35:32,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:35:32,932 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:35:32,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 528 transitions, 24091 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-02-19 14:35:32,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:32,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:35:32,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:35,199 INFO L124 PetriNetUnfolderBase]: 3379/6052 cut-off events. [2024-02-19 14:35:35,199 INFO L125 PetriNetUnfolderBase]: For 68413/69049 co-relation queries the response was YES. [2024-02-19 14:35:35,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139524 conditions, 6052 events. 3379/6052 cut-off events. For 68413/69049 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 42549 event pairs, 528 based on Foata normal form. 52/4718 useless extension candidates. Maximal degree in co-relation 124656. Up to 5791 conditions per place. [2024-02-19 14:35:35,248 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 237 selfloop transitions, 4 changer transitions 270/518 dead transitions. [2024-02-19 14:35:35,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 518 transitions, 24653 flow [2024-02-19 14:35:35,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:35:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:35:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2024-02-19 14:35:35,249 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.47719298245614034 [2024-02-19 14:35:35,250 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 94 predicate places. [2024-02-19 14:35:35,250 INFO L507 AbstractCegarLoop]: Abstraction has has 165 places, 518 transitions, 24653 flow [2024-02-19 14:35:35,250 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-02-19 14:35:35,250 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:35,251 INFO L234 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:35:35,251 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-02-19 14:35:35,251 INFO L432 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:35:35,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:35,251 INFO L85 PathProgramCache]: Analyzing trace with hash -543775550, now seen corresponding path program 1 times [2024-02-19 14:35:35,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:35,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244257754] [2024-02-19 14:35:35,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:35,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-02-19 14:35:35,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:35,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244257754] [2024-02-19 14:35:35,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244257754] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:35,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:35:35,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:35:35,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994195962] [2024-02-19 14:35:35,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:35,446 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:35:35,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:35,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:35:35,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:35:35,448 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:35:35,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 518 transitions, 24653 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-02-19 14:35:35,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:35,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:35:35,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:37,548 INFO L124 PetriNetUnfolderBase]: 3292/5901 cut-off events. [2024-02-19 14:35:37,549 INFO L125 PetriNetUnfolderBase]: For 73616/73800 co-relation queries the response was YES. [2024-02-19 14:35:37,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141378 conditions, 5901 events. 3292/5901 cut-off events. For 73616/73800 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 40854 event pairs, 528 based on Foata normal form. 44/4583 useless extension candidates. Maximal degree in co-relation 127513. Up to 5634 conditions per place. [2024-02-19 14:35:37,609 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 234 selfloop transitions, 3 changer transitions 260/504 dead transitions. [2024-02-19 14:35:37,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 504 transitions, 24969 flow [2024-02-19 14:35:37,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:35:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:35:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-02-19 14:35:37,610 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4842105263157895 [2024-02-19 14:35:37,611 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 96 predicate places. [2024-02-19 14:35:37,611 INFO L507 AbstractCegarLoop]: Abstraction has has 167 places, 504 transitions, 24969 flow [2024-02-19 14:35:37,611 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-02-19 14:35:37,611 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:37,611 INFO L234 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:35:37,611 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-02-19 14:35:37,612 INFO L432 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:35:37,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:37,612 INFO L85 PathProgramCache]: Analyzing trace with hash -10597608, now seen corresponding path program 1 times [2024-02-19 14:35:37,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:37,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498824058] [2024-02-19 14:35:37,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:37,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-02-19 14:35:37,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:37,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498824058] [2024-02-19 14:35:37,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498824058] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:37,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:35:37,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:35:37,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286970751] [2024-02-19 14:35:37,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:37,867 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:35:37,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:37,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:35:37,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:35:37,867 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:35:37,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 504 transitions, 24969 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-02-19 14:35:37,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:37,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:35:37,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:40,577 INFO L124 PetriNetUnfolderBase]: 3298/5920 cut-off events. [2024-02-19 14:35:40,577 INFO L125 PetriNetUnfolderBase]: For 80003/80195 co-relation queries the response was YES. [2024-02-19 14:35:40,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147511 conditions, 5920 events. 3298/5920 cut-off events. For 80003/80195 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 41057 event pairs, 520 based on Foata normal form. 1/4559 useless extension candidates. Maximal degree in co-relation 132912. Up to 5653 conditions per place. [2024-02-19 14:35:40,628 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 228 selfloop transitions, 1 changer transitions 276/512 dead transitions. [2024-02-19 14:35:40,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 512 transitions, 26385 flow [2024-02-19 14:35:40,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:35:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:35:40,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2024-02-19 14:35:40,630 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.38421052631578945 [2024-02-19 14:35:40,630 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 99 predicate places. [2024-02-19 14:35:40,630 INFO L507 AbstractCegarLoop]: Abstraction has has 170 places, 512 transitions, 26385 flow [2024-02-19 14:35:40,630 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-02-19 14:35:40,630 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:40,630 INFO L234 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:35:40,631 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-02-19 14:35:40,631 INFO L432 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:35:40,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:40,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1607765544, now seen corresponding path program 2 times [2024-02-19 14:35:40,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:40,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682808294] [2024-02-19 14:35:40,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:40,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-02-19 14:35:40,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:40,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682808294] [2024-02-19 14:35:40,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682808294] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:40,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:35:40,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:35:40,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612741327] [2024-02-19 14:35:40,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:40,848 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:35:40,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:40,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:35:40,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:35:40,849 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:35:40,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 512 transitions, 26385 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-02-19 14:35:40,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:40,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:35:40,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:43,121 INFO L124 PetriNetUnfolderBase]: 3298/5918 cut-off events. [2024-02-19 14:35:43,122 INFO L125 PetriNetUnfolderBase]: For 88824/89384 co-relation queries the response was YES. [2024-02-19 14:35:43,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153138 conditions, 5918 events. 3298/5918 cut-off events. For 88824/89384 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 41197 event pairs, 520 based on Foata normal form. 1/4559 useless extension candidates. Maximal degree in co-relation 138011. Up to 5652 conditions per place. [2024-02-19 14:35:43,186 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 210 selfloop transitions, 0 changer transitions 298/515 dead transitions. [2024-02-19 14:35:43,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 515 transitions, 27560 flow [2024-02-19 14:35:43,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:35:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:35:43,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2024-02-19 14:35:43,187 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3763157894736842 [2024-02-19 14:35:43,189 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 102 predicate places. [2024-02-19 14:35:43,189 INFO L507 AbstractCegarLoop]: Abstraction has has 173 places, 515 transitions, 27560 flow [2024-02-19 14:35:43,189 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-02-19 14:35:43,190 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:43,190 INFO L234 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:35:43,190 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-02-19 14:35:43,190 INFO L432 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:35:43,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:43,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1047873707, now seen corresponding path program 1 times [2024-02-19 14:35:43,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:43,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257179002] [2024-02-19 14:35:43,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:43,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-02-19 14:35:43,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:43,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257179002] [2024-02-19 14:35:43,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257179002] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:43,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:35:43,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:35:43,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228854573] [2024-02-19 14:35:43,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:43,405 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:35:43,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:43,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:35:43,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:35:43,406 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:35:43,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 515 transitions, 27560 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-02-19 14:35:43,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:43,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:35:43,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:45,895 INFO L124 PetriNetUnfolderBase]: 3304/5937 cut-off events. [2024-02-19 14:35:45,895 INFO L125 PetriNetUnfolderBase]: For 92519/92571 co-relation queries the response was YES. [2024-02-19 14:35:45,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159327 conditions, 5937 events. 3304/5937 cut-off events. For 92519/92571 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 41170 event pairs, 512 based on Foata normal form. 1/4579 useless extension candidates. Maximal degree in co-relation 143446. Up to 5671 conditions per place. [2024-02-19 14:35:45,949 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 202 selfloop transitions, 1 changer transitions 313/523 dead transitions. [2024-02-19 14:35:45,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 523 transitions, 29030 flow [2024-02-19 14:35:45,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:35:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:35:45,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2024-02-19 14:35:45,950 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.38421052631578945 [2024-02-19 14:35:45,951 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 105 predicate places. [2024-02-19 14:35:45,951 INFO L507 AbstractCegarLoop]: Abstraction has has 176 places, 523 transitions, 29030 flow [2024-02-19 14:35:45,951 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-02-19 14:35:45,951 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:45,951 INFO L234 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:35:45,951 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-02-19 14:35:45,952 INFO L432 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:35:45,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:45,952 INFO L85 PathProgramCache]: Analyzing trace with hash 242840963, now seen corresponding path program 2 times [2024-02-19 14:35:45,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:45,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724424653] [2024-02-19 14:35:45,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:45,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-02-19 14:35:46,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:46,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724424653] [2024-02-19 14:35:46,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724424653] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:46,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:35:46,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:35:46,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360946459] [2024-02-19 14:35:46,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:46,199 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:35:46,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:46,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:35:46,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:35:46,200 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-19 14:35:46,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 523 transitions, 29030 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-02-19 14:35:46,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:46,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-19 14:35:46,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand