./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 448d4d75 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-448d4d7-m [2024-02-20 11:53:20,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 11:53:20,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 11:53:20,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 11:53:20,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 11:53:20,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 11:53:20,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 11:53:20,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 11:53:20,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 11:53:20,656 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 11:53:20,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 11:53:20,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 11:53:20,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 11:53:20,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 11:53:20,658 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 11:53:20,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 11:53:20,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 11:53:20,659 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 11:53:20,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 11:53:20,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 11:53:20,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 11:53:20,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 11:53:20,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 11:53:20,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 11:53:20,661 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 11:53:20,661 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 11:53:20,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 11:53:20,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 11:53:20,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 11:53:20,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 11:53:20,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 11:53:20,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 11:53:20,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:53:20,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 11:53:20,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 11:53:20,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 11:53:20,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 11:53:20,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 11:53:20,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 11:53:20,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 11:53:20,665 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 11:53:20,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 11:53:20,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 11:53:20,680 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-20 11:53:20,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 11:53:20,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 11:53:20,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 11:53:20,869 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 11:53:20,869 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 11:53:20,870 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-20 11:53:21,909 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 11:53:22,128 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 11:53:22,129 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c [2024-02-20 11:53:22,145 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83be80ea1/46d5ae24b4fa419c8abeebdbf0aa3201/FLAG8cf9bd4e3 [2024-02-20 11:53:22,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83be80ea1/46d5ae24b4fa419c8abeebdbf0aa3201 [2024-02-20 11:53:22,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 11:53:22,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 11:53:22,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 11:53:22,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 11:53:22,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 11:53:22,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:22" (1/1) ... [2024-02-20 11:53:22,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dcfa5f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:22, skipping insertion in model container [2024-02-20 11:53:22,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:22" (1/1) ... [2024-02-20 11:53:22,192 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 11:53:22,415 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-20 11:53:22,423 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:53:22,431 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 11:53:22,500 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-20 11:53:22,518 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:53:22,537 INFO L206 MainTranslator]: Completed translation [2024-02-20 11:53:22,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:22 WrapperNode [2024-02-20 11:53:22,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 11:53:22,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 11:53:22,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 11:53:22,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 11:53:22,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:22" (1/1) ... [2024-02-20 11:53:22,569 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:22" (1/1) ... [2024-02-20 11:53:22,623 INFO L138 Inliner]: procedures = 25, calls = 307, calls flagged for inlining = 69, calls inlined = 97, statements flattened = 1553 [2024-02-20 11:53:22,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 11:53:22,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 11:53:22,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 11:53:22,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 11:53:22,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:22" (1/1) ... [2024-02-20 11:53:22,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:22" (1/1) ... [2024-02-20 11:53:22,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:22" (1/1) ... [2024-02-20 11:53:22,709 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-20 11:53:22,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:22" (1/1) ... [2024-02-20 11:53:22,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:22" (1/1) ... [2024-02-20 11:53:22,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:22" (1/1) ... [2024-02-20 11:53:22,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:22" (1/1) ... [2024-02-20 11:53:22,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:22" (1/1) ... [2024-02-20 11:53:22,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:22" (1/1) ... [2024-02-20 11:53:22,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 11:53:22,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 11:53:22,815 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 11:53:22,815 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 11:53:22,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:22" (1/1) ... [2024-02-20 11:53:22,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:53:22,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:53:22,838 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-20 11:53:22,844 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-20 11:53:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 11:53:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 11:53:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 11:53:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 11:53:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 11:53:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-20 11:53:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 11:53:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 11:53:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 11:53:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-20 11:53:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 11:53:22,885 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 11:53:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 11:53:22,886 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 11:53:22,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 11:53:22,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 11:53:22,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 11:53:22,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-20 11:53:22,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-20 11:53:22,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-20 11:53:22,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-20 11:53:22,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 11:53:22,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 11:53:22,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 11:53:22,890 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 11:53:23,056 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 11:53:23,058 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 11:53:24,281 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 11:53:24,281 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 11:53:25,491 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 11:53:25,491 INFO L320 CfgBuilder]: Removed 12 assume(true) statements. [2024-02-20 11:53:25,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:25 BoogieIcfgContainer [2024-02-20 11:53:25,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 11:53:25,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 11:53:25,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 11:53:25,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 11:53:25,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:53:22" (1/3) ... [2024-02-20 11:53:25,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b2a9f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:53:25, skipping insertion in model container [2024-02-20 11:53:25,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:22" (2/3) ... [2024-02-20 11:53:25,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b2a9f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:53:25, skipping insertion in model container [2024-02-20 11:53:25,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:25" (3/3) ... [2024-02-20 11:53:25,500 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-poker-hand-symm.wvr.c [2024-02-20 11:53:25,515 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 11:53:25,515 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 11:53:25,515 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 11:53:25,711 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-20 11:53:25,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 95 transitions, 204 flow [2024-02-20 11:53:25,778 INFO L124 PetriNetUnfolderBase]: 28/93 cut-off events. [2024-02-20 11:53:25,778 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 11:53:25,781 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-20 11:53:25,782 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 95 transitions, 204 flow [2024-02-20 11:53:25,784 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 92 transitions, 196 flow [2024-02-20 11:53:25,791 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:53:25,796 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;@7123ed7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:53:25,797 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-20 11:53:25,823 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:53:25,823 INFO L124 PetriNetUnfolderBase]: 28/91 cut-off events. [2024-02-20 11:53:25,823 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 11:53:25,823 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:25,824 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-20 11:53:25,824 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-20 11:53:25,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:25,828 INFO L85 PathProgramCache]: Analyzing trace with hash 526357867, now seen corresponding path program 1 times [2024-02-20 11:53:25,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:25,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854499696] [2024-02-20 11:53:25,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:25,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:26,451 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-20 11:53:26,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:26,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854499696] [2024-02-20 11:53:26,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854499696] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:26,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:53:26,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:53:26,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828476514] [2024-02-20 11:53:26,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:26,460 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:53:26,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:26,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:53:26,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:53:26,482 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:53:26,484 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-20 11:53:26,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:26,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:53:26,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:27,539 INFO L124 PetriNetUnfolderBase]: 2032/3104 cut-off events. [2024-02-20 11:53:27,540 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-02-20 11:53:27,545 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-20 11:53:27,570 INFO L140 encePairwiseOnDemand]: 82/95 looper letters, 77 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2024-02-20 11:53:27,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 92 transitions, 366 flow [2024-02-20 11:53:27,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:53:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:53:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-02-20 11:53:27,580 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2024-02-20 11:53:27,583 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 2 predicate places. [2024-02-20 11:53:27,584 INFO L507 AbstractCegarLoop]: Abstraction has has 73 places, 92 transitions, 366 flow [2024-02-20 11:53:27,584 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-20 11:53:27,584 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:27,584 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-20 11:53:27,585 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 11:53:27,585 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-20 11:53:27,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:27,585 INFO L85 PathProgramCache]: Analyzing trace with hash -9668434, now seen corresponding path program 1 times [2024-02-20 11:53:27,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:27,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364428069] [2024-02-20 11:53:27,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:27,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:27,708 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-20 11:53:27,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:27,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364428069] [2024-02-20 11:53:27,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364428069] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:27,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:53:27,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:53:27,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740790689] [2024-02-20 11:53:27,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:27,710 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:53:27,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:27,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:53:27,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:53:27,712 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:53:27,712 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-20 11:53:27,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:27,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:53:27,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:28,369 INFO L124 PetriNetUnfolderBase]: 2032/3109 cut-off events. [2024-02-20 11:53:28,370 INFO L125 PetriNetUnfolderBase]: For 188/242 co-relation queries the response was YES. [2024-02-20 11:53:28,372 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-20 11:53:28,383 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 83 selfloop transitions, 4 changer transitions 0/94 dead transitions. [2024-02-20 11:53:28,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 94 transitions, 548 flow [2024-02-20 11:53:28,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:53:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:53:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-02-20 11:53:28,385 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3929824561403509 [2024-02-20 11:53:28,386 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 4 predicate places. [2024-02-20 11:53:28,386 INFO L507 AbstractCegarLoop]: Abstraction has has 75 places, 94 transitions, 548 flow [2024-02-20 11:53:28,386 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-20 11:53:28,387 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:28,387 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-20 11:53:28,387 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 11:53:28,387 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-20 11:53:28,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:28,388 INFO L85 PathProgramCache]: Analyzing trace with hash 502434250, now seen corresponding path program 1 times [2024-02-20 11:53:28,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:28,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512533157] [2024-02-20 11:53:28,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:28,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:28,512 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-20 11:53:28,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:28,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512533157] [2024-02-20 11:53:28,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512533157] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:53:28,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547992719] [2024-02-20 11:53:28,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:28,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:53:28,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:53:28,515 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-20 11:53:28,530 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-20 11:53:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:28,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-20 11:53:28,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:53:28,925 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-20 11:53:28,926 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 11:53:28,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547992719] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:28,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-20 11:53:28,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-02-20 11:53:28,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467316047] [2024-02-20 11:53:28,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:28,927 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:53:28,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:28,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:53:28,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:53:28,927 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:53:28,928 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-20 11:53:28,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:28,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:53:28,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:29,670 INFO L124 PetriNetUnfolderBase]: 2032/3111 cut-off events. [2024-02-20 11:53:29,670 INFO L125 PetriNetUnfolderBase]: For 403/487 co-relation queries the response was YES. [2024-02-20 11:53:29,673 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-20 11:53:29,689 INFO L140 encePairwiseOnDemand]: 86/95 looper letters, 81 selfloop transitions, 8 changer transitions 0/96 dead transitions. [2024-02-20 11:53:29,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 96 transitions, 738 flow [2024-02-20 11:53:29,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:53:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:53:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-02-20 11:53:29,690 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-02-20 11:53:29,691 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 6 predicate places. [2024-02-20 11:53:29,691 INFO L507 AbstractCegarLoop]: Abstraction has has 77 places, 96 transitions, 738 flow [2024-02-20 11:53:29,691 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-20 11:53:29,692 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:29,692 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-20 11:53:29,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-20 11:53:29,905 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-20 11:53:29,906 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-20 11:53:29,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:29,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1736364512, now seen corresponding path program 1 times [2024-02-20 11:53:29,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:29,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4256458] [2024-02-20 11:53:29,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:29,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:30,067 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-20 11:53:30,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:30,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4256458] [2024-02-20 11:53:30,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4256458] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:53:30,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801870044] [2024-02-20 11:53:30,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:30,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:53:30,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:53:30,085 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-20 11:53:30,115 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-20 11:53:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:30,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-20 11:53:30,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:53:30,517 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-20 11:53:30,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:53:30,549 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-20 11:53:30,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801870044] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:53:30,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:53:30,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2024-02-20 11:53:30,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372069270] [2024-02-20 11:53:30,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:53:30,550 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-20 11:53:30,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:30,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-20 11:53:30,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-02-20 11:53:30,553 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:53:30,553 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-20 11:53:30,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:30,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:53:30,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:31,329 INFO L124 PetriNetUnfolderBase]: 2032/3132 cut-off events. [2024-02-20 11:53:31,329 INFO L125 PetriNetUnfolderBase]: For 738/906 co-relation queries the response was YES. [2024-02-20 11:53:31,333 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-20 11:53:31,354 INFO L140 encePairwiseOnDemand]: 78/95 looper letters, 73 selfloop transitions, 40 changer transitions 0/120 dead transitions. [2024-02-20 11:53:31,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 120 transitions, 1156 flow [2024-02-20 11:53:31,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-20 11:53:31,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-20 11:53:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2024-02-20 11:53:31,358 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.275 [2024-02-20 11:53:31,358 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 13 predicate places. [2024-02-20 11:53:31,358 INFO L507 AbstractCegarLoop]: Abstraction has has 84 places, 120 transitions, 1156 flow [2024-02-20 11:53:31,359 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-20 11:53:31,359 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:31,359 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-20 11:53:31,373 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-20 11:53:31,562 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-20 11:53:31,562 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-20 11:53:31,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:31,563 INFO L85 PathProgramCache]: Analyzing trace with hash 258007497, now seen corresponding path program 2 times [2024-02-20 11:53:31,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:31,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009916084] [2024-02-20 11:53:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:31,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:31,902 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-20 11:53:31,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:31,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009916084] [2024-02-20 11:53:31,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009916084] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:53:31,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650104231] [2024-02-20 11:53:31,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 11:53:31,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:53:31,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:53:31,904 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-20 11:53:31,952 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-20 11:53:32,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-20 11:53:32,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:53:32,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 11:53:32,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:53:32,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 11:53:32,348 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-20 11:53:32,369 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-20 11:53:32,370 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 11:53:32,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650104231] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:32,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-20 11:53:32,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-02-20 11:53:32,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520531932] [2024-02-20 11:53:32,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:32,371 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:53:32,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:32,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:53:32,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-02-20 11:53:32,372 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:53:32,372 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-20 11:53:32,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:32,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:53:32,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:33,490 INFO L124 PetriNetUnfolderBase]: 3096/4864 cut-off events. [2024-02-20 11:53:33,490 INFO L125 PetriNetUnfolderBase]: For 2517/2789 co-relation queries the response was YES. [2024-02-20 11:53:33,496 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-20 11:53:33,523 INFO L140 encePairwiseOnDemand]: 74/95 looper letters, 180 selfloop transitions, 22 changer transitions 10/219 dead transitions. [2024-02-20 11:53:33,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 219 transitions, 2588 flow [2024-02-20 11:53:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:53:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:53:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2024-02-20 11:53:33,525 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.47789473684210526 [2024-02-20 11:53:33,525 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 17 predicate places. [2024-02-20 11:53:33,526 INFO L507 AbstractCegarLoop]: Abstraction has has 88 places, 219 transitions, 2588 flow [2024-02-20 11:53:33,526 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-20 11:53:33,526 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:33,526 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-20 11:53:33,539 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-20 11:53:33,739 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-20 11:53:33,739 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-20 11:53:33,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:33,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1724753711, now seen corresponding path program 3 times [2024-02-20 11:53:33,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:33,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860881974] [2024-02-20 11:53:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:33,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:34,000 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-20 11:53:34,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:34,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860881974] [2024-02-20 11:53:34,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860881974] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:53:34,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443880373] [2024-02-20 11:53:34,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 11:53:34,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:53:34,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:53:34,017 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-20 11:53:34,044 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-20 11:53:34,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-02-20 11:53:34,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:53:34,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 11:53:34,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:53:34,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 11:53:34,482 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-20 11:53:34,508 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-20 11:53:34,508 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 11:53:34,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443880373] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:34,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-20 11:53:34,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-02-20 11:53:34,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527004522] [2024-02-20 11:53:34,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:34,510 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:53:34,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:34,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:53:34,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-02-20 11:53:34,511 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:53:34,512 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-20 11:53:34,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:34,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:53:34,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:35,874 INFO L124 PetriNetUnfolderBase]: 3216/5088 cut-off events. [2024-02-20 11:53:35,874 INFO L125 PetriNetUnfolderBase]: For 3751/4091 co-relation queries the response was YES. [2024-02-20 11:53:35,879 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-20 11:53:35,908 INFO L140 encePairwiseOnDemand]: 74/95 looper letters, 210 selfloop transitions, 22 changer transitions 20/259 dead transitions. [2024-02-20 11:53:35,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 259 transitions, 3584 flow [2024-02-20 11:53:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:53:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:53:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2024-02-20 11:53:35,910 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2024-02-20 11:53:35,911 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 21 predicate places. [2024-02-20 11:53:35,911 INFO L507 AbstractCegarLoop]: Abstraction has has 92 places, 259 transitions, 3584 flow [2024-02-20 11:53:35,911 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-20 11:53:35,911 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:35,911 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-20 11:53:35,939 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-20 11:53:36,139 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-20 11:53:36,139 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-20 11:53:36,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:36,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1398570761, now seen corresponding path program 1 times [2024-02-20 11:53:36,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:36,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351852968] [2024-02-20 11:53:36,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:36,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:36,387 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-20 11:53:36,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:36,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351852968] [2024-02-20 11:53:36,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351852968] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:53:36,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15922337] [2024-02-20 11:53:36,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:36,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:53:36,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:53:36,389 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-20 11:53:36,416 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-20 11:53:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:36,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-20 11:53:36,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:53:36,857 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-20 11:53:36,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:53:36,885 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-20 11:53:36,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15922337] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:53:36,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:53:36,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-02-20 11:53:36,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783433606] [2024-02-20 11:53:36,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:53:36,886 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-20 11:53:36,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:36,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-20 11:53:36,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2024-02-20 11:53:36,887 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:53:36,888 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-20 11:53:36,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:36,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:53:36,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:38,174 INFO L124 PetriNetUnfolderBase]: 3216/5092 cut-off events. [2024-02-20 11:53:38,178 INFO L125 PetriNetUnfolderBase]: For 5215/5603 co-relation queries the response was YES. [2024-02-20 11:53:38,184 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-20 11:53:38,258 INFO L140 encePairwiseOnDemand]: 78/95 looper letters, 192 selfloop transitions, 44 changer transitions 20/263 dead transitions. [2024-02-20 11:53:38,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 263 transitions, 4152 flow [2024-02-20 11:53:38,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-20 11:53:38,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-20 11:53:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2024-02-20 11:53:38,262 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.21052631578947367 [2024-02-20 11:53:38,263 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 31 predicate places. [2024-02-20 11:53:38,264 INFO L507 AbstractCegarLoop]: Abstraction has has 102 places, 263 transitions, 4152 flow [2024-02-20 11:53:38,264 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-20 11:53:38,264 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:38,264 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-20 11:53:38,294 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-20 11:53:38,494 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-20 11:53:38,495 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-20 11:53:38,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:38,496 INFO L85 PathProgramCache]: Analyzing trace with hash -726520865, now seen corresponding path program 2 times [2024-02-20 11:53:38,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:38,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954865995] [2024-02-20 11:53:38,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:38,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:38,714 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-20 11:53:38,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:38,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954865995] [2024-02-20 11:53:38,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954865995] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:53:38,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994791489] [2024-02-20 11:53:38,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 11:53:38,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:53:38,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:53:38,716 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-20 11:53:38,740 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-20 11:53:39,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-20 11:53:39,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:53:39,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-20 11:53:39,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:53:39,158 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-20 11:53:39,158 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 11:53:39,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994791489] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:39,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-20 11:53:39,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-02-20 11:53:39,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574641491] [2024-02-20 11:53:39,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:39,159 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:53:39,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:39,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:53:39,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-02-20 11:53:39,160 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:53:39,160 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-20 11:53:39,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:39,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:53:39,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:40,349 INFO L124 PetriNetUnfolderBase]: 3352/5460 cut-off events. [2024-02-20 11:53:40,349 INFO L125 PetriNetUnfolderBase]: For 8660/8940 co-relation queries the response was YES. [2024-02-20 11:53:40,354 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-20 11:53:40,386 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 283 selfloop transitions, 24 changer transitions 42/356 dead transitions. [2024-02-20 11:53:40,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 356 transitions, 6359 flow [2024-02-20 11:53:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:53:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:53:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-02-20 11:53:40,387 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2024-02-20 11:53:40,388 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 33 predicate places. [2024-02-20 11:53:40,388 INFO L507 AbstractCegarLoop]: Abstraction has has 104 places, 356 transitions, 6359 flow [2024-02-20 11:53:40,388 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-20 11:53:40,388 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:40,388 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-20 11:53:40,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-02-20 11:53:40,601 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-20 11:53:40,604 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-20 11:53:40,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:40,604 INFO L85 PathProgramCache]: Analyzing trace with hash 751125893, now seen corresponding path program 3 times [2024-02-20 11:53:40,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:40,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925573049] [2024-02-20 11:53:40,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:40,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:40,871 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-20 11:53:40,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:40,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925573049] [2024-02-20 11:53:40,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925573049] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:53:40,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336272866] [2024-02-20 11:53:40,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 11:53:40,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:53:40,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:53:40,873 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-20 11:53:40,899 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-20 11:53:41,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-02-20 11:53:41,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:53:41,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-20 11:53:41,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:53:41,314 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-20 11:53:41,315 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 11:53:41,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336272866] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:41,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-20 11:53:41,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-02-20 11:53:41,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928121933] [2024-02-20 11:53:41,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:41,316 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:53:41,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:41,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:53:41,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-02-20 11:53:41,316 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:53:41,317 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-20 11:53:41,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:41,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:53:41,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:42,810 INFO L124 PetriNetUnfolderBase]: 3292/5380 cut-off events. [2024-02-20 11:53:42,810 INFO L125 PetriNetUnfolderBase]: For 10292/10536 co-relation queries the response was YES. [2024-02-20 11:53:42,815 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-20 11:53:42,852 INFO L140 encePairwiseOnDemand]: 81/95 looper letters, 265 selfloop transitions, 0 changer transitions 72/344 dead transitions. [2024-02-20 11:53:42,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 344 transitions, 6817 flow [2024-02-20 11:53:42,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:53:42,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:53:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2024-02-20 11:53:42,854 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5403508771929825 [2024-02-20 11:53:42,854 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 35 predicate places. [2024-02-20 11:53:42,854 INFO L507 AbstractCegarLoop]: Abstraction has has 106 places, 344 transitions, 6817 flow [2024-02-20 11:53:42,854 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-20 11:53:42,854 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:42,855 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-20 11:53:42,880 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-20 11:53:43,081 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-20 11:53:43,081 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-20 11:53:43,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:43,082 INFO L85 PathProgramCache]: Analyzing trace with hash -124437791, now seen corresponding path program 1 times [2024-02-20 11:53:43,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:43,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748748536] [2024-02-20 11:53:43,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:43,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:43,539 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-20 11:53:43,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:43,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748748536] [2024-02-20 11:53:43,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748748536] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:43,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:53:43,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:53:43,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199329435] [2024-02-20 11:53:43,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:43,540 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 11:53:43,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:43,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 11:53:43,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-02-20 11:53:43,542 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:53:43,542 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-20 11:53:43,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:43,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:53:43,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:44,969 INFO L124 PetriNetUnfolderBase]: 3652/6043 cut-off events. [2024-02-20 11:53:44,970 INFO L125 PetriNetUnfolderBase]: For 13393/13687 co-relation queries the response was YES. [2024-02-20 11:53:44,976 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-20 11:53:45,019 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 289 selfloop transitions, 43 changer transitions 93/432 dead transitions. [2024-02-20 11:53:45,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 432 transitions, 9448 flow [2024-02-20 11:53:45,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:53:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:53:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2024-02-20 11:53:45,021 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-02-20 11:53:45,021 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 37 predicate places. [2024-02-20 11:53:45,022 INFO L507 AbstractCegarLoop]: Abstraction has has 108 places, 432 transitions, 9448 flow [2024-02-20 11:53:45,022 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-20 11:53:45,022 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:45,022 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-20 11:53:45,022 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-20 11:53:45,022 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-20 11:53:45,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:45,023 INFO L85 PathProgramCache]: Analyzing trace with hash 175415469, now seen corresponding path program 1 times [2024-02-20 11:53:45,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:45,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846456446] [2024-02-20 11:53:45,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:45,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:45,229 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-20 11:53:45,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:45,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846456446] [2024-02-20 11:53:45,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846456446] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:53:45,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667363313] [2024-02-20 11:53:45,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:45,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:53:45,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:53:45,231 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-20 11:53:45,260 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-20 11:53:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:45,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 11:53:45,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:53:45,809 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-20 11:53:45,809 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:53:45,869 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-20 11:53:45,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667363313] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:53:45,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:53:45,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-02-20 11:53:45,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55976854] [2024-02-20 11:53:45,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:53:45,871 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-02-20 11:53:45,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:45,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-02-20 11:53:45,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=200, Unknown=0, NotChecked=0, Total=380 [2024-02-20 11:53:45,872 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:53:45,872 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-20 11:53:45,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:45,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:53:45,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:47,475 INFO L124 PetriNetUnfolderBase]: 3652/6057 cut-off events. [2024-02-20 11:53:47,476 INFO L125 PetriNetUnfolderBase]: For 15962/16136 co-relation queries the response was YES. [2024-02-20 11:53:47,481 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-20 11:53:47,526 INFO L140 encePairwiseOnDemand]: 78/95 looper letters, 288 selfloop transitions, 58 changer transitions 93/446 dead transitions. [2024-02-20 11:53:47,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 446 transitions, 10634 flow [2024-02-20 11:53:47,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-20 11:53:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-20 11:53:47,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 271 transitions. [2024-02-20 11:53:47,528 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.2037593984962406 [2024-02-20 11:53:47,528 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 50 predicate places. [2024-02-20 11:53:47,528 INFO L507 AbstractCegarLoop]: Abstraction has has 121 places, 446 transitions, 10634 flow [2024-02-20 11:53:47,529 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-20 11:53:47,529 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:47,529 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-20 11:53:47,554 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-20 11:53:47,751 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-20 11:53:47,752 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-20 11:53:47,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:47,752 INFO L85 PathProgramCache]: Analyzing trace with hash -780417637, now seen corresponding path program 2 times [2024-02-20 11:53:47,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:47,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129552880] [2024-02-20 11:53:47,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:47,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:48,190 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-20 11:53:48,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:48,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129552880] [2024-02-20 11:53:48,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129552880] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:53:48,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848532725] [2024-02-20 11:53:48,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 11:53:48,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:53:48,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:53:48,197 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-20 11:53:48,223 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-20 11:53:48,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-20 11:53:48,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:53:48,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-20 11:53:48,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:53:48,741 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-20 11:53:48,741 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 11:53:48,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848532725] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:48,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-20 11:53:48,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 16 [2024-02-20 11:53:48,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058481814] [2024-02-20 11:53:48,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:48,742 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:53:48,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:48,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:53:48,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2024-02-20 11:53:48,743 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:53:48,743 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-20 11:53:48,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:48,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:53:48,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:50,389 INFO L124 PetriNetUnfolderBase]: 3672/6316 cut-off events. [2024-02-20 11:53:50,390 INFO L125 PetriNetUnfolderBase]: For 20813/20901 co-relation queries the response was YES. [2024-02-20 11:53:50,396 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-20 11:53:50,443 INFO L140 encePairwiseOnDemand]: 83/95 looper letters, 368 selfloop transitions, 8 changer transitions 153/536 dead transitions. [2024-02-20 11:53:50,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 536 transitions, 13879 flow [2024-02-20 11:53:50,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:53:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:53:50,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2024-02-20 11:53:50,446 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5649122807017544 [2024-02-20 11:53:50,447 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 52 predicate places. [2024-02-20 11:53:50,447 INFO L507 AbstractCegarLoop]: Abstraction has has 123 places, 536 transitions, 13879 flow [2024-02-20 11:53:50,447 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-20 11:53:50,447 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:50,447 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-20 11:53:50,460 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-20 11:53:50,656 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-20 11:53:50,656 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-20 11:53:50,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:50,657 INFO L85 PathProgramCache]: Analyzing trace with hash 898252845, now seen corresponding path program 3 times [2024-02-20 11:53:50,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:50,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865851488] [2024-02-20 11:53:50,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:50,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:51,124 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-20 11:53:51,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:51,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865851488] [2024-02-20 11:53:51,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865851488] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:53:51,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290423592] [2024-02-20 11:53:51,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 11:53:51,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:53:51,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:53:51,126 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-20 11:53:51,152 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-20 11:53:51,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-02-20 11:53:51,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:53:51,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-20 11:53:51,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:53:51,630 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-20 11:53:51,631 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 11:53:51,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290423592] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:51,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-20 11:53:51,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 16 [2024-02-20 11:53:51,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842670808] [2024-02-20 11:53:51,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:51,632 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:53:51,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:51,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:53:51,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2024-02-20 11:53:51,633 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:53:51,633 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-20 11:53:51,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:51,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:53:51,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:53,204 INFO L124 PetriNetUnfolderBase]: 3288/5630 cut-off events. [2024-02-20 11:53:53,204 INFO L125 PetriNetUnfolderBase]: For 20299/20395 co-relation queries the response was YES. [2024-02-20 11:53:53,209 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-20 11:53:53,247 INFO L140 encePairwiseOnDemand]: 83/95 looper letters, 298 selfloop transitions, 10 changer transitions 149/464 dead transitions. [2024-02-20 11:53:53,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 464 transitions, 12897 flow [2024-02-20 11:53:53,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:53:53,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:53:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2024-02-20 11:53:53,249 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5368421052631579 [2024-02-20 11:53:53,249 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 54 predicate places. [2024-02-20 11:53:53,250 INFO L507 AbstractCegarLoop]: Abstraction has has 125 places, 464 transitions, 12897 flow [2024-02-20 11:53:53,250 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-20 11:53:53,250 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:53,250 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-20 11:53:53,265 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-20 11:53:53,463 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-20 11:53:53,464 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-20 11:53:53,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:53,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1179565557, now seen corresponding path program 1 times [2024-02-20 11:53:53,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:53,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484084287] [2024-02-20 11:53:53,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:53,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:53,855 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-20 11:53:53,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:53,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484084287] [2024-02-20 11:53:53,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484084287] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:53:53,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055188943] [2024-02-20 11:53:53,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:53,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:53:53,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:53:53,857 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-20 11:53:53,858 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-20 11:53:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:54,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 16 conjunts are in the unsatisfiable core [2024-02-20 11:53:54,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:53:54,569 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-20 11:53:54,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:53:54,685 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-20 11:53:54,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055188943] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:53:54,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:53:54,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2024-02-20 11:53:54,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759322361] [2024-02-20 11:53:54,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:53:54,686 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-02-20 11:53:54,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:54,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-02-20 11:53:54,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=484, Unknown=0, NotChecked=0, Total=812 [2024-02-20 11:53:54,688 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:53:54,688 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-20 11:53:54,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:54,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:53:54,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:56,411 INFO L124 PetriNetUnfolderBase]: 3288/5632 cut-off events. [2024-02-20 11:53:56,411 INFO L125 PetriNetUnfolderBase]: For 23653/23757 co-relation queries the response was YES. [2024-02-20 11:53:56,416 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-20 11:53:56,454 INFO L140 encePairwiseOnDemand]: 78/95 looper letters, 250 selfloop transitions, 60 changer transitions 149/466 dead transitions. [2024-02-20 11:53:56,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 466 transitions, 13871 flow [2024-02-20 11:53:56,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-02-20 11:53:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-02-20 11:53:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 315 transitions. [2024-02-20 11:53:56,457 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.16578947368421051 [2024-02-20 11:53:56,457 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 73 predicate places. [2024-02-20 11:53:56,457 INFO L507 AbstractCegarLoop]: Abstraction has has 144 places, 466 transitions, 13871 flow [2024-02-20 11:53:56,457 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-20 11:53:56,457 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:56,457 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-20 11:53:56,474 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-20 11:53:56,672 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-20 11:53:56,672 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-20 11:53:56,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:56,673 INFO L85 PathProgramCache]: Analyzing trace with hash -161780707, now seen corresponding path program 2 times [2024-02-20 11:53:56,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:56,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429044665] [2024-02-20 11:53:56,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:56,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:57,110 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-20 11:53:57,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:57,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429044665] [2024-02-20 11:53:57,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429044665] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:57,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:53:57,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:53:57,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429747513] [2024-02-20 11:53:57,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:57,111 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:53:57,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:57,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:53:57,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:53:57,112 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:53:57,112 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-20 11:53:57,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:57,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:53:57,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:58,821 INFO L124 PetriNetUnfolderBase]: 3428/5909 cut-off events. [2024-02-20 11:53:58,822 INFO L125 PetriNetUnfolderBase]: For 26664/26776 co-relation queries the response was YES. [2024-02-20 11:53:58,827 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-20 11:53:58,869 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 337 selfloop transitions, 4 changer transitions 160/508 dead transitions. [2024-02-20 11:53:58,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 508 transitions, 16154 flow [2024-02-20 11:53:58,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:53:58,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:53:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2024-02-20 11:53:58,870 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4052631578947368 [2024-02-20 11:53:58,870 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 76 predicate places. [2024-02-20 11:53:58,870 INFO L507 AbstractCegarLoop]: Abstraction has has 147 places, 508 transitions, 16154 flow [2024-02-20 11:53:58,871 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-20 11:53:58,871 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:58,871 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-20 11:53:58,871 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-20 11:53:58,871 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-20 11:53:58,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash 155082333, now seen corresponding path program 3 times [2024-02-20 11:53:58,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:58,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707886392] [2024-02-20 11:53:58,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:58,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:59,457 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-20 11:53:59,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:59,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707886392] [2024-02-20 11:53:59,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707886392] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:59,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:53:59,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:53:59,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824412057] [2024-02-20 11:53:59,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:59,458 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:53:59,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:59,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:53:59,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:53:59,459 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:53:59,459 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-20 11:53:59,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:59,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:53:59,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:01,493 INFO L124 PetriNetUnfolderBase]: 3530/6124 cut-off events. [2024-02-20 11:54:01,493 INFO L125 PetriNetUnfolderBase]: For 32227/32617 co-relation queries the response was YES. [2024-02-20 11:54:01,498 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-20 11:54:01,547 INFO L140 encePairwiseOnDemand]: 74/95 looper letters, 344 selfloop transitions, 28 changer transitions 170/549 dead transitions. [2024-02-20 11:54:01,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 549 transitions, 18568 flow [2024-02-20 11:54:01,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:54:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:54:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2024-02-20 11:54:01,549 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4610526315789474 [2024-02-20 11:54:01,549 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 80 predicate places. [2024-02-20 11:54:01,549 INFO L507 AbstractCegarLoop]: Abstraction has has 151 places, 549 transitions, 18568 flow [2024-02-20 11:54:01,550 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-20 11:54:01,550 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:01,550 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-20 11:54:01,550 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-20 11:54:01,550 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-20 11:54:01,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:01,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1146750943, now seen corresponding path program 1 times [2024-02-20 11:54:01,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:01,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449456117] [2024-02-20 11:54:01,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:01,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:02,246 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-20 11:54:02,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:02,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449456117] [2024-02-20 11:54:02,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449456117] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:02,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:02,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:54:02,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103835828] [2024-02-20 11:54:02,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:02,248 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:54:02,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:02,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:54:02,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:54:02,249 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:54:02,249 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-20 11:54:02,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:02,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:54:02,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:04,326 INFO L124 PetriNetUnfolderBase]: 3632/6419 cut-off events. [2024-02-20 11:54:04,326 INFO L125 PetriNetUnfolderBase]: For 37247/37375 co-relation queries the response was YES. [2024-02-20 11:54:04,331 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-20 11:54:04,379 INFO L140 encePairwiseOnDemand]: 85/95 looper letters, 386 selfloop transitions, 18 changer transitions 189/600 dead transitions. [2024-02-20 11:54:04,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 600 transitions, 21512 flow [2024-02-20 11:54:04,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:54:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:54:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2024-02-20 11:54:04,381 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5298245614035088 [2024-02-20 11:54:04,381 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 82 predicate places. [2024-02-20 11:54:04,381 INFO L507 AbstractCegarLoop]: Abstraction has has 153 places, 600 transitions, 21512 flow [2024-02-20 11:54:04,381 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-20 11:54:04,382 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:04,382 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-20 11:54:04,382 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-20 11:54:04,382 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-20 11:54:04,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:04,382 INFO L85 PathProgramCache]: Analyzing trace with hash -682114967, now seen corresponding path program 2 times [2024-02-20 11:54:04,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:04,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142309816] [2024-02-20 11:54:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:04,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:05,015 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-20 11:54:05,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:05,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142309816] [2024-02-20 11:54:05,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142309816] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:05,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:05,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:54:05,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209239873] [2024-02-20 11:54:05,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:05,016 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:54:05,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:05,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:54:05,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:54:05,018 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:54:05,019 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-20 11:54:05,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:05,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:54:05,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:07,154 INFO L124 PetriNetUnfolderBase]: 3468/6111 cut-off events. [2024-02-20 11:54:07,155 INFO L125 PetriNetUnfolderBase]: For 38169/38305 co-relation queries the response was YES. [2024-02-20 11:54:07,160 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-20 11:54:07,210 INFO L140 encePairwiseOnDemand]: 85/95 looper letters, 325 selfloop transitions, 4 changer transitions 202/538 dead transitions. [2024-02-20 11:54:07,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 538 transitions, 20315 flow [2024-02-20 11:54:07,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:54:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:54:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2024-02-20 11:54:07,212 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5298245614035088 [2024-02-20 11:54:07,213 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 84 predicate places. [2024-02-20 11:54:07,213 INFO L507 AbstractCegarLoop]: Abstraction has has 155 places, 538 transitions, 20315 flow [2024-02-20 11:54:07,213 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-20 11:54:07,213 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:07,218 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-20 11:54:07,218 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-20 11:54:07,219 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-20 11:54:07,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:07,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1338269484, now seen corresponding path program 1 times [2024-02-20 11:54:07,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:07,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044144150] [2024-02-20 11:54:07,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:07,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:08,121 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-20 11:54:08,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:08,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044144150] [2024-02-20 11:54:08,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044144150] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:08,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:08,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:54:08,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090466176] [2024-02-20 11:54:08,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:08,123 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:54:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:08,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:54:08,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:54:08,123 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:54:08,124 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-20 11:54:08,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:08,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:54:08,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:10,094 INFO L124 PetriNetUnfolderBase]: 3648/6500 cut-off events. [2024-02-20 11:54:10,095 INFO L125 PetriNetUnfolderBase]: For 42660/42804 co-relation queries the response was YES. [2024-02-20 11:54:10,101 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-20 11:54:10,165 INFO L140 encePairwiseOnDemand]: 85/95 looper letters, 340 selfloop transitions, 10 changer transitions 236/593 dead transitions. [2024-02-20 11:54:10,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 593 transitions, 23598 flow [2024-02-20 11:54:10,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:54:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:54:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-02-20 11:54:10,166 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5578947368421052 [2024-02-20 11:54:10,167 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 86 predicate places. [2024-02-20 11:54:10,167 INFO L507 AbstractCegarLoop]: Abstraction has has 157 places, 593 transitions, 23598 flow [2024-02-20 11:54:10,167 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-20 11:54:10,167 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:10,167 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-20 11:54:10,167 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-02-20 11:54:10,168 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-20 11:54:10,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:10,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2031526764, now seen corresponding path program 2 times [2024-02-20 11:54:10,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:10,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835726976] [2024-02-20 11:54:10,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:10,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:10,967 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-20 11:54:10,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:10,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835726976] [2024-02-20 11:54:10,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835726976] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:10,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:10,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:54:10,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107878918] [2024-02-20 11:54:10,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:10,968 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:54:10,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:10,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:54:10,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:54:10,969 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:54:10,969 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-20 11:54:10,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:10,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:54:10,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:12,954 INFO L124 PetriNetUnfolderBase]: 3530/6292 cut-off events. [2024-02-20 11:54:12,954 INFO L125 PetriNetUnfolderBase]: For 47349/47501 co-relation queries the response was YES. [2024-02-20 11:54:12,960 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-20 11:54:13,020 INFO L140 encePairwiseOnDemand]: 85/95 looper letters, 274 selfloop transitions, 5 changer transitions 263/549 dead transitions. [2024-02-20 11:54:13,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 549 transitions, 22898 flow [2024-02-20 11:54:13,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:54:13,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:54:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2024-02-20 11:54:13,022 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5298245614035088 [2024-02-20 11:54:13,022 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 88 predicate places. [2024-02-20 11:54:13,022 INFO L507 AbstractCegarLoop]: Abstraction has has 159 places, 549 transitions, 22898 flow [2024-02-20 11:54:13,022 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-20 11:54:13,022 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:13,023 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-20 11:54:13,023 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-02-20 11:54:13,023 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-20 11:54:13,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:13,023 INFO L85 PathProgramCache]: Analyzing trace with hash -869072853, now seen corresponding path program 1 times [2024-02-20 11:54:13,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:13,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275947298] [2024-02-20 11:54:13,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:13,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:13,123 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-20 11:54:13,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:13,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275947298] [2024-02-20 11:54:13,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275947298] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:13,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:13,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:54:13,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737945259] [2024-02-20 11:54:13,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:13,124 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:54:13,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:13,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:54:13,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:54:13,125 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:54:13,125 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-20 11:54:13,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:13,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:54:13,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:15,961 INFO L124 PetriNetUnfolderBase]: 3466/6199 cut-off events. [2024-02-20 11:54:15,961 INFO L125 PetriNetUnfolderBase]: For 53139/53299 co-relation queries the response was YES. [2024-02-20 11:54:15,968 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-20 11:54:16,030 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 252 selfloop transitions, 5 changer transitions 276/540 dead transitions. [2024-02-20 11:54:16,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 540 transitions, 23583 flow [2024-02-20 11:54:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:54:16,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:54:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-02-20 11:54:16,031 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.512280701754386 [2024-02-20 11:54:16,032 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 90 predicate places. [2024-02-20 11:54:16,032 INFO L507 AbstractCegarLoop]: Abstraction has has 161 places, 540 transitions, 23583 flow [2024-02-20 11:54:16,032 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-20 11:54:16,032 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:16,032 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-20 11:54:16,032 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-02-20 11:54:16,033 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-20 11:54:16,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:16,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1176993533, now seen corresponding path program 2 times [2024-02-20 11:54:16,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:16,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701486276] [2024-02-20 11:54:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:16,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:16,152 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-20 11:54:16,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:16,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701486276] [2024-02-20 11:54:16,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701486276] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:16,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:16,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:54:16,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227609219] [2024-02-20 11:54:16,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:16,153 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:54:16,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:16,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:54:16,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:54:16,154 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:54:16,154 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-20 11:54:16,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:16,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:54:16,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:18,429 INFO L124 PetriNetUnfolderBase]: 3440/6142 cut-off events. [2024-02-20 11:54:18,429 INFO L125 PetriNetUnfolderBase]: For 57504/57672 co-relation queries the response was YES. [2024-02-20 11:54:18,434 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-20 11:54:18,477 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 238 selfloop transitions, 0 changer transitions 283/528 dead transitions. [2024-02-20 11:54:18,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 528 transitions, 24091 flow [2024-02-20 11:54:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:54:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:54:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2024-02-20 11:54:18,487 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5017543859649123 [2024-02-20 11:54:18,487 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 92 predicate places. [2024-02-20 11:54:18,487 INFO L507 AbstractCegarLoop]: Abstraction has has 163 places, 528 transitions, 24091 flow [2024-02-20 11:54:18,487 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-20 11:54:18,487 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:18,495 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-20 11:54:18,495 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-02-20 11:54:18,495 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-20 11:54:18,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:18,496 INFO L85 PathProgramCache]: Analyzing trace with hash 562450911, now seen corresponding path program 1 times [2024-02-20 11:54:18,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:18,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145096308] [2024-02-20 11:54:18,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:18,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:18,690 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-20 11:54:18,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:18,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145096308] [2024-02-20 11:54:18,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145096308] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:18,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:18,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:54:18,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105050625] [2024-02-20 11:54:18,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:18,691 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:54:18,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:18,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:54:18,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:54:18,692 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:54:18,692 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-20 11:54:18,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:18,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:54:18,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:20,874 INFO L124 PetriNetUnfolderBase]: 3379/6052 cut-off events. [2024-02-20 11:54:20,874 INFO L125 PetriNetUnfolderBase]: For 68413/69049 co-relation queries the response was YES. [2024-02-20 11:54:20,880 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-20 11:54:20,943 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 237 selfloop transitions, 4 changer transitions 270/518 dead transitions. [2024-02-20 11:54:20,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 518 transitions, 24653 flow [2024-02-20 11:54:20,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:54:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:54:20,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2024-02-20 11:54:20,944 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.47719298245614034 [2024-02-20 11:54:20,944 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 94 predicate places. [2024-02-20 11:54:20,945 INFO L507 AbstractCegarLoop]: Abstraction has has 165 places, 518 transitions, 24653 flow [2024-02-20 11:54:20,945 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-20 11:54:20,945 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:20,945 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-20 11:54:20,945 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-02-20 11:54:20,945 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-20 11:54:20,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:20,946 INFO L85 PathProgramCache]: Analyzing trace with hash -543775550, now seen corresponding path program 1 times [2024-02-20 11:54:20,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:20,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724536392] [2024-02-20 11:54:20,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:20,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:21,121 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-20 11:54:21,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:21,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724536392] [2024-02-20 11:54:21,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724536392] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:21,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:21,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:54:21,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258791890] [2024-02-20 11:54:21,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:21,123 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:54:21,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:21,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:54:21,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:54:21,124 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:54:21,125 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-20 11:54:21,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:21,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:54:21,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:23,458 INFO L124 PetriNetUnfolderBase]: 3292/5901 cut-off events. [2024-02-20 11:54:23,458 INFO L125 PetriNetUnfolderBase]: For 73616/73800 co-relation queries the response was YES. [2024-02-20 11:54:23,463 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-20 11:54:23,514 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 234 selfloop transitions, 3 changer transitions 260/504 dead transitions. [2024-02-20 11:54:23,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 504 transitions, 24969 flow [2024-02-20 11:54:23,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:54:23,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:54:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-02-20 11:54:23,516 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4842105263157895 [2024-02-20 11:54:23,516 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 96 predicate places. [2024-02-20 11:54:23,516 INFO L507 AbstractCegarLoop]: Abstraction has has 167 places, 504 transitions, 24969 flow [2024-02-20 11:54:23,516 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-20 11:54:23,516 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:23,516 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-20 11:54:23,517 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-02-20 11:54:23,517 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-20 11:54:23,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:23,517 INFO L85 PathProgramCache]: Analyzing trace with hash -10597608, now seen corresponding path program 1 times [2024-02-20 11:54:23,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:23,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135678346] [2024-02-20 11:54:23,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:23,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:23,746 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-20 11:54:23,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:23,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135678346] [2024-02-20 11:54:23,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135678346] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:23,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:23,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:54:23,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264771226] [2024-02-20 11:54:23,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:23,748 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:54:23,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:23,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:54:23,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:54:23,749 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:54:23,749 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-20 11:54:23,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:23,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:54:23,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:26,162 INFO L124 PetriNetUnfolderBase]: 3298/5920 cut-off events. [2024-02-20 11:54:26,162 INFO L125 PetriNetUnfolderBase]: For 80003/80195 co-relation queries the response was YES. [2024-02-20 11:54:26,168 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-20 11:54:26,236 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 228 selfloop transitions, 1 changer transitions 276/512 dead transitions. [2024-02-20 11:54:26,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 512 transitions, 26385 flow [2024-02-20 11:54:26,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:54:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:54:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2024-02-20 11:54:26,238 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.38421052631578945 [2024-02-20 11:54:26,238 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 99 predicate places. [2024-02-20 11:54:26,238 INFO L507 AbstractCegarLoop]: Abstraction has has 170 places, 512 transitions, 26385 flow [2024-02-20 11:54:26,238 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-20 11:54:26,238 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:26,239 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-20 11:54:26,239 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-02-20 11:54:26,239 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-20 11:54:26,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:26,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1607765544, now seen corresponding path program 2 times [2024-02-20 11:54:26,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:26,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885100337] [2024-02-20 11:54:26,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:26,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:26,472 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-20 11:54:26,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:26,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885100337] [2024-02-20 11:54:26,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885100337] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:26,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:26,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:54:26,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151474874] [2024-02-20 11:54:26,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:26,473 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:54:26,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:26,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:54:26,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:54:26,474 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:54:26,474 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-20 11:54:26,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:26,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:54:26,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:28,797 INFO L124 PetriNetUnfolderBase]: 3298/5918 cut-off events. [2024-02-20 11:54:28,797 INFO L125 PetriNetUnfolderBase]: For 88824/89384 co-relation queries the response was YES. [2024-02-20 11:54:28,803 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-20 11:54:28,865 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 210 selfloop transitions, 0 changer transitions 298/515 dead transitions. [2024-02-20 11:54:28,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 515 transitions, 27560 flow [2024-02-20 11:54:28,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:54:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:54:28,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2024-02-20 11:54:28,867 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3763157894736842 [2024-02-20 11:54:28,867 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 102 predicate places. [2024-02-20 11:54:28,868 INFO L507 AbstractCegarLoop]: Abstraction has has 173 places, 515 transitions, 27560 flow [2024-02-20 11:54:28,868 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-20 11:54:28,868 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:28,868 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-20 11:54:28,868 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-02-20 11:54:28,868 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-20 11:54:28,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:28,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1047873707, now seen corresponding path program 1 times [2024-02-20 11:54:28,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:28,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958075169] [2024-02-20 11:54:28,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:28,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:29,085 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-20 11:54:29,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:29,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958075169] [2024-02-20 11:54:29,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958075169] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:29,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:29,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:54:29,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698271062] [2024-02-20 11:54:29,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:29,087 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:54:29,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:29,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:54:29,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:54:29,088 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:54:29,088 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-20 11:54:29,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:29,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:54:29,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:31,760 INFO L124 PetriNetUnfolderBase]: 3304/5937 cut-off events. [2024-02-20 11:54:31,761 INFO L125 PetriNetUnfolderBase]: For 92519/92571 co-relation queries the response was YES. [2024-02-20 11:54:31,765 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-20 11:54:31,811 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 202 selfloop transitions, 1 changer transitions 313/523 dead transitions. [2024-02-20 11:54:31,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 523 transitions, 29030 flow [2024-02-20 11:54:31,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:54:31,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:54:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2024-02-20 11:54:31,812 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.38421052631578945 [2024-02-20 11:54:31,812 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 105 predicate places. [2024-02-20 11:54:31,812 INFO L507 AbstractCegarLoop]: Abstraction has has 176 places, 523 transitions, 29030 flow [2024-02-20 11:54:31,812 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-20 11:54:31,813 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:31,813 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-20 11:54:31,813 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-02-20 11:54:31,813 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-20 11:54:31,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:31,813 INFO L85 PathProgramCache]: Analyzing trace with hash 242840963, now seen corresponding path program 2 times [2024-02-20 11:54:31,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:31,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495638541] [2024-02-20 11:54:31,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:31,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:32,007 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-20 11:54:32,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:32,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495638541] [2024-02-20 11:54:32,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495638541] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:32,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:32,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:54:32,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834580379] [2024-02-20 11:54:32,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:32,008 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:54:32,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:32,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:54:32,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:54:32,009 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:54:32,009 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-20 11:54:32,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:32,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:54:32,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:34,415 INFO L124 PetriNetUnfolderBase]: 3304/5935 cut-off events. [2024-02-20 11:54:34,415 INFO L125 PetriNetUnfolderBase]: For 99620/99674 co-relation queries the response was YES. [2024-02-20 11:54:34,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164970 conditions, 5935 events. 3304/5935 cut-off events. For 99620/99674 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 41184 event pairs, 512 based on Foata normal form. 1/4577 useless extension candidates. Maximal degree in co-relation 148557. Up to 5670 conditions per place. [2024-02-20 11:54:34,479 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 179 selfloop transitions, 0 changer transitions 340/526 dead transitions. [2024-02-20 11:54:34,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 526 transitions, 30239 flow [2024-02-20 11:54:34,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:54:34,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:54:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2024-02-20 11:54:34,481 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3763157894736842 [2024-02-20 11:54:34,484 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 108 predicate places. [2024-02-20 11:54:34,484 INFO L507 AbstractCegarLoop]: Abstraction has has 179 places, 526 transitions, 30239 flow [2024-02-20 11:54:34,484 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-20 11:54:34,484 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:34,485 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, 1] [2024-02-20 11:54:34,485 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-02-20 11:54:34,485 INFO L432 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:54:34,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:34,485 INFO L85 PathProgramCache]: Analyzing trace with hash -465745125, now seen corresponding path program 1 times [2024-02-20 11:54:34,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:34,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400179654] [2024-02-20 11:54:34,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:34,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:34,873 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-20 11:54:34,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:34,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400179654] [2024-02-20 11:54:34,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400179654] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:34,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:34,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:54:34,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961185554] [2024-02-20 11:54:34,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:34,874 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 11:54:34,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:34,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 11:54:34,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-02-20 11:54:34,875 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 95 [2024-02-20 11:54:34,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 526 transitions, 30239 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-20 11:54:34,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:34,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 95 [2024-02-20 11:54:34,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:37,764 INFO L124 PetriNetUnfolderBase]: 3482/6290 cut-off events. [2024-02-20 11:54:37,764 INFO L125 PetriNetUnfolderBase]: For 108227/108451 co-relation queries the response was YES. [2024-02-20 11:54:37,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181315 conditions, 6290 events. 3482/6290 cut-off events. For 108227/108451 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 44199 event pairs, 532 based on Foata normal form. 1/4859 useless extension candidates. Maximal degree in co-relation 162132. Up to 6025 conditions per place. [2024-02-20 11:54:37,828 INFO L140 encePairwiseOnDemand]: 81/95 looper letters, 191 selfloop transitions, 7 changer transitions 363/568 dead transitions. [2024-02-20 11:54:37,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 568 transitions, 33806 flow [2024-02-20 11:54:37,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:54:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:54:37,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2024-02-20 11:54:37,829 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5859649122807018 [2024-02-20 11:54:37,830 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, 110 predicate places. [2024-02-20 11:54:37,830 INFO L507 AbstractCegarLoop]: Abstraction has has 181 places, 568 transitions, 33806 flow [2024-02-20 11:54:37,830 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-20 11:54:37,830 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:37,831 INFO L234 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 2, 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, 1] [2024-02-20 11:54:37,831 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-02-20 11:54:37,831 INFO L432 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:54:37,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:37,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1991053504, now seen corresponding path program 1 times [2024-02-20 11:54:37,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:37,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129330397] [2024-02-20 11:54:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:37,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-02-20 11:54:42,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:42,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129330397] [2024-02-20 11:54:42,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129330397] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:54:42,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657049379] [2024-02-20 11:54:42,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:42,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:54:42,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:54:42,687 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:54:42,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-02-20 11:54:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:43,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 31 conjunts are in the unsatisfiable core [2024-02-20 11:54:43,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:54:47,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 11:54:47,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 337 treesize of output 1690