./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/test-easy11.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/test-easy11.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 a686a41ee4cc6bbffea13719827ccaf379a83824b0020cd9f2e7eecebabb9242 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 15:25:44,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:25:44,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 15:25:44,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:25:44,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:25:44,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:25:44,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:25:44,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:25:44,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:25:44,693 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:25:44,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:25:44,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:25:44,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:25:44,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:25:44,695 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:25:44,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:25:44,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:25:44,696 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:25:44,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 15:25:44,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:25:44,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:25:44,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:25:44,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:25:44,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:25:44,698 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:25:44,698 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:25:44,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:25:44,698 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:25:44,699 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:25:44,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:25:44,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:25:44,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:25:44,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:25:44,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:25:44,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:25:44,701 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:25:44,701 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 15:25:44,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 15:25:44,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:25:44,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:25:44,702 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:25:44,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:25:44,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:25:44,703 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 -> a686a41ee4cc6bbffea13719827ccaf379a83824b0020cd9f2e7eecebabb9242 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:25:44,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:25:45,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:25:45,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:25:45,017 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:25:45,018 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:25:45,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy11.wvr.c [2024-02-19 15:25:46,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:25:46,335 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:25:46,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy11.wvr.c [2024-02-19 15:25:46,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f13eed0b0/713ff12717ca44fe9d62d849a19b12da/FLAG544ed3284 [2024-02-19 15:25:46,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f13eed0b0/713ff12717ca44fe9d62d849a19b12da [2024-02-19 15:25:46,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:25:46,361 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:25:46,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:25:46,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:25:46,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:25:46,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:25:46" (1/1) ... [2024-02-19 15:25:46,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7362dc9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:25:46, skipping insertion in model container [2024-02-19 15:25:46,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:25:46" (1/1) ... [2024-02-19 15:25:46,388 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:25:46,533 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/test-easy11.wvr.c[2005,2018] [2024-02-19 15:25:46,537 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:25:46,544 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:25:46,565 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/test-easy11.wvr.c[2005,2018] [2024-02-19 15:25:46,572 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:25:46,590 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:25:46,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:25:46 WrapperNode [2024-02-19 15:25:46,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:25:46,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:25:46,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:25:46,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:25:46,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:25:46" (1/1) ... [2024-02-19 15:25:46,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:25:46" (1/1) ... [2024-02-19 15:25:46,623 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2024-02-19 15:25:46,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:25:46,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:25:46,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:25:46,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:25:46,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:25:46" (1/1) ... [2024-02-19 15:25:46,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:25:46" (1/1) ... [2024-02-19 15:25:46,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:25:46" (1/1) ... [2024-02-19 15:25:46,660 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-02-19 15:25:46,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:25:46" (1/1) ... [2024-02-19 15:25:46,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:25:46" (1/1) ... [2024-02-19 15:25:46,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:25:46" (1/1) ... [2024-02-19 15:25:46,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:25:46" (1/1) ... [2024-02-19 15:25:46,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:25:46" (1/1) ... [2024-02-19 15:25:46,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:25:46" (1/1) ... [2024-02-19 15:25:46,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:25:46,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:25:46,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:25:46,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:25:46,685 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:25:46" (1/1) ... [2024-02-19 15:25:46,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:25:46,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:25:46,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-19 15:25:46,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-19 15:25:46,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:25:46,784 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:25:46,784 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:25:46,784 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:25:46,784 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:25:46,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 15:25:46,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 15:25:46,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 15:25:46,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:25:46,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 15:25:46,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 15:25:46,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 15:25:46,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 15:25:46,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 15:25:46,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:25:46,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:25:46,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 15:25:46,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 15:25:46,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 15:25:46,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:25:46,790 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 15:25:46,887 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:25:46,888 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:25:47,047 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:25:47,047 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:25:47,128 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:25:47,128 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-19 15:25:47,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:25:47 BoogieIcfgContainer [2024-02-19 15:25:47,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:25:47,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:25:47,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:25:47,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:25:47,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:25:46" (1/3) ... [2024-02-19 15:25:47,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d616b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:25:47, skipping insertion in model container [2024-02-19 15:25:47,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:25:46" (2/3) ... [2024-02-19 15:25:47,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d616b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:25:47, skipping insertion in model container [2024-02-19 15:25:47,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:25:47" (3/3) ... [2024-02-19 15:25:47,135 INFO L112 eAbstractionObserver]: Analyzing ICFG test-easy11.wvr.c [2024-02-19 15:25:47,149 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:25:47,149 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:25:47,150 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:25:47,180 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-19 15:25:47,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 23 transitions, 60 flow [2024-02-19 15:25:47,225 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2024-02-19 15:25:47,225 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:25:47,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 2/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2024-02-19 15:25:47,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 23 transitions, 60 flow [2024-02-19 15:25:47,229 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 20 transitions, 52 flow [2024-02-19 15:25:47,236 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:25:47,254 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;@4e3b0c33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:25:47,254 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 15:25:47,261 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:25:47,265 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2024-02-19 15:25:47,265 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:25:47,265 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:47,266 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:47,266 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:47,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:47,273 INFO L85 PathProgramCache]: Analyzing trace with hash -986440590, now seen corresponding path program 1 times [2024-02-19 15:25:47,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:47,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899363234] [2024-02-19 15:25:47,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:47,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:47,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:47,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899363234] [2024-02-19 15:25:47,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899363234] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:47,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:47,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:47,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412718876] [2024-02-19 15:25:47,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:47,716 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:47,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:47,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:47,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:47,745 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:47,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 52 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:47,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:47,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:47,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:47,967 INFO L124 PetriNetUnfolderBase]: 114/209 cut-off events. [2024-02-19 15:25:47,967 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-02-19 15:25:47,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 209 events. 114/209 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 593 event pairs, 6 based on Foata normal form. 1/182 useless extension candidates. Maximal degree in co-relation 364. Up to 81 conditions per place. [2024-02-19 15:25:47,970 INFO L140 encePairwiseOnDemand]: 14/23 looper letters, 35 selfloop transitions, 10 changer transitions 10/56 dead transitions. [2024-02-19 15:25:47,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 56 transitions, 243 flow [2024-02-19 15:25:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2024-02-19 15:25:47,996 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.40096618357487923 [2024-02-19 15:25:47,998 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2024-02-19 15:25:47,999 INFO L507 AbstractCegarLoop]: Abstraction has has 33 places, 56 transitions, 243 flow [2024-02-19 15:25:47,999 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:47,999 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:47,999 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:47,999 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 15:25:47,999 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:48,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:48,000 INFO L85 PathProgramCache]: Analyzing trace with hash 726022896, now seen corresponding path program 2 times [2024-02-19 15:25:48,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:48,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983868023] [2024-02-19 15:25:48,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:48,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:48,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:48,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983868023] [2024-02-19 15:25:48,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983868023] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:48,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:48,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:48,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63267003] [2024-02-19 15:25:48,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:48,175 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:48,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:48,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:48,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:48,181 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:48,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 56 transitions, 243 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:48,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:48,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:48,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:48,385 INFO L124 PetriNetUnfolderBase]: 132/248 cut-off events. [2024-02-19 15:25:48,385 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-02-19 15:25:48,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 248 events. 132/248 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 783 event pairs, 16 based on Foata normal form. 1/219 useless extension candidates. Maximal degree in co-relation 672. Up to 154 conditions per place. [2024-02-19 15:25:48,389 INFO L140 encePairwiseOnDemand]: 14/23 looper letters, 51 selfloop transitions, 18 changer transitions 20/90 dead transitions. [2024-02-19 15:25:48,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 90 transitions, 569 flow [2024-02-19 15:25:48,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2024-02-19 15:25:48,392 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4251207729468599 [2024-02-19 15:25:48,394 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 16 predicate places. [2024-02-19 15:25:48,394 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 90 transitions, 569 flow [2024-02-19 15:25:48,394 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:48,394 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:48,395 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:48,395 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 15:25:48,396 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:48,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:48,397 INFO L85 PathProgramCache]: Analyzing trace with hash -200580752, now seen corresponding path program 3 times [2024-02-19 15:25:48,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:48,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453743613] [2024-02-19 15:25:48,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:48,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:48,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:48,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453743613] [2024-02-19 15:25:48,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453743613] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:48,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:48,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:48,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316810799] [2024-02-19 15:25:48,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:48,564 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:48,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:48,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:48,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:48,572 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:48,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 90 transitions, 569 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:48,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:48,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:48,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:48,769 INFO L124 PetriNetUnfolderBase]: 156/297 cut-off events. [2024-02-19 15:25:48,769 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-02-19 15:25:48,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 297 events. 156/297 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1043 event pairs, 4 based on Foata normal form. 1/262 useless extension candidates. Maximal degree in co-relation 1089. Up to 203 conditions per place. [2024-02-19 15:25:48,772 INFO L140 encePairwiseOnDemand]: 14/23 looper letters, 60 selfloop transitions, 18 changer transitions 32/111 dead transitions. [2024-02-19 15:25:48,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 111 transitions, 930 flow [2024-02-19 15:25:48,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2024-02-19 15:25:48,773 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4492753623188406 [2024-02-19 15:25:48,774 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 24 predicate places. [2024-02-19 15:25:48,774 INFO L507 AbstractCegarLoop]: Abstraction has has 49 places, 111 transitions, 930 flow [2024-02-19 15:25:48,774 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:48,774 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:48,774 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:48,774 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 15:25:48,775 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:48,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:48,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2095277432, now seen corresponding path program 4 times [2024-02-19 15:25:48,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:48,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847603526] [2024-02-19 15:25:48,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:48,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:48,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:48,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847603526] [2024-02-19 15:25:48,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847603526] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:48,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:48,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:48,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734584514] [2024-02-19 15:25:48,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:48,875 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:48,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:48,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:48,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:48,878 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:48,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 111 transitions, 930 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:48,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:48,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:48,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:49,050 INFO L124 PetriNetUnfolderBase]: 186/358 cut-off events. [2024-02-19 15:25:49,050 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2024-02-19 15:25:49,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1828 conditions, 358 events. 186/358 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1411 event pairs, 0 based on Foata normal form. 1/317 useless extension candidates. Maximal degree in co-relation 1663. Up to 264 conditions per place. [2024-02-19 15:25:49,053 INFO L140 encePairwiseOnDemand]: 14/23 looper letters, 65 selfloop transitions, 19 changer transitions 44/129 dead transitions. [2024-02-19 15:25:49,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 129 transitions, 1342 flow [2024-02-19 15:25:49,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2024-02-19 15:25:49,054 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45893719806763283 [2024-02-19 15:25:49,055 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 32 predicate places. [2024-02-19 15:25:49,055 INFO L507 AbstractCegarLoop]: Abstraction has has 57 places, 129 transitions, 1342 flow [2024-02-19 15:25:49,055 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:49,055 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:49,055 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:49,056 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 15:25:49,056 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:49,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:49,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2007340698, now seen corresponding path program 5 times [2024-02-19 15:25:49,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:49,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889073427] [2024-02-19 15:25:49,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:49,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:49,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:49,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889073427] [2024-02-19 15:25:49,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889073427] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:49,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:49,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:49,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578559044] [2024-02-19 15:25:49,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:49,156 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:49,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:49,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:49,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:49,158 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:49,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 129 transitions, 1342 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:49,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:49,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:49,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:49,343 INFO L124 PetriNetUnfolderBase]: 192/377 cut-off events. [2024-02-19 15:25:49,343 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-02-19 15:25:49,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2303 conditions, 377 events. 192/377 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1547 event pairs, 2 based on Foata normal form. 1/336 useless extension candidates. Maximal degree in co-relation 2102. Up to 283 conditions per place. [2024-02-19 15:25:49,346 INFO L140 encePairwiseOnDemand]: 14/23 looper letters, 64 selfloop transitions, 16 changer transitions 58/139 dead transitions. [2024-02-19 15:25:49,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 139 transitions, 1727 flow [2024-02-19 15:25:49,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:49,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2024-02-19 15:25:49,348 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2024-02-19 15:25:49,348 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 40 predicate places. [2024-02-19 15:25:49,348 INFO L507 AbstractCegarLoop]: Abstraction has has 65 places, 139 transitions, 1727 flow [2024-02-19 15:25:49,349 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:49,349 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:49,349 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:49,349 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 15:25:49,349 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:49,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:49,350 INFO L85 PathProgramCache]: Analyzing trace with hash 63539562, now seen corresponding path program 6 times [2024-02-19 15:25:49,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:49,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217034192] [2024-02-19 15:25:49,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:49,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:49,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:49,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217034192] [2024-02-19 15:25:49,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217034192] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:49,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:49,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:49,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630382463] [2024-02-19 15:25:49,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:49,458 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:49,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:49,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:49,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:49,463 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:49,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 139 transitions, 1727 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:49,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:49,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:49,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:49,687 INFO L124 PetriNetUnfolderBase]: 227/441 cut-off events. [2024-02-19 15:25:49,687 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-02-19 15:25:49,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3132 conditions, 441 events. 227/441 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1874 event pairs, 6 based on Foata normal form. 1/392 useless extension candidates. Maximal degree in co-relation 2893. Up to 326 conditions per place. [2024-02-19 15:25:49,691 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 72 selfloop transitions, 26 changer transitions 70/169 dead transitions. [2024-02-19 15:25:49,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 169 transitions, 2432 flow [2024-02-19 15:25:49,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:49,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2024-02-19 15:25:49,692 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2024-02-19 15:25:49,695 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 48 predicate places. [2024-02-19 15:25:49,695 INFO L507 AbstractCegarLoop]: Abstraction has has 73 places, 169 transitions, 2432 flow [2024-02-19 15:25:49,695 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:49,695 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:49,695 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:49,695 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-19 15:25:49,695 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:49,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:49,696 INFO L85 PathProgramCache]: Analyzing trace with hash -612142494, now seen corresponding path program 7 times [2024-02-19 15:25:49,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:49,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213587182] [2024-02-19 15:25:49,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:49,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:49,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:49,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213587182] [2024-02-19 15:25:49,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213587182] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:49,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:49,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:49,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548111940] [2024-02-19 15:25:49,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:49,822 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:49,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:49,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:49,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:49,825 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:49,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 169 transitions, 2432 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:49,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:49,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:49,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:50,054 INFO L124 PetriNetUnfolderBase]: 257/502 cut-off events. [2024-02-19 15:25:50,054 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-02-19 15:25:50,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4067 conditions, 502 events. 257/502 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2262 event pairs, 0 based on Foata normal form. 1/447 useless extension candidates. Maximal degree in co-relation 3788. Up to 387 conditions per place. [2024-02-19 15:25:50,057 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 77 selfloop transitions, 27 changer transitions 82/187 dead transitions. [2024-02-19 15:25:50,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 187 transitions, 3068 flow [2024-02-19 15:25:50,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2024-02-19 15:25:50,059 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45893719806763283 [2024-02-19 15:25:50,059 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 56 predicate places. [2024-02-19 15:25:50,059 INFO L507 AbstractCegarLoop]: Abstraction has has 81 places, 187 transitions, 3068 flow [2024-02-19 15:25:50,060 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:50,060 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:50,060 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:50,060 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-19 15:25:50,060 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:50,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:50,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1814444608, now seen corresponding path program 8 times [2024-02-19 15:25:50,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:50,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067190655] [2024-02-19 15:25:50,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:50,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:50,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:50,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067190655] [2024-02-19 15:25:50,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067190655] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:50,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:50,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:50,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077058557] [2024-02-19 15:25:50,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:50,167 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:50,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:50,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:50,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:50,169 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:50,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 187 transitions, 3068 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:50,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:50,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:50,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:50,396 INFO L124 PetriNetUnfolderBase]: 267/529 cut-off events. [2024-02-19 15:25:50,396 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-02-19 15:25:50,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4815 conditions, 529 events. 267/529 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2480 event pairs, 2 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 4494. Up to 414 conditions per place. [2024-02-19 15:25:50,399 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 78 selfloop transitions, 25 changer transitions 92/196 dead transitions. [2024-02-19 15:25:50,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 196 transitions, 3608 flow [2024-02-19 15:25:50,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:50,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2024-02-19 15:25:50,401 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.42995169082125606 [2024-02-19 15:25:50,403 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 64 predicate places. [2024-02-19 15:25:50,403 INFO L507 AbstractCegarLoop]: Abstraction has has 89 places, 196 transitions, 3608 flow [2024-02-19 15:25:50,403 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:50,404 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:50,404 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:50,404 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-19 15:25:50,404 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:50,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:50,405 INFO L85 PathProgramCache]: Analyzing trace with hash -524205760, now seen corresponding path program 9 times [2024-02-19 15:25:50,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:50,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158352662] [2024-02-19 15:25:50,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:50,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:50,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:50,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:50,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158352662] [2024-02-19 15:25:50,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158352662] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:50,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:50,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:50,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549549887] [2024-02-19 15:25:50,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:50,495 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:50,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:50,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:50,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:50,498 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:50,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 196 transitions, 3608 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:50,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:50,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:50,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:50,686 INFO L124 PetriNetUnfolderBase]: 273/548 cut-off events. [2024-02-19 15:25:50,686 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-02-19 15:25:50,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5537 conditions, 548 events. 273/548 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2659 event pairs, 2 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 5172. Up to 433 conditions per place. [2024-02-19 15:25:50,690 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 76 selfloop transitions, 23 changer transitions 106/206 dead transitions. [2024-02-19 15:25:50,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 206 transitions, 4207 flow [2024-02-19 15:25:50,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-02-19 15:25:50,691 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4396135265700483 [2024-02-19 15:25:50,692 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 72 predicate places. [2024-02-19 15:25:50,692 INFO L507 AbstractCegarLoop]: Abstraction has has 97 places, 206 transitions, 4207 flow [2024-02-19 15:25:50,692 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:50,692 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:50,692 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:50,692 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-19 15:25:50,693 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:50,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:50,693 INFO L85 PathProgramCache]: Analyzing trace with hash 766962060, now seen corresponding path program 10 times [2024-02-19 15:25:50,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:50,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137663361] [2024-02-19 15:25:50,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:50,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:50,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:50,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137663361] [2024-02-19 15:25:50,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137663361] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:50,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:50,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:50,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284448251] [2024-02-19 15:25:50,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:50,770 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:50,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:50,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:50,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:50,773 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:50,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 206 transitions, 4207 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:50,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:50,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:50,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:51,089 INFO L124 PetriNetUnfolderBase]: 295/595 cut-off events. [2024-02-19 15:25:51,090 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-02-19 15:25:51,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6605 conditions, 595 events. 295/595 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2960 event pairs, 2 based on Foata normal form. 1/536 useless extension candidates. Maximal degree in co-relation 6194. Up to 480 conditions per place. [2024-02-19 15:25:51,094 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 79 selfloop transitions, 24 changer transitions 116/220 dead transitions. [2024-02-19 15:25:51,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 220 transitions, 4931 flow [2024-02-19 15:25:51,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2024-02-19 15:25:51,095 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2024-02-19 15:25:51,096 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 80 predicate places. [2024-02-19 15:25:51,096 INFO L507 AbstractCegarLoop]: Abstraction has has 105 places, 220 transitions, 4931 flow [2024-02-19 15:25:51,096 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:51,096 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:51,096 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:51,096 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-19 15:25:51,097 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:51,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:51,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1226699286, now seen corresponding path program 11 times [2024-02-19 15:25:51,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:51,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672766728] [2024-02-19 15:25:51,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:51,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:51,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:51,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672766728] [2024-02-19 15:25:51,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672766728] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:51,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:51,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:51,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838353989] [2024-02-19 15:25:51,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:51,188 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:51,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:51,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:51,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:51,191 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:51,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 220 transitions, 4931 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:51,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:51,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:51,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:51,369 INFO L124 PetriNetUnfolderBase]: 301/614 cut-off events. [2024-02-19 15:25:51,369 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2024-02-19 15:25:51,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7431 conditions, 614 events. 301/614 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3110 event pairs, 4 based on Foata normal form. 1/555 useless extension candidates. Maximal degree in co-relation 6972. Up to 499 conditions per place. [2024-02-19 15:25:51,374 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 78 selfloop transitions, 21 changer transitions 128/228 dead transitions. [2024-02-19 15:25:51,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 228 transitions, 5567 flow [2024-02-19 15:25:51,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2024-02-19 15:25:51,375 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4251207729468599 [2024-02-19 15:25:51,376 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 88 predicate places. [2024-02-19 15:25:51,376 INFO L507 AbstractCegarLoop]: Abstraction has has 113 places, 228 transitions, 5567 flow [2024-02-19 15:25:51,376 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:51,376 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:51,376 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:51,377 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-19 15:25:51,377 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:51,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:51,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1570396172, now seen corresponding path program 12 times [2024-02-19 15:25:51,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:51,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516571302] [2024-02-19 15:25:51,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:51,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:51,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:51,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516571302] [2024-02-19 15:25:51,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516571302] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:51,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:51,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:51,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125221862] [2024-02-19 15:25:51,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:51,469 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:51,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:51,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:51,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:51,472 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:51,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 228 transitions, 5567 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:51,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:51,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:51,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:51,689 INFO L124 PetriNetUnfolderBase]: 351/703 cut-off events. [2024-02-19 15:25:51,690 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2024-02-19 15:25:51,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9208 conditions, 703 events. 351/703 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3649 event pairs, 8 based on Foata normal form. 1/630 useless extension candidates. Maximal degree in co-relation 8699. Up to 568 conditions per place. [2024-02-19 15:25:51,696 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 94 selfloop transitions, 27 changer transitions 140/262 dead transitions. [2024-02-19 15:25:51,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 262 transitions, 6917 flow [2024-02-19 15:25:51,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2024-02-19 15:25:51,697 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-02-19 15:25:51,698 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 96 predicate places. [2024-02-19 15:25:51,698 INFO L507 AbstractCegarLoop]: Abstraction has has 121 places, 262 transitions, 6917 flow [2024-02-19 15:25:51,698 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:51,698 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:51,698 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:51,698 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-19 15:25:51,699 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:51,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:51,699 INFO L85 PathProgramCache]: Analyzing trace with hash 368094058, now seen corresponding path program 13 times [2024-02-19 15:25:51,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:51,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914225935] [2024-02-19 15:25:51,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:51,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:51,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:51,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:51,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914225935] [2024-02-19 15:25:51,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914225935] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:51,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:51,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:51,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995715959] [2024-02-19 15:25:51,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:51,780 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:51,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:51,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:51,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:51,786 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:51,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 262 transitions, 6917 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:51,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:51,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:51,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:52,033 INFO L124 PetriNetUnfolderBase]: 364/735 cut-off events. [2024-02-19 15:25:52,033 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2024-02-19 15:25:52,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10362 conditions, 735 events. 364/735 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3894 event pairs, 8 based on Foata normal form. 1/662 useless extension candidates. Maximal degree in co-relation 9801. Up to 599 conditions per place. [2024-02-19 15:25:52,040 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 96 selfloop transitions, 27 changer transitions 150/274 dead transitions. [2024-02-19 15:25:52,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 274 transitions, 7781 flow [2024-02-19 15:25:52,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:52,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2024-02-19 15:25:52,041 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.41545893719806765 [2024-02-19 15:25:52,041 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 104 predicate places. [2024-02-19 15:25:52,042 INFO L507 AbstractCegarLoop]: Abstraction has has 129 places, 274 transitions, 7781 flow [2024-02-19 15:25:52,042 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:52,042 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:52,042 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:52,042 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-19 15:25:52,042 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:52,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:52,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1658332906, now seen corresponding path program 14 times [2024-02-19 15:25:52,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:52,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252312086] [2024-02-19 15:25:52,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:52,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:52,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:52,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:52,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252312086] [2024-02-19 15:25:52,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252312086] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:52,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:52,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:52,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430679364] [2024-02-19 15:25:52,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:52,118 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:52,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:52,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:52,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:52,120 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:52,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 274 transitions, 7781 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:52,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:52,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:52,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:52,372 INFO L124 PetriNetUnfolderBase]: 376/766 cut-off events. [2024-02-19 15:25:52,372 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2024-02-19 15:25:52,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11566 conditions, 766 events. 376/766 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4146 event pairs, 8 based on Foata normal form. 1/693 useless extension candidates. Maximal degree in co-relation 10951. Up to 630 conditions per place. [2024-02-19 15:25:52,378 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 95 selfloop transitions, 25 changer transitions 164/285 dead transitions. [2024-02-19 15:25:52,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 285 transitions, 8666 flow [2024-02-19 15:25:52,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2024-02-19 15:25:52,379 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4251207729468599 [2024-02-19 15:25:52,380 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 112 predicate places. [2024-02-19 15:25:52,380 INFO L507 AbstractCegarLoop]: Abstraction has has 137 places, 285 transitions, 8666 flow [2024-02-19 15:25:52,380 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:52,380 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:52,380 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:52,380 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-19 15:25:52,380 INFO L432 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:52,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:52,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1553176038, now seen corresponding path program 15 times [2024-02-19 15:25:52,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:52,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954512276] [2024-02-19 15:25:52,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:52,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:52,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:52,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954512276] [2024-02-19 15:25:52,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954512276] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:52,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:52,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:52,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590984708] [2024-02-19 15:25:52,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:52,459 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:52,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:52,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:52,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:52,462 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:52,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 285 transitions, 8666 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:52,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:52,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:52,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:52,694 INFO L124 PetriNetUnfolderBase]: 394/805 cut-off events. [2024-02-19 15:25:52,694 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2024-02-19 15:25:52,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12959 conditions, 805 events. 394/805 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4439 event pairs, 10 based on Foata normal form. 1/730 useless extension candidates. Maximal degree in co-relation 12288. Up to 663 conditions per place. [2024-02-19 15:25:52,707 INFO L140 encePairwiseOnDemand]: 14/23 looper letters, 99 selfloop transitions, 27 changer transitions 174/301 dead transitions. [2024-02-19 15:25:52,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 301 transitions, 9752 flow [2024-02-19 15:25:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2024-02-19 15:25:52,710 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4057971014492754 [2024-02-19 15:25:52,711 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 120 predicate places. [2024-02-19 15:25:52,711 INFO L507 AbstractCegarLoop]: Abstraction has has 145 places, 301 transitions, 9752 flow [2024-02-19 15:25:52,711 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:52,711 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:52,712 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:52,712 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-19 15:25:52,712 INFO L432 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:52,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:52,712 INFO L85 PathProgramCache]: Analyzing trace with hash -748129912, now seen corresponding path program 16 times [2024-02-19 15:25:52,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:52,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817355260] [2024-02-19 15:25:52,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:52,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:52,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:52,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817355260] [2024-02-19 15:25:52,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817355260] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:52,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:52,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:52,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949819481] [2024-02-19 15:25:52,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:52,833 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:52,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:52,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:52,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:52,846 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:52,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 301 transitions, 9752 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:52,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:52,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:52,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:53,220 INFO L124 PetriNetUnfolderBase]: 412/844 cut-off events. [2024-02-19 15:25:53,221 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2024-02-19 15:25:53,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14430 conditions, 844 events. 412/844 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4736 event pairs, 8 based on Foata normal form. 1/765 useless extension candidates. Maximal degree in co-relation 13701. Up to 702 conditions per place. [2024-02-19 15:25:53,226 INFO L140 encePairwiseOnDemand]: 14/23 looper letters, 102 selfloop transitions, 27 changer transitions 184/314 dead transitions. [2024-02-19 15:25:53,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 314 transitions, 10800 flow [2024-02-19 15:25:53,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2024-02-19 15:25:53,241 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.42028985507246375 [2024-02-19 15:25:53,241 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 128 predicate places. [2024-02-19 15:25:53,241 INFO L507 AbstractCegarLoop]: Abstraction has has 153 places, 314 transitions, 10800 flow [2024-02-19 15:25:53,241 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:53,241 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:53,241 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:53,241 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-19 15:25:53,242 INFO L432 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:53,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:53,242 INFO L85 PathProgramCache]: Analyzing trace with hash 955839380, now seen corresponding path program 17 times [2024-02-19 15:25:53,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:53,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766126721] [2024-02-19 15:25:53,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:53,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:53,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:53,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:53,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766126721] [2024-02-19 15:25:53,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766126721] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:53,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:53,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:53,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404772126] [2024-02-19 15:25:53,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:53,319 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:53,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:53,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:53,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:53,325 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:53,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 314 transitions, 10800 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:53,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:53,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:53,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:53,559 INFO L124 PetriNetUnfolderBase]: 422/871 cut-off events. [2024-02-19 15:25:53,560 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2024-02-19 15:25:53,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15763 conditions, 871 events. 422/871 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4973 event pairs, 10 based on Foata normal form. 1/792 useless extension candidates. Maximal degree in co-relation 14974. Up to 729 conditions per place. [2024-02-19 15:25:53,567 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 101 selfloop transitions, 27 changer transitions 194/323 dead transitions. [2024-02-19 15:25:53,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 323 transitions, 11756 flow [2024-02-19 15:25:53,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2024-02-19 15:25:53,569 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.42028985507246375 [2024-02-19 15:25:53,569 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 136 predicate places. [2024-02-19 15:25:53,569 INFO L507 AbstractCegarLoop]: Abstraction has has 161 places, 323 transitions, 11756 flow [2024-02-19 15:25:53,569 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:53,569 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:53,570 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:53,570 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-19 15:25:53,570 INFO L432 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:53,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:53,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1451552410, now seen corresponding path program 18 times [2024-02-19 15:25:53,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:53,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940771900] [2024-02-19 15:25:53,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:53,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:53,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:53,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940771900] [2024-02-19 15:25:53,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940771900] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:53,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:53,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:53,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354168525] [2024-02-19 15:25:53,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:53,687 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:53,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:53,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:53,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:53,702 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:53,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 323 transitions, 11756 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:53,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:53,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:53,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:54,030 INFO L124 PetriNetUnfolderBase]: 434/902 cut-off events. [2024-02-19 15:25:54,030 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-02-19 15:25:54,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17227 conditions, 902 events. 434/902 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5237 event pairs, 10 based on Foata normal form. 1/823 useless extension candidates. Maximal degree in co-relation 16376. Up to 760 conditions per place. [2024-02-19 15:25:54,038 INFO L140 encePairwiseOnDemand]: 14/23 looper letters, 101 selfloop transitions, 24 changer transitions 208/334 dead transitions. [2024-02-19 15:25:54,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 334 transitions, 12827 flow [2024-02-19 15:25:54,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:54,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:54,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2024-02-19 15:25:54,040 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.41545893719806765 [2024-02-19 15:25:54,040 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 144 predicate places. [2024-02-19 15:25:54,040 INFO L507 AbstractCegarLoop]: Abstraction has has 169 places, 334 transitions, 12827 flow [2024-02-19 15:25:54,040 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:54,040 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:54,040 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:54,041 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-19 15:25:54,041 INFO L432 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:54,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:54,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1345466570, now seen corresponding path program 19 times [2024-02-19 15:25:54,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:54,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142560514] [2024-02-19 15:25:54,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:54,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:54,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:54,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142560514] [2024-02-19 15:25:54,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142560514] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:54,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:54,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:54,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795100869] [2024-02-19 15:25:54,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:54,116 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:54,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:54,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:54,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:54,118 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:54,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 334 transitions, 12827 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:54,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:54,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:54,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:54,405 INFO L124 PetriNetUnfolderBase]: 452/941 cut-off events. [2024-02-19 15:25:54,406 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2024-02-19 15:25:54,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18912 conditions, 941 events. 452/941 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5546 event pairs, 8 based on Foata normal form. 1/858 useless extension candidates. Maximal degree in co-relation 17997. Up to 799 conditions per place. [2024-02-19 15:25:54,414 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 102 selfloop transitions, 26 changer transitions 218/347 dead transitions. [2024-02-19 15:25:54,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 347 transitions, 14019 flow [2024-02-19 15:25:54,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:54,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2024-02-19 15:25:54,415 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.42995169082125606 [2024-02-19 15:25:54,415 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 152 predicate places. [2024-02-19 15:25:54,416 INFO L507 AbstractCegarLoop]: Abstraction has has 177 places, 347 transitions, 14019 flow [2024-02-19 15:25:54,416 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:54,416 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:54,416 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:54,416 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-02-19 15:25:54,416 INFO L432 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:54,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:54,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2048889068, now seen corresponding path program 20 times [2024-02-19 15:25:54,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:54,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870734526] [2024-02-19 15:25:54,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:54,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:54,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:54,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870734526] [2024-02-19 15:25:54,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870734526] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:54,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:54,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 15:25:54,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182761267] [2024-02-19 15:25:54,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:54,490 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:25:54,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:54,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:25:54,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:25:54,497 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:25:54,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 347 transitions, 14019 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:54,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:54,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:25:54,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:54,819 INFO L124 PetriNetUnfolderBase]: 458/960 cut-off events. [2024-02-19 15:25:54,820 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2024-02-19 15:25:54,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20255 conditions, 960 events. 458/960 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5743 event pairs, 8 based on Foata normal form. 1/877 useless extension candidates. Maximal degree in co-relation 19274. Up to 818 conditions per place. [2024-02-19 15:25:54,828 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 100 selfloop transitions, 24 changer transitions 232/357 dead transitions. [2024-02-19 15:25:54,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 357 transitions, 15140 flow [2024-02-19 15:25:54,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:25:54,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:25:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2024-02-19 15:25:54,829 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.42995169082125606 [2024-02-19 15:25:54,830 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 160 predicate places. [2024-02-19 15:25:54,830 INFO L507 AbstractCegarLoop]: Abstraction has has 185 places, 357 transitions, 15140 flow [2024-02-19 15:25:54,830 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:54,830 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:54,830 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:54,830 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-02-19 15:25:54,831 INFO L432 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:54,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:54,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1004158434, now seen corresponding path program 1 times [2024-02-19 15:25:54,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:54,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240112116] [2024-02-19 15:25:54,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:54,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:54,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:54,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240112116] [2024-02-19 15:25:54,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240112116] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:54,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:54,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:25:54,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582557502] [2024-02-19 15:25:54,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:54,859 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:25:54,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:54,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:25:54,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:25:54,863 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2024-02-19 15:25:54,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 357 transitions, 15140 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:54,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:54,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2024-02-19 15:25:54,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:55,152 INFO L124 PetriNetUnfolderBase]: 709/1490 cut-off events. [2024-02-19 15:25:55,153 INFO L125 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2024-02-19 15:25:55,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32655 conditions, 1490 events. 709/1490 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 9853 event pairs, 2 based on Foata normal form. 0/1366 useless extension candidates. Maximal degree in co-relation 30997. Up to 1284 conditions per place. [2024-02-19 15:25:55,167 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 139 selfloop transitions, 32 changer transitions 351/537 dead transitions. [2024-02-19 15:25:55,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 537 transitions, 23791 flow [2024-02-19 15:25:55,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 15:25:55,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 15:25:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-02-19 15:25:55,208 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5527950310559007 [2024-02-19 15:25:55,209 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 166 predicate places. [2024-02-19 15:25:55,209 INFO L507 AbstractCegarLoop]: Abstraction has has 191 places, 537 transitions, 23791 flow [2024-02-19 15:25:55,209 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:55,209 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:55,209 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:55,209 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-02-19 15:25:55,209 INFO L432 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:55,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:55,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1810941352, now seen corresponding path program 2 times [2024-02-19 15:25:55,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:55,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19222612] [2024-02-19 15:25:55,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:55,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:55,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19222612] [2024-02-19 15:25:55,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19222612] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:55,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:55,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:25:55,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866823307] [2024-02-19 15:25:55,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:55,235 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:25:55,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:55,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:25:55,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:25:55,243 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2024-02-19 15:25:55,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 537 transitions, 23791 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:55,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:55,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2024-02-19 15:25:55,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:55,580 INFO L124 PetriNetUnfolderBase]: 757/1581 cut-off events. [2024-02-19 15:25:55,580 INFO L125 PetriNetUnfolderBase]: For 1322/1322 co-relation queries the response was YES. [2024-02-19 15:25:55,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35932 conditions, 1581 events. 757/1581 cut-off events. For 1322/1322 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 10536 event pairs, 2 based on Foata normal form. 0/1447 useless extension candidates. Maximal degree in co-relation 34157. Up to 1358 conditions per place. [2024-02-19 15:25:55,596 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 179 selfloop transitions, 24 changer transitions 351/569 dead transitions. [2024-02-19 15:25:55,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 569 transitions, 26255 flow [2024-02-19 15:25:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:25:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:25:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2024-02-19 15:25:55,597 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6695652173913044 [2024-02-19 15:25:55,597 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 170 predicate places. [2024-02-19 15:25:55,597 INFO L507 AbstractCegarLoop]: Abstraction has has 195 places, 569 transitions, 26255 flow [2024-02-19 15:25:55,598 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:55,598 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:55,598 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:55,598 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-02-19 15:25:55,598 INFO L432 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:55,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:55,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1165527757, now seen corresponding path program 1 times [2024-02-19 15:25:55,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:55,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902078705] [2024-02-19 15:25:55,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:55,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:55,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:55,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902078705] [2024-02-19 15:25:55,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902078705] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:25:55,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363293108] [2024-02-19 15:25:55,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:55,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:25:55,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:25:55,636 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:25:55,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-19 15:25:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:55,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 15:25:55,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:25:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:55,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:25:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:55,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363293108] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 15:25:55,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:25:55,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2024-02-19 15:25:55,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096799823] [2024-02-19 15:25:55,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:55,785 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:25:55,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:55,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:25:55,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-02-19 15:25:55,791 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2024-02-19 15:25:55,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 569 transitions, 26255 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:55,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:55,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2024-02-19 15:25:55,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:56,280 INFO L124 PetriNetUnfolderBase]: 893/1846 cut-off events. [2024-02-19 15:25:56,280 INFO L125 PetriNetUnfolderBase]: For 2909/2909 co-relation queries the response was YES. [2024-02-19 15:25:56,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43387 conditions, 1846 events. 893/1846 cut-off events. For 2909/2909 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 12573 event pairs, 2 based on Foata normal form. 0/1688 useless extension candidates. Maximal degree in co-relation 40585. Up to 1586 conditions per place. [2024-02-19 15:25:56,296 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 242 selfloop transitions, 42 changer transitions 354/653 dead transitions. [2024-02-19 15:25:56,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 653 transitions, 31367 flow [2024-02-19 15:25:56,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:25:56,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:25:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2024-02-19 15:25:56,297 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6434782608695652 [2024-02-19 15:25:56,297 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 174 predicate places. [2024-02-19 15:25:56,298 INFO L507 AbstractCegarLoop]: Abstraction has has 199 places, 653 transitions, 31367 flow [2024-02-19 15:25:56,298 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:56,298 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:56,298 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:56,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-02-19 15:25:56,509 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-02-19 15:25:56,509 INFO L432 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:56,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:56,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1598227664, now seen corresponding path program 3 times [2024-02-19 15:25:56,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:56,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512157859] [2024-02-19 15:25:56,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:56,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:56,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:56,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512157859] [2024-02-19 15:25:56,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512157859] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:56,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:56,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:25:56,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877318514] [2024-02-19 15:25:56,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:56,538 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:25:56,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:56,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:25:56,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:25:56,545 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2024-02-19 15:25:56,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 653 transitions, 31367 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:56,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:56,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2024-02-19 15:25:56,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:57,091 INFO L124 PetriNetUnfolderBase]: 881/1832 cut-off events. [2024-02-19 15:25:57,092 INFO L125 PetriNetUnfolderBase]: For 4848/4848 co-relation queries the response was YES. [2024-02-19 15:25:57,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44553 conditions, 1832 events. 881/1832 cut-off events. For 4848/4848 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 12502 event pairs, 0 based on Foata normal form. 0/1684 useless extension candidates. Maximal degree in co-relation 41644. Up to 1574 conditions per place. [2024-02-19 15:25:57,114 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 234 selfloop transitions, 40 changer transitions 360/649 dead transitions. [2024-02-19 15:25:57,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 649 transitions, 32376 flow [2024-02-19 15:25:57,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-19 15:25:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-19 15:25:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2024-02-19 15:25:57,115 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6032608695652174 [2024-02-19 15:25:57,116 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 181 predicate places. [2024-02-19 15:25:57,116 INFO L507 AbstractCegarLoop]: Abstraction has has 206 places, 649 transitions, 32376 flow [2024-02-19 15:25:57,116 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:57,116 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:57,116 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:57,116 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-02-19 15:25:57,117 INFO L432 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:57,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:57,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1207029003, now seen corresponding path program 2 times [2024-02-19 15:25:57,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:57,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905897447] [2024-02-19 15:25:57,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:57,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:57,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:57,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905897447] [2024-02-19 15:25:57,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905897447] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:57,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:57,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:25:57,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120271064] [2024-02-19 15:25:57,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:57,185 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:25:57,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:57,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:25:57,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:25:57,191 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2024-02-19 15:25:57,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 649 transitions, 32376 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:57,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:57,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2024-02-19 15:25:57,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:57,623 INFO L124 PetriNetUnfolderBase]: 837/1755 cut-off events. [2024-02-19 15:25:57,624 INFO L125 PetriNetUnfolderBase]: For 7238/7238 co-relation queries the response was YES. [2024-02-19 15:25:57,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44155 conditions, 1755 events. 837/1755 cut-off events. For 7238/7238 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 12020 event pairs, 0 based on Foata normal form. 0/1625 useless extension candidates. Maximal degree in co-relation 41193. Up to 1508 conditions per place. [2024-02-19 15:25:57,643 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 218 selfloop transitions, 31 changer transitions 373/636 dead transitions. [2024-02-19 15:25:57,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 636 transitions, 32901 flow [2024-02-19 15:25:57,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 15:25:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 15:25:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2024-02-19 15:25:57,645 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5579710144927537 [2024-02-19 15:25:57,645 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 186 predicate places. [2024-02-19 15:25:57,645 INFO L507 AbstractCegarLoop]: Abstraction has has 211 places, 636 transitions, 32901 flow [2024-02-19 15:25:57,645 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:57,645 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:57,646 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:57,646 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-02-19 15:25:57,646 INFO L432 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:57,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:57,646 INFO L85 PathProgramCache]: Analyzing trace with hash 750163262, now seen corresponding path program 4 times [2024-02-19 15:25:57,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:57,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771090230] [2024-02-19 15:25:57,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:57,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:57,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:57,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771090230] [2024-02-19 15:25:57,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771090230] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:57,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:57,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:25:57,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586442489] [2024-02-19 15:25:57,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:57,684 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:25:57,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:57,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:25:57,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:25:57,689 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2024-02-19 15:25:57,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 636 transitions, 32901 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:57,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:57,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2024-02-19 15:25:57,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:58,188 INFO L124 PetriNetUnfolderBase]: 793/1676 cut-off events. [2024-02-19 15:25:58,188 INFO L125 PetriNetUnfolderBase]: For 9786/9786 co-relation queries the response was YES. [2024-02-19 15:25:58,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43582 conditions, 1676 events. 793/1676 cut-off events. For 9786/9786 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 11433 event pairs, 0 based on Foata normal form. 0/1562 useless extension candidates. Maximal degree in co-relation 40571. Up to 1440 conditions per place. [2024-02-19 15:25:58,204 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 205 selfloop transitions, 22 changer transitions 377/618 dead transitions. [2024-02-19 15:25:58,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 618 transitions, 33101 flow [2024-02-19 15:25:58,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:25:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:25:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2024-02-19 15:25:58,205 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2024-02-19 15:25:58,206 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 190 predicate places. [2024-02-19 15:25:58,206 INFO L507 AbstractCegarLoop]: Abstraction has has 215 places, 618 transitions, 33101 flow [2024-02-19 15:25:58,206 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:58,206 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:58,206 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:58,207 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-02-19 15:25:58,207 INFO L432 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:58,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:58,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1806817231, now seen corresponding path program 3 times [2024-02-19 15:25:58,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:58,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93711931] [2024-02-19 15:25:58,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:58,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:58,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:58,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93711931] [2024-02-19 15:25:58,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93711931] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:58,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:58,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:25:58,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566439984] [2024-02-19 15:25:58,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:58,231 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:25:58,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:58,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:25:58,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:25:58,237 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2024-02-19 15:25:58,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 618 transitions, 33101 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:58,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:58,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2024-02-19 15:25:58,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:58,879 INFO L124 PetriNetUnfolderBase]: 1058/2235 cut-off events. [2024-02-19 15:25:58,880 INFO L125 PetriNetUnfolderBase]: For 17495/17495 co-relation queries the response was YES. [2024-02-19 15:25:58,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59891 conditions, 2235 events. 1058/2235 cut-off events. For 17495/17495 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 16197 event pairs, 0 based on Foata normal form. 0/2077 useless extension candidates. Maximal degree in co-relation 56371. Up to 1907 conditions per place. [2024-02-19 15:25:58,901 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 260 selfloop transitions, 43 changer transitions 486/803 dead transitions. [2024-02-19 15:25:58,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 803 transitions, 44699 flow [2024-02-19 15:25:58,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 15:25:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 15:25:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-02-19 15:25:58,902 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5279503105590062 [2024-02-19 15:25:58,903 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 196 predicate places. [2024-02-19 15:25:58,903 INFO L507 AbstractCegarLoop]: Abstraction has has 221 places, 803 transitions, 44699 flow [2024-02-19 15:25:58,903 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:58,903 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:58,903 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:58,903 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-02-19 15:25:58,903 INFO L432 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:25:58,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:58,904 INFO L85 PathProgramCache]: Analyzing trace with hash -209514353, now seen corresponding path program 4 times [2024-02-19 15:25:58,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:58,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973710096] [2024-02-19 15:25:58,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:58,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:58,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:58,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973710096] [2024-02-19 15:25:58,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973710096] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:58,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:58,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:25:58,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740817278] [2024-02-19 15:25:58,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:58,928 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:25:58,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:58,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:25:58,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:25:58,934 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2024-02-19 15:25:58,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 803 transitions, 44699 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:58,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:58,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2024-02-19 15:25:58,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:25:59,631 INFO L124 PetriNetUnfolderBase]: 1016/2160 cut-off events. [2024-02-19 15:25:59,631 INFO L125 PetriNetUnfolderBase]: For 22341/22341 co-relation queries the response was YES. [2024-02-19 15:25:59,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59704 conditions, 2160 events. 1016/2160 cut-off events. For 22341/22341 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 15668 event pairs, 0 based on Foata normal form. 0/2018 useless extension candidates. Maximal degree in co-relation 56127. Up to 1843 conditions per place. [2024-02-19 15:25:59,654 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 251 selfloop transitions, 28 changer transitions 486/779 dead transitions. [2024-02-19 15:25:59,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 779 transitions, 44810 flow [2024-02-19 15:25:59,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:25:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:25:59,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2024-02-19 15:25:59,655 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6434782608695652 [2024-02-19 15:25:59,655 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 200 predicate places. [2024-02-19 15:25:59,656 INFO L507 AbstractCegarLoop]: Abstraction has has 225 places, 779 transitions, 44810 flow [2024-02-19 15:25:59,656 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:59,656 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:25:59,656 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:25:59,656 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-02-19 15:25:59,656 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-19 15:25:59,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:25:59,657 INFO L85 PathProgramCache]: Analyzing trace with hash 146250913, now seen corresponding path program 5 times [2024-02-19 15:25:59,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:25:59,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718535916] [2024-02-19 15:25:59,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:25:59,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:25:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:25:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:25:59,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:25:59,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718535916] [2024-02-19 15:25:59,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718535916] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:25:59,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:25:59,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:25:59,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482331818] [2024-02-19 15:25:59,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:25:59,686 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:25:59,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:25:59,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:25:59,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:25:59,692 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2024-02-19 15:25:59,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 779 transitions, 44810 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:25:59,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:25:59,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2024-02-19 15:25:59,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:26:00,423 INFO L124 PetriNetUnfolderBase]: 978/2089 cut-off events. [2024-02-19 15:26:00,423 INFO L125 PetriNetUnfolderBase]: For 27697/27697 co-relation queries the response was YES. [2024-02-19 15:26:00,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59521 conditions, 2089 events. 978/2089 cut-off events. For 27697/27697 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 15111 event pairs, 0 based on Foata normal form. 0/1959 useless extension candidates. Maximal degree in co-relation 55891. Up to 1781 conditions per place. [2024-02-19 15:26:00,450 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 212 selfloop transitions, 40 changer transitions 490/756 dead transitions. [2024-02-19 15:26:00,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 756 transitions, 44885 flow [2024-02-19 15:26:00,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-19 15:26:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-19 15:26:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-02-19 15:26:00,452 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2024-02-19 15:26:00,453 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 207 predicate places. [2024-02-19 15:26:00,453 INFO L507 AbstractCegarLoop]: Abstraction has has 232 places, 756 transitions, 44885 flow [2024-02-19 15:26:00,453 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:00,453 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:26:00,453 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:26:00,453 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-02-19 15:26:00,454 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-19 15:26:00,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:26:00,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1635961542, now seen corresponding path program 5 times [2024-02-19 15:26:00,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:26:00,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816438708] [2024-02-19 15:26:00,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:26:00,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:26:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:26:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:00,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:26:00,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816438708] [2024-02-19 15:26:00,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816438708] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:26:00,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:26:00,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:26:00,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146011978] [2024-02-19 15:26:00,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:26:00,480 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:26:00,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:26:00,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:26:00,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:26:00,487 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2024-02-19 15:26:00,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 756 transitions, 44885 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:00,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:26:00,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2024-02-19 15:26:00,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:26:01,350 INFO L124 PetriNetUnfolderBase]: 926/2002 cut-off events. [2024-02-19 15:26:01,351 INFO L125 PetriNetUnfolderBase]: For 32814/32814 co-relation queries the response was YES. [2024-02-19 15:26:01,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58733 conditions, 2002 events. 926/2002 cut-off events. For 32814/32814 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 14543 event pairs, 0 based on Foata normal form. 0/1896 useless extension candidates. Maximal degree in co-relation 55054. Up to 1705 conditions per place. [2024-02-19 15:26:01,368 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 186 selfloop transitions, 27 changer transitions 503/729 dead transitions. [2024-02-19 15:26:01,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 729 transitions, 44617 flow [2024-02-19 15:26:01,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 15:26:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 15:26:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2024-02-19 15:26:01,369 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5579710144927537 [2024-02-19 15:26:01,370 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 212 predicate places. [2024-02-19 15:26:01,370 INFO L507 AbstractCegarLoop]: Abstraction has has 237 places, 729 transitions, 44617 flow [2024-02-19 15:26:01,370 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:01,370 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:26:01,370 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] [2024-02-19 15:26:01,370 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-02-19 15:26:01,371 INFO L432 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:26:01,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:26:01,371 INFO L85 PathProgramCache]: Analyzing trace with hash 669779461, now seen corresponding path program 1 times [2024-02-19 15:26:01,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:26:01,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101500070] [2024-02-19 15:26:01,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:26:01,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:26:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:26:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:01,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:26:01,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101500070] [2024-02-19 15:26:01,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101500070] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:26:01,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369438803] [2024-02-19 15:26:01,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:26:01,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:26:01,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:26:01,459 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:26:01,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-19 15:26:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:26:01,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:26:01,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:26:01,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:01,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:26:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:01,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369438803] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:26:01,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:26:01,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-02-19 15:26:01,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136653074] [2024-02-19 15:26:01,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:26:01,826 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-19 15:26:01,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:26:01,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-19 15:26:01,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2024-02-19 15:26:01,828 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:26:01,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 729 transitions, 44617 flow. Second operand has 23 states, 23 states have (on average 4.695652173913044) internal successors, (108), 23 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:01,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:26:01,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:26:01,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:26:03,721 INFO L124 PetriNetUnfolderBase]: 1344/2815 cut-off events. [2024-02-19 15:26:03,721 INFO L125 PetriNetUnfolderBase]: For 43128/43128 co-relation queries the response was YES. [2024-02-19 15:26:03,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85356 conditions, 2815 events. 1344/2815 cut-off events. For 43128/43128 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 20977 event pairs, 0 based on Foata normal form. 2/2619 useless extension candidates. Maximal degree in co-relation 79840. Up to 2370 conditions per place. [2024-02-19 15:26:03,748 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 328 selfloop transitions, 97 changer transitions 635/1061 dead transitions. [2024-02-19 15:26:03,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 1061 transitions, 66664 flow [2024-02-19 15:26:03,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-02-19 15:26:03,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2024-02-19 15:26:03,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 353 transitions. [2024-02-19 15:26:03,750 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.40389016018306634 [2024-02-19 15:26:03,751 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 249 predicate places. [2024-02-19 15:26:03,751 INFO L507 AbstractCegarLoop]: Abstraction has has 274 places, 1061 transitions, 66664 flow [2024-02-19 15:26:03,751 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.695652173913044) internal successors, (108), 23 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:03,751 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:26:03,751 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] [2024-02-19 15:26:03,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-19 15:26:03,962 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,SelfDestructingSolverStorable30 [2024-02-19 15:26:03,962 INFO L432 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:26:03,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:26:03,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1163763323, now seen corresponding path program 2 times [2024-02-19 15:26:03,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:26:03,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061741866] [2024-02-19 15:26:03,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:26:03,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:26:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:26:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:04,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:26:04,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061741866] [2024-02-19 15:26:04,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061741866] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:26:04,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599034642] [2024-02-19 15:26:04,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:26:04,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:26:04,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:26:04,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:26:04,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-19 15:26:04,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:26:04,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:26:04,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:26:04,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:26:04,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:04,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:26:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:04,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599034642] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:26:04,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:26:04,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-02-19 15:26:04,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519867936] [2024-02-19 15:26:04,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:26:04,383 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-19 15:26:04,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:26:04,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-19 15:26:04,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2024-02-19 15:26:04,386 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:26:04,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 1061 transitions, 66664 flow. Second operand has 23 states, 23 states have (on average 4.695652173913044) internal successors, (108), 23 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:04,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:26:04,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:26:04,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:26:05,948 INFO L124 PetriNetUnfolderBase]: 1498/3085 cut-off events. [2024-02-19 15:26:05,948 INFO L125 PetriNetUnfolderBase]: For 45582/45582 co-relation queries the response was YES. [2024-02-19 15:26:05,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96549 conditions, 3085 events. 1498/3085 cut-off events. For 45582/45582 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 22912 event pairs, 0 based on Foata normal form. 4/2841 useless extension candidates. Maximal degree in co-relation 90690. Up to 2618 conditions per place. [2024-02-19 15:26:05,980 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 387 selfloop transitions, 127 changer transitions 655/1170 dead transitions. [2024-02-19 15:26:05,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 1170 transitions, 75820 flow [2024-02-19 15:26:05,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-02-19 15:26:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-02-19 15:26:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 195 transitions. [2024-02-19 15:26:05,982 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.42391304347826086 [2024-02-19 15:26:05,982 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 266 predicate places. [2024-02-19 15:26:05,982 INFO L507 AbstractCegarLoop]: Abstraction has has 291 places, 1170 transitions, 75820 flow [2024-02-19 15:26:05,983 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.695652173913044) internal successors, (108), 23 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:05,983 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:26:05,983 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] [2024-02-19 15:26:05,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-19 15:26:06,194 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:26:06,194 INFO L432 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:26:06,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:26:06,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1525772133, now seen corresponding path program 3 times [2024-02-19 15:26:06,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:26:06,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067482845] [2024-02-19 15:26:06,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:26:06,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:26:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:26:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:06,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:26:06,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067482845] [2024-02-19 15:26:06,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067482845] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:26:06,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108729625] [2024-02-19 15:26:06,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:26:06,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:26:06,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:26:06,377 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:26:06,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-19 15:26:06,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 15:26:06,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:26:06,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:26:06,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:26:06,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:06,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:26:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:06,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108729625] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:26:06,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:26:06,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-02-19 15:26:06,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368588676] [2024-02-19 15:26:06,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:26:06,695 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-19 15:26:06,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:26:06,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-19 15:26:06,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-02-19 15:26:06,697 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:26:06,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 1170 transitions, 75820 flow. Second operand has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 23 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:06,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:26:06,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:26:06,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:26:08,557 INFO L124 PetriNetUnfolderBase]: 1510/3119 cut-off events. [2024-02-19 15:26:08,557 INFO L125 PetriNetUnfolderBase]: For 46247/46247 co-relation queries the response was YES. [2024-02-19 15:26:08,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100847 conditions, 3119 events. 1510/3119 cut-off events. For 46247/46247 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 23271 event pairs, 0 based on Foata normal form. 4/2875 useless extension candidates. Maximal degree in co-relation 94810. Up to 2654 conditions per place. [2024-02-19 15:26:08,598 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 348 selfloop transitions, 131 changer transitions 700/1180 dead transitions. [2024-02-19 15:26:08,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 1180 transitions, 78850 flow [2024-02-19 15:26:08,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-02-19 15:26:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-02-19 15:26:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 181 transitions. [2024-02-19 15:26:08,601 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.41418764302059496 [2024-02-19 15:26:08,602 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 284 predicate places. [2024-02-19 15:26:08,602 INFO L507 AbstractCegarLoop]: Abstraction has has 309 places, 1180 transitions, 78850 flow [2024-02-19 15:26:08,602 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 23 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:08,602 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:26:08,602 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] [2024-02-19 15:26:08,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-02-19 15:26:08,812 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:26:08,812 INFO L432 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:26:08,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:26:08,813 INFO L85 PathProgramCache]: Analyzing trace with hash 235533285, now seen corresponding path program 4 times [2024-02-19 15:26:08,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:26:08,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402565737] [2024-02-19 15:26:08,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:26:08,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:26:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:26:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:08,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:26:08,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402565737] [2024-02-19 15:26:08,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402565737] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:26:08,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045262486] [2024-02-19 15:26:08,960 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:26:08,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:26:08,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:26:08,961 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:26:08,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-19 15:26:09,041 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:26:09,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:26:09,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:26:09,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:26:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:09,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:26:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:09,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045262486] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:26:09,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:26:09,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-02-19 15:26:09,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845008926] [2024-02-19 15:26:09,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:26:09,301 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-19 15:26:09,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:26:09,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-19 15:26:09,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2024-02-19 15:26:09,303 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:26:09,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 1180 transitions, 78850 flow. Second operand has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:09,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:26:09,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:26:09,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:26:11,345 INFO L124 PetriNetUnfolderBase]: 1528/3156 cut-off events. [2024-02-19 15:26:11,345 INFO L125 PetriNetUnfolderBase]: For 47104/47104 co-relation queries the response was YES. [2024-02-19 15:26:11,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105351 conditions, 3156 events. 1528/3156 cut-off events. For 47104/47104 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 23498 event pairs, 0 based on Foata normal form. 6/2914 useless extension candidates. Maximal degree in co-relation 99208. Up to 2694 conditions per place. [2024-02-19 15:26:11,394 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 285 selfloop transitions, 89 changer transitions 817/1192 dead transitions. [2024-02-19 15:26:11,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 1192 transitions, 82028 flow [2024-02-19 15:26:11,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-02-19 15:26:11,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-02-19 15:26:11,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 180 transitions. [2024-02-19 15:26:11,396 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.41189931350114417 [2024-02-19 15:26:11,396 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 299 predicate places. [2024-02-19 15:26:11,396 INFO L507 AbstractCegarLoop]: Abstraction has has 324 places, 1192 transitions, 82028 flow [2024-02-19 15:26:11,396 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:11,396 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:26:11,397 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] [2024-02-19 15:26:11,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-02-19 15:26:11,608 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-02-19 15:26:11,608 INFO L432 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:26:11,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:26:11,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1983102587, now seen corresponding path program 5 times [2024-02-19 15:26:11,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:26:11,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676447866] [2024-02-19 15:26:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:26:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:26:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:26:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:11,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:26:11,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676447866] [2024-02-19 15:26:11,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676447866] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:26:11,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305239790] [2024-02-19 15:26:11,711 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:26:11,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:26:11,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:26:11,712 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:26:11,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-02-19 15:26:11,788 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-02-19 15:26:11,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:26:11,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-19 15:26:11,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:26:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:11,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:26:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:11,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305239790] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:26:11,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:26:11,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2024-02-19 15:26:11,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551420808] [2024-02-19 15:26:11,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:26:11,938 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-02-19 15:26:11,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:26:11,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-02-19 15:26:11,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2024-02-19 15:26:11,940 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:26:11,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 1192 transitions, 82028 flow. Second operand has 20 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:11,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:26:11,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:26:11,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:26:14,672 INFO L124 PetriNetUnfolderBase]: 2078/4165 cut-off events. [2024-02-19 15:26:14,672 INFO L125 PetriNetUnfolderBase]: For 57542/57542 co-relation queries the response was YES. [2024-02-19 15:26:14,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142805 conditions, 4165 events. 2078/4165 cut-off events. For 57542/57542 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 31719 event pairs, 0 based on Foata normal form. 2/3771 useless extension candidates. Maximal degree in co-relation 135857. Up to 3507 conditions per place. [2024-02-19 15:26:14,726 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 424 selfloop transitions, 139 changer transitions 1067/1631 dead transitions. [2024-02-19 15:26:14,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 1631 transitions, 114511 flow [2024-02-19 15:26:14,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-02-19 15:26:14,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-02-19 15:26:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 208 transitions. [2024-02-19 15:26:14,727 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4306418219461698 [2024-02-19 15:26:14,727 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 319 predicate places. [2024-02-19 15:26:14,728 INFO L507 AbstractCegarLoop]: Abstraction has has 344 places, 1631 transitions, 114511 flow [2024-02-19 15:26:14,728 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:14,728 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:26:14,728 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] [2024-02-19 15:26:14,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-02-19 15:26:14,938 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:26:14,938 INFO L432 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:26:14,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:26:14,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1997600689, now seen corresponding path program 6 times [2024-02-19 15:26:14,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:26:14,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648694307] [2024-02-19 15:26:14,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:26:14,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:26:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:26:15,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:15,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:26:15,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648694307] [2024-02-19 15:26:15,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648694307] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:26:15,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590987754] [2024-02-19 15:26:15,021 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 15:26:15,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:26:15,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:26:15,022 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:26:15,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-02-19 15:26:15,073 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-02-19 15:26:15,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:26:15,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:26:15,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:26:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:15,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:26:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:15,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590987754] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:26:15,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:26:15,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-02-19 15:26:15,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436689670] [2024-02-19 15:26:15,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:26:15,318 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-02-19 15:26:15,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:26:15,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-02-19 15:26:15,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-02-19 15:26:15,321 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:26:15,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 1631 transitions, 114511 flow. Second operand has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 21 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:15,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:26:15,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:26:15,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:26:19,638 INFO L124 PetriNetUnfolderBase]: 2839/5604 cut-off events. [2024-02-19 15:26:19,638 INFO L125 PetriNetUnfolderBase]: For 72246/72246 co-relation queries the response was YES. [2024-02-19 15:26:19,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196848 conditions, 5604 events. 2839/5604 cut-off events. For 72246/72246 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 44437 event pairs, 0 based on Foata normal form. 7/5035 useless extension candidates. Maximal degree in co-relation 188719. Up to 4761 conditions per place. [2024-02-19 15:26:19,704 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 551 selfloop transitions, 236 changer transitions 1426/2214 dead transitions. [2024-02-19 15:26:19,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 2214 transitions, 158910 flow [2024-02-19 15:26:19,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-02-19 15:26:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-02-19 15:26:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 290 transitions. [2024-02-19 15:26:19,706 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.42028985507246375 [2024-02-19 15:26:19,706 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 348 predicate places. [2024-02-19 15:26:19,707 INFO L507 AbstractCegarLoop]: Abstraction has has 373 places, 2214 transitions, 158910 flow [2024-02-19 15:26:19,707 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 21 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:19,707 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:26:19,707 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] [2024-02-19 15:26:19,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-02-19 15:26:19,917 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:26:19,918 INFO L432 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:26:20,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:26:20,084 INFO L85 PathProgramCache]: Analyzing trace with hash -888360475, now seen corresponding path program 7 times [2024-02-19 15:26:20,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:26:20,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477018687] [2024-02-19 15:26:20,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:26:20,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:26:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:26:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:20,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:26:20,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477018687] [2024-02-19 15:26:20,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477018687] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:26:20,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874720886] [2024-02-19 15:26:20,198 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-19 15:26:20,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:26:20,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:26:20,199 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:26:20,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-02-19 15:26:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:26:20,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:26:20,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:26:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:20,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:26:20,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:20,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874720886] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:26:20,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:26:20,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2024-02-19 15:26:20,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441988254] [2024-02-19 15:26:20,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:26:20,548 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-02-19 15:26:20,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:26:20,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-02-19 15:26:20,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2024-02-19 15:26:20,551 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:26:20,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 2214 transitions, 158910 flow. Second operand has 22 states, 22 states have (on average 4.590909090909091) internal successors, (101), 22 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:20,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:26:20,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:26:20,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:26:26,251 INFO L124 PetriNetUnfolderBase]: 3200/6279 cut-off events. [2024-02-19 15:26:26,251 INFO L125 PetriNetUnfolderBase]: For 79786/79786 co-relation queries the response was YES. [2024-02-19 15:26:26,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226713 conditions, 6279 events. 3200/6279 cut-off events. For 79786/79786 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 50367 event pairs, 0 based on Foata normal form. 3/5622 useless extension candidates. Maximal degree in co-relation 217975. Up to 5285 conditions per place. [2024-02-19 15:26:26,334 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 613 selfloop transitions, 144 changer transitions 1733/2491 dead transitions. [2024-02-19 15:26:26,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 2491 transitions, 183577 flow [2024-02-19 15:26:26,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-02-19 15:26:26,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-02-19 15:26:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 154 transitions. [2024-02-19 15:26:26,336 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.41847826086956524 [2024-02-19 15:26:26,336 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 363 predicate places. [2024-02-19 15:26:26,337 INFO L507 AbstractCegarLoop]: Abstraction has has 388 places, 2491 transitions, 183577 flow [2024-02-19 15:26:26,337 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.590909090909091) internal successors, (101), 22 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:26,337 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:26:26,337 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] [2024-02-19 15:26:26,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-02-19 15:26:26,542 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,SelfDestructingSolverStorable36 [2024-02-19 15:26:26,542 INFO L432 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:26:26,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:26:26,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1324758077, now seen corresponding path program 8 times [2024-02-19 15:26:26,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:26:26,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223614943] [2024-02-19 15:26:26,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:26:26,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:26:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:26:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:26,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:26:26,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223614943] [2024-02-19 15:26:26,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223614943] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:26:26,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552579520] [2024-02-19 15:26:26,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:26:26,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:26:26,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:26:26,665 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:26:26,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-02-19 15:26:26,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:26:26,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:26:26,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:26:26,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:26:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:26,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:26:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:26,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552579520] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:26:26,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:26:26,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2024-02-19 15:26:26,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140662271] [2024-02-19 15:26:26,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:26:26,949 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-02-19 15:26:26,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:26:26,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-02-19 15:26:26,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2024-02-19 15:26:26,951 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:26:26,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 2491 transitions, 183577 flow. Second operand has 20 states, 20 states have (on average 4.55) internal successors, (91), 20 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:26,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:26:26,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:26:26,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:26:34,486 INFO L124 PetriNetUnfolderBase]: 3526/6914 cut-off events. [2024-02-19 15:26:34,486 INFO L125 PetriNetUnfolderBase]: For 85429/85429 co-relation queries the response was YES. [2024-02-19 15:26:34,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256186 conditions, 6914 events. 3526/6914 cut-off events. For 85429/85429 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 56376 event pairs, 0 based on Foata normal form. 6/6212 useless extension candidates. Maximal degree in co-relation 245532. Up to 5832 conditions per place. [2024-02-19 15:26:34,567 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 471 selfloop transitions, 193 changer transitions 2096/2761 dead transitions. [2024-02-19 15:26:34,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 2761 transitions, 208615 flow [2024-02-19 15:26:34,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-02-19 15:26:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-02-19 15:26:34,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 246 transitions. [2024-02-19 15:26:34,568 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.38198757763975155 [2024-02-19 15:26:34,568 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 387 predicate places. [2024-02-19 15:26:34,569 INFO L507 AbstractCegarLoop]: Abstraction has has 412 places, 2761 transitions, 208615 flow [2024-02-19 15:26:34,569 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.55) internal successors, (91), 20 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:34,569 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:26:34,569 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] [2024-02-19 15:26:34,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-02-19 15:26:34,779 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-02-19 15:26:34,779 INFO L432 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:26:34,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:26:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1941601341, now seen corresponding path program 9 times [2024-02-19 15:26:34,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:26:34,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164111439] [2024-02-19 15:26:34,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:26:34,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:26:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:26:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:34,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:26:34,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164111439] [2024-02-19 15:26:34,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164111439] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:26:34,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700435530] [2024-02-19 15:26:34,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:26:34,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:26:34,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:26:34,877 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:26:34,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-02-19 15:26:34,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 15:26:34,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:26:34,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:26:34,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:26:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:34,983 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:26:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:35,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700435530] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:26:35,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:26:35,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2024-02-19 15:26:35,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331117872] [2024-02-19 15:26:35,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:26:35,147 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-19 15:26:35,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:26:35,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-19 15:26:35,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-02-19 15:26:35,149 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:26:35,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 2761 transitions, 208615 flow. Second operand has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:35,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:26:35,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:26:35,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:26:45,280 INFO L124 PetriNetUnfolderBase]: 4080/7993 cut-off events. [2024-02-19 15:26:45,280 INFO L125 PetriNetUnfolderBase]: For 97163/97163 co-relation queries the response was YES. [2024-02-19 15:26:45,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304313 conditions, 7993 events. 4080/7993 cut-off events. For 97163/97163 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 66615 event pairs, 0 based on Foata normal form. 3/7168 useless extension candidates. Maximal degree in co-relation 292854. Up to 6911 conditions per place. [2024-02-19 15:26:45,387 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 479 selfloop transitions, 189 changer transitions 2478/3147 dead transitions. [2024-02-19 15:26:45,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 3147 transitions, 244375 flow [2024-02-19 15:26:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-02-19 15:26:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2024-02-19 15:26:45,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 247 transitions. [2024-02-19 15:26:45,389 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.37031484257871067 [2024-02-19 15:26:45,390 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 415 predicate places. [2024-02-19 15:26:45,390 INFO L507 AbstractCegarLoop]: Abstraction has has 440 places, 3147 transitions, 244375 flow [2024-02-19 15:26:45,390 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:45,391 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:26:45,391 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] [2024-02-19 15:26:45,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-02-19 15:26:45,601 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,SelfDestructingSolverStorable38 [2024-02-19 15:26:45,602 INFO L432 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:26:45,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:26:45,602 INFO L85 PathProgramCache]: Analyzing trace with hash 706432869, now seen corresponding path program 10 times [2024-02-19 15:26:45,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:26:45,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283562016] [2024-02-19 15:26:45,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:26:45,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:26:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:26:45,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:45,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:26:45,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283562016] [2024-02-19 15:26:45,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283562016] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:26:45,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474141399] [2024-02-19 15:26:45,690 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:26:45,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:26:45,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:26:45,691 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:26:45,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-02-19 15:26:45,746 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:26:45,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:26:45,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:26:45,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:26:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:45,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:26:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:45,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474141399] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:26:45,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:26:45,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-02-19 15:26:45,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108426592] [2024-02-19 15:26:45,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:26:45,967 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-02-19 15:26:45,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:26:45,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-02-19 15:26:45,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2024-02-19 15:26:45,976 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:26:45,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 3147 transitions, 244375 flow. Second operand has 21 states, 21 states have (on average 4.619047619047619) internal successors, (97), 21 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:45,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:26:45,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:26:45,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:26:59,489 INFO L124 PetriNetUnfolderBase]: 4320/8589 cut-off events. [2024-02-19 15:26:59,489 INFO L125 PetriNetUnfolderBase]: For 109643/109643 co-relation queries the response was YES. [2024-02-19 15:26:59,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335365 conditions, 8589 events. 4320/8589 cut-off events. For 109643/109643 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 73853 event pairs, 0 based on Foata normal form. 2/7763 useless extension candidates. Maximal degree in co-relation 322865. Up to 7497 conditions per place. [2024-02-19 15:26:59,605 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 468 selfloop transitions, 157 changer transitions 2740/3366 dead transitions. [2024-02-19 15:26:59,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 3366 transitions, 267940 flow [2024-02-19 15:26:59,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-02-19 15:26:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-02-19 15:26:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 235 transitions. [2024-02-19 15:26:59,613 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.444234404536862 [2024-02-19 15:26:59,614 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 437 predicate places. [2024-02-19 15:26:59,614 INFO L507 AbstractCegarLoop]: Abstraction has has 462 places, 3366 transitions, 267940 flow [2024-02-19 15:26:59,614 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.619047619047619) internal successors, (97), 21 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:26:59,614 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:26:59,614 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] [2024-02-19 15:26:59,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-02-19 15:26:59,822 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,SelfDestructingSolverStorable39 [2024-02-19 15:26:59,823 INFO L432 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:26:59,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:26:59,823 INFO L85 PathProgramCache]: Analyzing trace with hash -34519229, now seen corresponding path program 11 times [2024-02-19 15:26:59,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:26:59,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391462525] [2024-02-19 15:26:59,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:26:59,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:26:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:26:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:26:59,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:26:59,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391462525] [2024-02-19 15:26:59,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391462525] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:26:59,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948129984] [2024-02-19 15:26:59,962 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:26:59,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:26:59,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:26:59,963 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-19 15:26:59,964 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-19 15:27:00,043 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:27:00,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:27:00,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-19 15:27:00,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:27:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:27:00,132 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:27:00,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948129984] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:27:00,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-19 15:27:00,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2024-02-19 15:27:00,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042122263] [2024-02-19 15:27:00,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:27:00,133 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:27:00,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:27:00,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:27:00,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-02-19 15:27:00,135 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:27:00,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 3366 transitions, 267940 flow. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:27:00,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:27:00,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:27:00,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:27:14,600 INFO L124 PetriNetUnfolderBase]: 4320/8577 cut-off events. [2024-02-19 15:27:14,600 INFO L125 PetriNetUnfolderBase]: For 109790/109790 co-relation queries the response was YES. [2024-02-19 15:27:14,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343676 conditions, 8577 events. 4320/8577 cut-off events. For 109790/109790 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 73655 event pairs, 0 based on Foata normal form. 6/7755 useless extension candidates. Maximal degree in co-relation 331131. Up to 7491 conditions per place. [2024-02-19 15:27:14,702 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 427 selfloop transitions, 88 changer transitions 2860/3376 dead transitions. [2024-02-19 15:27:14,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 3376 transitions, 275190 flow [2024-02-19 15:27:14,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:27:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:27:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2024-02-19 15:27:14,703 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4492753623188406 [2024-02-19 15:27:14,703 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 445 predicate places. [2024-02-19 15:27:14,703 INFO L507 AbstractCegarLoop]: Abstraction has has 470 places, 3376 transitions, 275190 flow [2024-02-19 15:27:14,703 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:27:14,703 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:27:14,703 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] [2024-02-19 15:27:14,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-02-19 15:27:14,914 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:27:14,915 INFO L432 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:27:14,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:27:14,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1479556921, now seen corresponding path program 12 times [2024-02-19 15:27:14,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:27:14,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816846183] [2024-02-19 15:27:14,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:27:14,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:27:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:27:15,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:27:15,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:27:15,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816846183] [2024-02-19 15:27:15,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816846183] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:27:15,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475273445] [2024-02-19 15:27:15,001 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 15:27:15,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:27:15,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:27:15,003 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:27:15,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-02-19 15:27:15,081 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-02-19 15:27:15,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:27:15,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:27:15,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:27:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:27:15,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:27:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:27:15,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475273445] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:27:15,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:27:15,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2024-02-19 15:27:15,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875280948] [2024-02-19 15:27:15,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:27:15,327 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-02-19 15:27:15,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:27:15,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-02-19 15:27:15,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2024-02-19 15:27:15,331 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:27:15,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 3376 transitions, 275190 flow. Second operand has 22 states, 22 states have (on average 4.5) internal successors, (99), 22 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:27:15,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:27:15,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:27:15,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:27:31,891 INFO L124 PetriNetUnfolderBase]: 4834/9524 cut-off events. [2024-02-19 15:27:31,891 INFO L125 PetriNetUnfolderBase]: For 119012/119012 co-relation queries the response was YES. [2024-02-19 15:27:31,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390195 conditions, 9524 events. 4834/9524 cut-off events. For 119012/119012 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 82812 event pairs, 0 based on Foata normal form. 3/8587 useless extension candidates. Maximal degree in co-relation 376869. Up to 8296 conditions per place. [2024-02-19 15:27:32,014 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 581 selfloop transitions, 135 changer transitions 3048/3765 dead transitions. [2024-02-19 15:27:32,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 3765 transitions, 313824 flow [2024-02-19 15:27:32,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-02-19 15:27:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-02-19 15:27:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 150 transitions. [2024-02-19 15:27:32,016 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4076086956521739 [2024-02-19 15:27:32,016 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 460 predicate places. [2024-02-19 15:27:32,016 INFO L507 AbstractCegarLoop]: Abstraction has has 485 places, 3765 transitions, 313824 flow [2024-02-19 15:27:32,017 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.5) internal successors, (99), 22 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:27:32,017 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:27:32,017 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] [2024-02-19 15:27:32,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-02-19 15:27:32,224 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2024-02-19 15:27:32,224 INFO L432 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:27:32,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:27:32,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1525171527, now seen corresponding path program 13 times [2024-02-19 15:27:32,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:27:32,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710843942] [2024-02-19 15:27:32,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:27:32,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:27:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:27:32,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:27:32,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:27:32,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710843942] [2024-02-19 15:27:32,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710843942] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:27:32,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262613863] [2024-02-19 15:27:32,317 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-19 15:27:32,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:27:32,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:27:32,319 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:27:32,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-02-19 15:27:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:27:32,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:27:32,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:27:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:27:32,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:27:32,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:27:32,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262613863] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:27:32,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:27:32,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2024-02-19 15:27:32,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946950494] [2024-02-19 15:27:32,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:27:32,634 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-02-19 15:27:32,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:27:32,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-02-19 15:27:32,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2024-02-19 15:27:32,636 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:27:32,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 3765 transitions, 313824 flow. Second operand has 22 states, 22 states have (on average 4.590909090909091) internal successors, (101), 22 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:27:32,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:27:32,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:27:32,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:27:52,310 INFO L124 PetriNetUnfolderBase]: 4942/9880 cut-off events. [2024-02-19 15:27:52,311 INFO L125 PetriNetUnfolderBase]: For 126556/126556 co-relation queries the response was YES. [2024-02-19 15:27:52,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415120 conditions, 9880 events. 4942/9880 cut-off events. For 126556/126556 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 87533 event pairs, 0 based on Foata normal form. 2/8942 useless extension candidates. Maximal degree in co-relation 400361. Up to 8645 conditions per place. [2024-02-19 15:27:52,436 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 625 selfloop transitions, 117 changer transitions 3137/3880 dead transitions. [2024-02-19 15:27:52,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 3880 transitions, 331580 flow [2024-02-19 15:27:52,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-19 15:27:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-02-19 15:27:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2024-02-19 15:27:52,438 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.40869565217391307 [2024-02-19 15:27:52,438 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 474 predicate places. [2024-02-19 15:27:52,438 INFO L507 AbstractCegarLoop]: Abstraction has has 499 places, 3880 transitions, 331580 flow [2024-02-19 15:27:52,438 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.590909090909091) internal successors, (101), 22 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:27:52,438 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:27:52,438 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] [2024-02-19 15:27:52,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-02-19 15:27:52,649 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:27:52,649 INFO L432 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:27:52,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:27:52,650 INFO L85 PathProgramCache]: Analyzing trace with hash 215493007, now seen corresponding path program 14 times [2024-02-19 15:27:52,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:27:52,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715718615] [2024-02-19 15:27:52,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:27:52,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:27:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:27:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:27:52,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:27:52,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715718615] [2024-02-19 15:27:52,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715718615] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:27:52,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101244181] [2024-02-19 15:27:52,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:27:52,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:27:52,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:27:52,809 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:27:52,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-02-19 15:27:52,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:27:52,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:27:52,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:27:52,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:27:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:27:52,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:27:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:27:53,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101244181] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:27:53,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:27:53,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-02-19 15:27:53,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693404873] [2024-02-19 15:27:53,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:27:53,124 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-19 15:27:53,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:27:53,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-19 15:27:53,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-02-19 15:27:53,129 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:27:53,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 3880 transitions, 331580 flow. Second operand has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:27:53,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:27:53,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:27:53,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:17,666 INFO L124 PetriNetUnfolderBase]: 5159/10336 cut-off events. [2024-02-19 15:28:17,666 INFO L125 PetriNetUnfolderBase]: For 132885/132885 co-relation queries the response was YES. [2024-02-19 15:28:17,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445046 conditions, 10336 events. 5159/10336 cut-off events. For 132885/132885 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 92558 event pairs, 0 based on Foata normal form. 3/9351 useless extension candidates. Maximal degree in co-relation 429494. Up to 9077 conditions per place. [2024-02-19 15:28:17,797 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 597 selfloop transitions, 154 changer transitions 3297/4049 dead transitions. [2024-02-19 15:28:17,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 4049 transitions, 354270 flow [2024-02-19 15:28:17,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-02-19 15:28:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-02-19 15:28:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 175 transitions. [2024-02-19 15:28:17,805 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.40045766590389015 [2024-02-19 15:28:17,805 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 492 predicate places. [2024-02-19 15:28:17,805 INFO L507 AbstractCegarLoop]: Abstraction has has 517 places, 4049 transitions, 354270 flow [2024-02-19 15:28:17,805 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:17,805 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:17,805 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] [2024-02-19 15:28:17,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-02-19 15:28:18,012 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:18,013 INFO L432 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:28:18,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash 909116739, now seen corresponding path program 15 times [2024-02-19 15:28:18,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:18,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352129266] [2024-02-19 15:28:18,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:18,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:28:18,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:18,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352129266] [2024-02-19 15:28:18,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352129266] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:18,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593884164] [2024-02-19 15:28:18,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:28:18,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:18,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:18,099 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:28:18,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-02-19 15:28:18,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-02-19 15:28:18,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:28:18,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:28:18,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:28:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:28:18,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:28:18,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:28:18,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593884164] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:28:18,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:28:18,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-02-19 15:28:18,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584700938] [2024-02-19 15:28:18,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:28:18,412 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-19 15:28:18,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:18,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-19 15:28:18,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2024-02-19 15:28:18,417 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:28:18,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 4049 transitions, 354270 flow. Second operand has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 23 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:18,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:18,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:28:18,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:44,906 INFO L124 PetriNetUnfolderBase]: 5491/11098 cut-off events. [2024-02-19 15:28:44,906 INFO L125 PetriNetUnfolderBase]: For 146676/146676 co-relation queries the response was YES. [2024-02-19 15:28:44,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488473 conditions, 11098 events. 5491/11098 cut-off events. For 146676/146676 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 101645 event pairs, 0 based on Foata normal form. 3/10091 useless extension candidates. Maximal degree in co-relation 471544. Up to 9769 conditions per place. [2024-02-19 15:28:45,060 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 648 selfloop transitions, 112 changer transitions 3587/4348 dead transitions. [2024-02-19 15:28:45,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 4348 transitions, 388807 flow [2024-02-19 15:28:45,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 15:28:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 15:28:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 133 transitions. [2024-02-19 15:28:45,072 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.41304347826086957 [2024-02-19 15:28:45,072 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 505 predicate places. [2024-02-19 15:28:45,073 INFO L507 AbstractCegarLoop]: Abstraction has has 530 places, 4348 transitions, 388807 flow [2024-02-19 15:28:45,073 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 23 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:45,073 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:45,073 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] [2024-02-19 15:28:45,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-02-19 15:28:45,283 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-02-19 15:28:45,284 INFO L432 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:28:45,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:45,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1290679601, now seen corresponding path program 16 times [2024-02-19 15:28:45,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:45,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805438103] [2024-02-19 15:28:45,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:45,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:28:45,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:45,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805438103] [2024-02-19 15:28:45,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805438103] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:45,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069466870] [2024-02-19 15:28:45,376 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:28:45,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:45,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:45,377 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:28:45,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-02-19 15:28:45,458 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:28:45,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:28:45,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:28:45,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:28:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:28:45,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:28:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:28:45,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069466870] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:28:45,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:28:45,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-02-19 15:28:45,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869272051] [2024-02-19 15:28:45,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:28:45,723 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-02-19 15:28:45,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:45,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-02-19 15:28:45,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-02-19 15:28:45,726 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:28:45,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 4348 transitions, 388807 flow. Second operand has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 21 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:45,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:45,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:28:45,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:29:34,369 INFO L124 PetriNetUnfolderBase]: 7708/15605 cut-off events. [2024-02-19 15:29:34,378 INFO L125 PetriNetUnfolderBase]: For 206822/206822 co-relation queries the response was YES. [2024-02-19 15:29:34,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703325 conditions, 15605 events. 7708/15605 cut-off events. For 206822/206822 co-relation queries the response was YES. Maximal size of possible extension queue 1296. Compared 150646 event pairs, 0 based on Foata normal form. 20/14155 useless extension candidates. Maximal degree in co-relation 680431. Up to 13829 conditions per place. [2024-02-19 15:29:34,605 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 633 selfloop transitions, 255 changer transitions 5185/6074 dead transitions. [2024-02-19 15:29:34,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 6074 transitions, 555834 flow [2024-02-19 15:29:34,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-02-19 15:29:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2024-02-19 15:29:34,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 363 transitions. [2024-02-19 15:29:34,607 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.40468227424749165 [2024-02-19 15:29:34,607 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 543 predicate places. [2024-02-19 15:29:34,607 INFO L507 AbstractCegarLoop]: Abstraction has has 568 places, 6074 transitions, 555834 flow [2024-02-19 15:29:34,608 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 21 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:29:34,608 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:29:34,608 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] [2024-02-19 15:29:34,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-02-19 15:29:34,816 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:29:34,816 INFO L432 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:29:34,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:29:34,817 INFO L85 PathProgramCache]: Analyzing trace with hash -401350257, now seen corresponding path program 17 times [2024-02-19 15:29:34,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:29:34,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355481471] [2024-02-19 15:29:34,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:29:34,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:29:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:29:34,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:29:34,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:29:34,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355481471] [2024-02-19 15:29:34,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355481471] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:29:34,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742015975] [2024-02-19 15:29:34,961 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:29:34,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:29:34,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:29:34,962 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:29:34,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-02-19 15:29:35,037 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:29:35,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:29:35,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-19 15:29:35,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:29:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:29:35,105 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:29:35,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742015975] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:29:35,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-19 15:29:35,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2024-02-19 15:29:35,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558834671] [2024-02-19 15:29:35,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:29:35,105 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:29:35,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:29:35,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:29:35,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-02-19 15:29:35,108 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:29:35,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 6074 transitions, 555834 flow. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:29:35,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:29:35,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:29:35,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:30:40,403 INFO L124 PetriNetUnfolderBase]: 7748/15707 cut-off events. [2024-02-19 15:30:40,404 INFO L125 PetriNetUnfolderBase]: For 208579/208579 co-relation queries the response was YES. [2024-02-19 15:30:40,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723791 conditions, 15707 events. 7748/15707 cut-off events. For 208579/208579 co-relation queries the response was YES. Maximal size of possible extension queue 1300. Compared 152108 event pairs, 0 based on Foata normal form. 5/14242 useless extension candidates. Maximal degree in co-relation 700365. Up to 13934 conditions per place. [2024-02-19 15:30:40,637 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 664 selfloop transitions, 123 changer transitions 5319/6107 dead transitions. [2024-02-19 15:30:40,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 6107 transitions, 571092 flow [2024-02-19 15:30:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:30:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:30:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2024-02-19 15:30:40,638 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.42995169082125606 [2024-02-19 15:30:40,638 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 551 predicate places. [2024-02-19 15:30:40,639 INFO L507 AbstractCegarLoop]: Abstraction has has 576 places, 6107 transitions, 571092 flow [2024-02-19 15:30:40,639 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:30:40,639 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:30:40,639 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] [2024-02-19 15:30:40,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-02-19 15:30:40,850 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:30:40,851 INFO L432 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:30:40,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:30:40,851 INFO L85 PathProgramCache]: Analyzing trace with hash 587257103, now seen corresponding path program 18 times [2024-02-19 15:30:40,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:30:40,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079217184] [2024-02-19 15:30:40,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:30:40,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:30:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:30:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:30:40,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:30:40,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079217184] [2024-02-19 15:30:40,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079217184] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:30:40,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042484278] [2024-02-19 15:30:40,941 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 15:30:40,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:30:40,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:30:40,942 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:30:40,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-02-19 15:30:41,026 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-02-19 15:30:41,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:30:41,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:30:41,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:30:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:30:41,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:30:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:30:41,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042484278] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:30:41,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:30:41,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-02-19 15:30:41,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370717262] [2024-02-19 15:30:41,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:30:41,259 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-02-19 15:30:41,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:30:41,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-02-19 15:30:41,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2024-02-19 15:30:41,261 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:30:41,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 6107 transitions, 571092 flow. Second operand has 21 states, 21 states have (on average 4.619047619047619) internal successors, (97), 21 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:30:41,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:30:41,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:30:41,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:31:51,452 INFO L124 PetriNetUnfolderBase]: 7742/15823 cut-off events. [2024-02-19 15:31:51,453 INFO L125 PetriNetUnfolderBase]: For 215554/215554 co-relation queries the response was YES. [2024-02-19 15:31:51,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745215 conditions, 15823 events. 7742/15823 cut-off events. For 215554/215554 co-relation queries the response was YES. Maximal size of possible extension queue 1302. Compared 154700 event pairs, 0 based on Foata normal form. 4/14405 useless extension candidates. Maximal degree in co-relation 720755. Up to 14049 conditions per place. [2024-02-19 15:31:51,683 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 505 selfloop transitions, 213 changer transitions 5427/6146 dead transitions. [2024-02-19 15:31:51,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 6146 transitions, 587120 flow [2024-02-19 15:31:51,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-02-19 15:31:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-02-19 15:31:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 230 transitions. [2024-02-19 15:31:51,685 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2024-02-19 15:31:51,685 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 573 predicate places. [2024-02-19 15:31:51,685 INFO L507 AbstractCegarLoop]: Abstraction has has 598 places, 6146 transitions, 587120 flow [2024-02-19 15:31:51,685 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.619047619047619) internal successors, (97), 21 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:31:51,686 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:31:51,686 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] [2024-02-19 15:31:51,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-02-19 15:31:51,896 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:31:51,897 INFO L432 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:31:51,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:31:51,897 INFO L85 PathProgramCache]: Analyzing trace with hash 871587139, now seen corresponding path program 19 times [2024-02-19 15:31:51,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:31:51,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693319634] [2024-02-19 15:31:51,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:31:51,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:31:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:31:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:31:51,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:31:51,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693319634] [2024-02-19 15:31:51,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693319634] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:31:51,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54731006] [2024-02-19 15:31:51,979 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-19 15:31:51,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:31:51,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:31:51,980 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:31:51,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-02-19 15:31:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:31:52,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:31:52,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:31:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:31:52,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:31:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:31:52,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54731006] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:31:52,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:31:52,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-02-19 15:31:52,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323054586] [2024-02-19 15:31:52,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:31:52,308 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-19 15:31:52,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:31:52,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-19 15:31:52,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-02-19 15:31:52,310 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:31:52,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 6146 transitions, 587120 flow. Second operand has 23 states, 23 states have (on average 4.521739130434782) internal successors, (104), 23 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:31:52,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:31:52,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:31:52,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:33:06,173 INFO L124 PetriNetUnfolderBase]: 8108/16612 cut-off events. [2024-02-19 15:33:06,173 INFO L125 PetriNetUnfolderBase]: For 225830/225830 co-relation queries the response was YES. [2024-02-19 15:33:06,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799285 conditions, 16612 events. 8108/16612 cut-off events. For 225830/225830 co-relation queries the response was YES. Maximal size of possible extension queue 1363. Compared 163932 event pairs, 0 based on Foata normal form. 2/15124 useless extension candidates. Maximal degree in co-relation 773361. Up to 14814 conditions per place. [2024-02-19 15:33:06,433 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 646 selfloop transitions, 69 changer transitions 5709/6425 dead transitions. [2024-02-19 15:33:06,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 6425 transitions, 626736 flow [2024-02-19 15:33:06,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-02-19 15:33:06,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-02-19 15:33:06,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 157 transitions. [2024-02-19 15:33:06,434 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.37922705314009664 [2024-02-19 15:33:06,434 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 590 predicate places. [2024-02-19 15:33:06,434 INFO L507 AbstractCegarLoop]: Abstraction has has 615 places, 6425 transitions, 626736 flow [2024-02-19 15:33:06,435 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.521739130434782) internal successors, (104), 23 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:33:06,435 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:33:06,435 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] [2024-02-19 15:33:06,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-02-19 15:33:06,640 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2024-02-19 15:33:06,640 INFO L432 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:33:06,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:33:06,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1290727067, now seen corresponding path program 20 times [2024-02-19 15:33:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:33:06,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133892188] [2024-02-19 15:33:06,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:33:06,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:33:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:33:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:33:06,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:33:06,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133892188] [2024-02-19 15:33:06,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133892188] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:33:06,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008305394] [2024-02-19 15:33:06,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:33:06,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:33:06,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:33:06,749 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:33:06,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-02-19 15:33:07,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:33:07,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:33:07,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:33:07,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:33:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:33:07,092 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:33:07,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:33:07,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008305394] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:33:07,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:33:07,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-02-19 15:33:07,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768851753] [2024-02-19 15:33:07,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:33:07,252 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-02-19 15:33:07,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:33:07,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-02-19 15:33:07,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-02-19 15:33:07,254 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:33:07,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 6425 transitions, 626736 flow. Second operand has 21 states, 21 states have (on average 4.523809523809524) internal successors, (95), 21 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:33:07,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:33:07,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:33:07,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:34:29,490 INFO L124 PetriNetUnfolderBase]: 8118/16693 cut-off events. [2024-02-19 15:34:29,490 INFO L125 PetriNetUnfolderBase]: For 230840/230840 co-relation queries the response was YES. [2024-02-19 15:34:29,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820839 conditions, 16693 events. 8118/16693 cut-off events. For 230840/230840 co-relation queries the response was YES. Maximal size of possible extension queue 1370. Compared 165647 event pairs, 0 based on Foata normal form. 9/15226 useless extension candidates. Maximal degree in co-relation 794401. Up to 14916 conditions per place. [2024-02-19 15:34:29,738 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 335 selfloop transitions, 141 changer transitions 5966/6443 dead transitions. [2024-02-19 15:34:29,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 6443 transitions, 641588 flow [2024-02-19 15:34:29,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-02-19 15:34:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2024-02-19 15:34:29,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 275 transitions. [2024-02-19 15:34:29,740 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4122938530734633 [2024-02-19 15:34:29,741 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 618 predicate places. [2024-02-19 15:34:29,741 INFO L507 AbstractCegarLoop]: Abstraction has has 643 places, 6443 transitions, 641588 flow [2024-02-19 15:34:29,741 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.523809523809524) internal successors, (95), 21 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:34:29,741 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:34:29,742 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] [2024-02-19 15:34:29,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-02-19 15:34:29,944 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-02-19 15:34:29,944 INFO L432 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:34:29,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:34:29,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2085812943, now seen corresponding path program 21 times [2024-02-19 15:34:29,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:34:29,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151736399] [2024-02-19 15:34:29,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:34:29,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:34:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:34:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:34:30,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:34:30,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151736399] [2024-02-19 15:34:30,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151736399] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:34:30,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816867418] [2024-02-19 15:34:30,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:34:30,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:34:30,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:34:30,042 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:34:30,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-02-19 15:34:30,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 15:34:30,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:34:30,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:34:30,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:34:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:34:30,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:34:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:34:30,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816867418] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:34:30,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:34:30,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-02-19 15:34:30,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481960882] [2024-02-19 15:34:30,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:34:30,347 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-19 15:34:30,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:34:30,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-19 15:34:30,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2024-02-19 15:34:30,349 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:34:30,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 6443 transitions, 641588 flow. Second operand has 23 states, 23 states have (on average 4.521739130434782) internal successors, (104), 23 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:34:30,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:34:30,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:34:30,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:35:53,703 INFO L124 PetriNetUnfolderBase]: 8488/17496 cut-off events. [2024-02-19 15:35:53,704 INFO L125 PetriNetUnfolderBase]: For 239558/239558 co-relation queries the response was YES. [2024-02-19 15:35:53,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878598 conditions, 17496 events. 8488/17496 cut-off events. For 239558/239558 co-relation queries the response was YES. Maximal size of possible extension queue 1431. Compared 174900 event pairs, 0 based on Foata normal form. 3/15943 useless extension candidates. Maximal degree in co-relation 850639. Up to 15721 conditions per place. [2024-02-19 15:35:53,980 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 330 selfloop transitions, 76 changer transitions 6303/6710 dead transitions. [2024-02-19 15:35:53,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 6710 transitions, 681946 flow [2024-02-19 15:35:53,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-02-19 15:35:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-02-19 15:35:53,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 182 transitions. [2024-02-19 15:35:53,981 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.39565217391304347 [2024-02-19 15:35:53,982 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 637 predicate places. [2024-02-19 15:35:53,982 INFO L507 AbstractCegarLoop]: Abstraction has has 662 places, 6710 transitions, 681946 flow [2024-02-19 15:35:53,982 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.521739130434782) internal successors, (104), 23 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:35:53,982 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:35:53,982 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] [2024-02-19 15:35:53,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-02-19 15:35:54,192 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:35:54,193 INFO L432 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:35:54,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:35:54,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1496862061, now seen corresponding path program 22 times [2024-02-19 15:35:54,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:35:54,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677489857] [2024-02-19 15:35:54,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:35:54,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:35:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:35:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:35:54,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:35:54,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677489857] [2024-02-19 15:35:54,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677489857] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:35:54,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111067724] [2024-02-19 15:35:54,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:35:54,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:35:54,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:35:54,509 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:35:54,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-02-19 15:35:54,586 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:35:54,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:35:54,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:35:54,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:35:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:35:54,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:35:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:35:54,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111067724] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:35:54,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:35:54,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-02-19 15:35:54,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999582984] [2024-02-19 15:35:54,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:35:54,821 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-19 15:35:54,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:35:54,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-19 15:35:54,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2024-02-19 15:35:54,826 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2024-02-19 15:35:54,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 6710 transitions, 681946 flow. Second operand has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 23 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:35:54,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:35:54,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2024-02-19 15:35:54,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:37:43,064 INFO L124 PetriNetUnfolderBase]: 9512/19826 cut-off events. [2024-02-19 15:37:43,065 INFO L125 PetriNetUnfolderBase]: For 275114/275114 co-relation queries the response was YES. [2024-02-19 15:37:43,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016684 conditions, 19826 events. 9512/19826 cut-off events. For 275114/275114 co-relation queries the response was YES. Maximal size of possible extension queue 1677. Compared 204107 event pairs, 0 based on Foata normal form. 5/18111 useless extension candidates. Maximal degree in co-relation 984574. Up to 17998 conditions per place. [2024-02-19 15:37:43,371 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 286 selfloop transitions, 62 changer transitions 7168/7517 dead transitions. [2024-02-19 15:37:43,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 677 places, 7517 transitions, 779603 flow [2024-02-19 15:37:43,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-02-19 15:37:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-02-19 15:37:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 158 transitions. [2024-02-19 15:37:43,373 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4040920716112532 [2024-02-19 15:37:43,373 INFO L308 CegarLoopForPetriNet]: 25 programPoint places, 652 predicate places. [2024-02-19 15:37:43,373 INFO L507 AbstractCegarLoop]: Abstraction has has 677 places, 7517 transitions, 779603 flow [2024-02-19 15:37:43,373 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 23 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:37:43,373 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:37:43,374 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:37:43,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-02-19 15:37:43,584 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:37:43,585 INFO L432 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:37:43,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:37:43,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1390663163, now seen corresponding path program 23 times [2024-02-19 15:37:43,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:37:43,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580291755] [2024-02-19 15:37:43,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:37:43,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:37:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:37:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:37:43,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:37:43,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580291755] [2024-02-19 15:37:43,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580291755] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:37:43,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577317882] [2024-02-19 15:37:43,643 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:37:43,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:37:43,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:37:43,644 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:37:43,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-02-19 15:37:43,723 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-02-19 15:37:43,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:37:43,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:37:43,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:37:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:37:43,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:37:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:37:43,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577317882] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:37:43,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:37:43,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-02-19 15:37:43,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389995886] [2024-02-19 15:37:43,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:37:43,771 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-19 15:37:43,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:37:43,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-19 15:37:43,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-02-19 15:37:43,789 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2024-02-19 15:37:43,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 7517 transitions, 779603 flow. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:37:43,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:37:43,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2024-02-19 15:37:43,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15