./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.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/popl20-more-nonblocking-counter-alt2.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 3697d9128f1f55a146432bb6e854f5639b64b16acb09c5233c8611aa24537748 --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:05:06,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:05:06,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 15:05:06,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:05:06,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:05:06,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:05:06,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:05:06,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:05:06,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:05:06,509 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:05:06,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:05:06,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:05:06,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:05:06,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:05:06,511 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:05:06,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:05:06,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:05:06,511 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:05:06,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 15:05:06,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:05:06,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:05:06,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:05:06,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:05:06,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:05:06,513 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:05:06,513 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:05:06,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:05:06,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:05:06,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:05:06,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:05:06,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:05:06,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:05:06,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:05:06,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:05:06,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:05:06,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:05:06,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 15:05:06,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 15:05:06,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:05:06,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:05:06,518 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:05:06,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:05:06,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:05:06,519 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 -> 3697d9128f1f55a146432bb6e854f5639b64b16acb09c5233c8611aa24537748 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:05:06,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:05:06,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:05:06,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:05:06,822 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:05:06,822 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:05:06,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2024-02-19 15:05:07,936 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:05:08,096 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:05:08,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2024-02-19 15:05:08,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfc0fae5a/c5808bbab9914a37ba2a7e8df18a1a6a/FLAGc483454cf [2024-02-19 15:05:08,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfc0fae5a/c5808bbab9914a37ba2a7e8df18a1a6a [2024-02-19 15:05:08,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:05:08,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:05:08,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:05:08,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:05:08,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:05:08,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:05:08" (1/1) ... [2024-02-19 15:05:08,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6704358b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:08, skipping insertion in model container [2024-02-19 15:05:08,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:05:08" (1/1) ... [2024-02-19 15:05:08,151 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:05:08,322 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/popl20-more-nonblocking-counter-alt2.wvr.c[2147,2160] [2024-02-19 15:05:08,325 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:05:08,332 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:05:08,354 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/popl20-more-nonblocking-counter-alt2.wvr.c[2147,2160] [2024-02-19 15:05:08,362 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:05:08,374 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:05:08,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:08 WrapperNode [2024-02-19 15:05:08,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:05:08,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:05:08,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:05:08,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:05:08,381 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:05:08" (1/1) ... [2024-02-19 15:05:08,387 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:05:08" (1/1) ... [2024-02-19 15:05:08,406 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2024-02-19 15:05:08,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:05:08,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:05:08,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:05:08,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:05:08,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:08" (1/1) ... [2024-02-19 15:05:08,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:08" (1/1) ... [2024-02-19 15:05:08,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:08" (1/1) ... [2024-02-19 15:05:08,447 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:05:08,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:08" (1/1) ... [2024-02-19 15:05:08,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:08" (1/1) ... [2024-02-19 15:05:08,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:08" (1/1) ... [2024-02-19 15:05:08,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:08" (1/1) ... [2024-02-19 15:05:08,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:08" (1/1) ... [2024-02-19 15:05:08,480 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:08" (1/1) ... [2024-02-19 15:05:08,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:05:08,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:05:08,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:05:08,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:05:08,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:08" (1/1) ... [2024-02-19 15:05:08,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:05:08,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:08,526 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:05:08,549 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:05:08,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:05:08,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:05:08,583 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:05:08,583 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:05:08,583 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:05:08,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 15:05:08,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 15:05:08,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 15:05:08,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:05:08,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 15:05:08,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 15:05:08,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 15:05:08,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 15:05:08,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 15:05:08,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:05:08,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:05:08,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 15:05:08,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 15:05:08,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 15:05:08,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:05:08,593 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:05:08,670 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:05:08,672 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:05:08,796 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:05:08,796 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:05:08,942 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:05:08,942 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-19 15:05:08,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:05:08 BoogieIcfgContainer [2024-02-19 15:05:08,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:05:08,944 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:05:08,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:05:08,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:05:08,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:05:08" (1/3) ... [2024-02-19 15:05:08,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d17f432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:05:08, skipping insertion in model container [2024-02-19 15:05:08,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:08" (2/3) ... [2024-02-19 15:05:08,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d17f432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:05:08, skipping insertion in model container [2024-02-19 15:05:08,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:05:08" (3/3) ... [2024-02-19 15:05:08,962 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-nonblocking-counter-alt2.wvr.c [2024-02-19 15:05:08,975 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:05:08,976 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:05:08,976 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:05:09,002 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-19 15:05:09,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 22 transitions, 58 flow [2024-02-19 15:05:09,049 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2024-02-19 15:05:09,049 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:05:09,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 2/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2024-02-19 15:05:09,052 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 22 transitions, 58 flow [2024-02-19 15:05:09,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 19 transitions, 50 flow [2024-02-19 15:05:09,060 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:05:09,065 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;@24689a63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:05:09,066 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 15:05:09,072 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:05:09,072 INFO L124 PetriNetUnfolderBase]: 2/18 cut-off events. [2024-02-19 15:05:09,072 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:05:09,072 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:09,073 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:09,073 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:05:09,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:09,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1387393637, now seen corresponding path program 1 times [2024-02-19 15:05:09,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:05:09,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067116993] [2024-02-19 15:05:09,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:09,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:05:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:09,425 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:05:09,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:05:09,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067116993] [2024-02-19 15:05:09,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067116993] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:05:09,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:05:09,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:05:09,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017754101] [2024-02-19 15:05:09,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:05:09,434 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:05:09,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:05:09,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:05:09,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:05:09,484 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 22 [2024-02-19 15:05:09,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:09,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:09,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 22 [2024-02-19 15:05:09,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:09,584 INFO L124 PetriNetUnfolderBase]: 76/148 cut-off events. [2024-02-19 15:05:09,585 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-02-19 15:05:09,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 148 events. 76/148 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 526 event pairs, 14 based on Foata normal form. 1/142 useless extension candidates. Maximal degree in co-relation 221. Up to 87 conditions per place. [2024-02-19 15:05:09,588 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 18 selfloop transitions, 2 changer transitions 4/29 dead transitions. [2024-02-19 15:05:09,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 29 transitions, 127 flow [2024-02-19 15:05:09,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:05:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:05:09,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2024-02-19 15:05:09,648 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2024-02-19 15:05:09,650 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2024-02-19 15:05:09,650 INFO L507 AbstractCegarLoop]: Abstraction has has 26 places, 29 transitions, 127 flow [2024-02-19 15:05:09,651 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:09,651 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:09,651 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:09,651 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 15:05:09,651 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:05:09,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:09,655 INFO L85 PathProgramCache]: Analyzing trace with hash -2007930211, now seen corresponding path program 1 times [2024-02-19 15:05:09,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:05:09,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412241616] [2024-02-19 15:05:09,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:09,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:05:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:05:09,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:05:09,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412241616] [2024-02-19 15:05:09,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412241616] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:05:09,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:05:09,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 15:05:09,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158310482] [2024-02-19 15:05:09,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:05:09,854 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:05:09,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:05:09,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:05:09,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:05:09,858 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2024-02-19 15:05:09,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 29 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:05:09,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:09,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2024-02-19 15:05:09,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:09,957 INFO L124 PetriNetUnfolderBase]: 156/281 cut-off events. [2024-02-19 15:05:09,957 INFO L125 PetriNetUnfolderBase]: For 115/119 co-relation queries the response was YES. [2024-02-19 15:05:09,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 281 events. 156/281 cut-off events. For 115/119 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1060 event pairs, 42 based on Foata normal form. 21/300 useless extension candidates. Maximal degree in co-relation 612. Up to 186 conditions per place. [2024-02-19 15:05:09,961 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 27 selfloop transitions, 4 changer transitions 7/42 dead transitions. [2024-02-19 15:05:09,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 42 transitions, 257 flow [2024-02-19 15:05:09,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:05:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:05:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2024-02-19 15:05:09,964 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2024-02-19 15:05:09,964 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 5 predicate places. [2024-02-19 15:05:09,964 INFO L507 AbstractCegarLoop]: Abstraction has has 29 places, 42 transitions, 257 flow [2024-02-19 15:05:09,965 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:05:09,965 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:09,965 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:05:09,966 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 15:05:09,966 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:05:09,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2080028541, now seen corresponding path program 1 times [2024-02-19 15:05:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:05:09,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349208523] [2024-02-19 15:05:09,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:09,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:05:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:10,177 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:05:10,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:05:10,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349208523] [2024-02-19 15:05:10,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349208523] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:05:10,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862229771] [2024-02-19 15:05:10,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:10,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:10,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:10,197 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:05:10,198 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:05:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:10,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 15:05:10,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:10,398 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:05:10,398 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:05:10,681 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:05:10,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862229771] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:10,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:05:10,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 11 [2024-02-19 15:05:10,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115644582] [2024-02-19 15:05:10,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:10,683 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-02-19 15:05:10,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:05:10,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-02-19 15:05:10,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-02-19 15:05:10,709 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2024-02-19 15:05:10,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 42 transitions, 257 flow. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:10,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:10,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2024-02-19 15:05:10,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:10,905 INFO L124 PetriNetUnfolderBase]: 200/348 cut-off events. [2024-02-19 15:05:10,906 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2024-02-19 15:05:10,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 348 events. 200/348 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1161 event pairs, 16 based on Foata normal form. 28/376 useless extension candidates. Maximal degree in co-relation 1122. Up to 201 conditions per place. [2024-02-19 15:05:10,912 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 69 selfloop transitions, 13 changer transitions 0/83 dead transitions. [2024-02-19 15:05:10,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 83 transitions, 633 flow [2024-02-19 15:05:10,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-19 15:05:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-19 15:05:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-02-19 15:05:10,915 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2024-02-19 15:05:10,916 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 12 predicate places. [2024-02-19 15:05:10,916 INFO L507 AbstractCegarLoop]: Abstraction has has 36 places, 83 transitions, 633 flow [2024-02-19 15:05:10,916 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:10,917 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:10,917 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:05:10,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-19 15:05:11,132 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:11,133 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:05:11,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:11,133 INFO L85 PathProgramCache]: Analyzing trace with hash 524132115, now seen corresponding path program 2 times [2024-02-19 15:05:11,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:05:11,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117147959] [2024-02-19 15:05:11,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:11,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:05:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:11,302 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:05:11,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:05:11,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117147959] [2024-02-19 15:05:11,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117147959] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:05:11,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830480770] [2024-02-19 15:05:11,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:05:11,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:11,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:11,303 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:05:11,327 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:05:11,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:05:11,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:05:11,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 15:05:11,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:11,431 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:05:11,431 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:05:11,540 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:05:11,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830480770] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:11,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:05:11,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 12 [2024-02-19 15:05:11,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592756335] [2024-02-19 15:05:11,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:11,540 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-19 15:05:11,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:05:11,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-19 15:05:11,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-02-19 15:05:11,582 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2024-02-19 15:05:11,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 83 transitions, 633 flow. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 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:05:11,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:11,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2024-02-19 15:05:11,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:11,800 INFO L124 PetriNetUnfolderBase]: 460/801 cut-off events. [2024-02-19 15:05:11,800 INFO L125 PetriNetUnfolderBase]: For 285/285 co-relation queries the response was YES. [2024-02-19 15:05:11,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3744 conditions, 801 events. 460/801 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3409 event pairs, 8 based on Foata normal form. 2/803 useless extension candidates. Maximal degree in co-relation 3463. Up to 533 conditions per place. [2024-02-19 15:05:11,805 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 143 selfloop transitions, 25 changer transitions 35/204 dead transitions. [2024-02-19 15:05:11,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 204 transitions, 1991 flow [2024-02-19 15:05:11,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-19 15:05:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-19 15:05:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-02-19 15:05:11,806 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5702479338842975 [2024-02-19 15:05:11,807 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 22 predicate places. [2024-02-19 15:05:11,807 INFO L507 AbstractCegarLoop]: Abstraction has has 46 places, 204 transitions, 1991 flow [2024-02-19 15:05:11,807 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 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:05:11,807 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:11,807 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:11,819 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:05:12,018 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-02-19 15:05:12,019 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:05:12,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:12,020 INFO L85 PathProgramCache]: Analyzing trace with hash 892200053, now seen corresponding path program 3 times [2024-02-19 15:05:12,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:05:12,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710501862] [2024-02-19 15:05:12,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:12,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:05:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:12,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:05:12,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710501862] [2024-02-19 15:05:12,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710501862] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:05:12,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227443559] [2024-02-19 15:05:12,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:05:12,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:12,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:12,253 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:05:12,287 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:05:12,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-02-19 15:05:12,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:05:12,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:05:12,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:12,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:05:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:12,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227443559] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:12,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:05:12,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 17 [2024-02-19 15:05:12,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630174603] [2024-02-19 15:05:12,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:12,583 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-19 15:05:12,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:05:12,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-19 15:05:12,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-02-19 15:05:12,599 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2024-02-19 15:05:12,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 204 transitions, 1991 flow. Second operand has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 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:05:12,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:12,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2024-02-19 15:05:12,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:13,504 INFO L124 PetriNetUnfolderBase]: 940/1588 cut-off events. [2024-02-19 15:05:13,504 INFO L125 PetriNetUnfolderBase]: For 528/528 co-relation queries the response was YES. [2024-02-19 15:05:13,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9060 conditions, 1588 events. 940/1588 cut-off events. For 528/528 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7518 event pairs, 0 based on Foata normal form. 36/1624 useless extension candidates. Maximal degree in co-relation 8657. Up to 1138 conditions per place. [2024-02-19 15:05:13,515 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 325 selfloop transitions, 238 changer transitions 104/668 dead transitions. [2024-02-19 15:05:13,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 668 transitions, 7816 flow [2024-02-19 15:05:13,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-02-19 15:05:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2024-02-19 15:05:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 273 transitions. [2024-02-19 15:05:13,519 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4278996865203762 [2024-02-19 15:05:13,521 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 50 predicate places. [2024-02-19 15:05:13,521 INFO L507 AbstractCegarLoop]: Abstraction has has 74 places, 668 transitions, 7816 flow [2024-02-19 15:05:13,521 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 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:05:13,521 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:13,521 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:13,533 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:05:13,733 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:13,736 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:05:13,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:13,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2107694951, now seen corresponding path program 4 times [2024-02-19 15:05:13,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:05:13,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410582031] [2024-02-19 15:05:13,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:13,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:05:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:13,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:05:13,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410582031] [2024-02-19 15:05:13,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410582031] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:05:13,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697315413] [2024-02-19 15:05:13,910 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:05:13,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:13,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:13,937 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:05:13,961 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:05:13,986 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:05:13,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:05:13,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:05:13,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:14,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:14,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:05:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:14,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697315413] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:14,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:05:14,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 17 [2024-02-19 15:05:14,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524655323] [2024-02-19 15:05:14,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:14,183 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-19 15:05:14,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:05:14,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-19 15:05:14,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-02-19 15:05:14,204 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2024-02-19 15:05:14,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 668 transitions, 7816 flow. Second operand has 17 states, 17 states have (on average 5.588235294117647) internal successors, (95), 17 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:05:14,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:14,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2024-02-19 15:05:14,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:15,503 INFO L124 PetriNetUnfolderBase]: 1420/2397 cut-off events. [2024-02-19 15:05:15,504 INFO L125 PetriNetUnfolderBase]: For 771/771 co-relation queries the response was YES. [2024-02-19 15:05:15,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16074 conditions, 2397 events. 1420/2397 cut-off events. For 771/771 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12557 event pairs, 0 based on Foata normal form. 43/2440 useless extension candidates. Maximal degree in co-relation 15583. Up to 1749 conditions per place. [2024-02-19 15:05:15,546 INFO L140 encePairwiseOnDemand]: 11/22 looper letters, 539 selfloop transitions, 410 changer transitions 137/1087 dead transitions. [2024-02-19 15:05:15,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 1087 transitions, 14884 flow [2024-02-19 15:05:15,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-02-19 15:05:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2024-02-19 15:05:15,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 349 transitions. [2024-02-19 15:05:15,549 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.42874692874692877 [2024-02-19 15:05:15,550 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 86 predicate places. [2024-02-19 15:05:15,551 INFO L507 AbstractCegarLoop]: Abstraction has has 110 places, 1087 transitions, 14884 flow [2024-02-19 15:05:15,551 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.588235294117647) internal successors, (95), 17 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:05:15,551 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:15,551 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:15,576 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:05:15,763 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:15,763 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:05:15,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:15,764 INFO L85 PathProgramCache]: Analyzing trace with hash -506775705, now seen corresponding path program 5 times [2024-02-19 15:05:15,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:05:15,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399665646] [2024-02-19 15:05:15,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:15,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:05:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:15,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:05:15,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399665646] [2024-02-19 15:05:15,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399665646] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:05:15,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51513495] [2024-02-19 15:05:15,976 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:05:15,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:15,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:15,977 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:05:15,984 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:05:16,021 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:05:16,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:05:16,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 15:05:16,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:16,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:16,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:05:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:16,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51513495] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:16,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:05:16,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 19 [2024-02-19 15:05:16,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857892815] [2024-02-19 15:05:16,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:16,328 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-19 15:05:16,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:05:16,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-19 15:05:16,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2024-02-19 15:05:16,341 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2024-02-19 15:05:16,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 1087 transitions, 14884 flow. Second operand has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:16,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:16,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2024-02-19 15:05:16,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:18,556 INFO L124 PetriNetUnfolderBase]: 2133/3659 cut-off events. [2024-02-19 15:05:18,557 INFO L125 PetriNetUnfolderBase]: For 1940/1940 co-relation queries the response was YES. [2024-02-19 15:05:18,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27837 conditions, 3659 events. 2133/3659 cut-off events. For 1940/1940 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 21363 event pairs, 0 based on Foata normal form. 80/3739 useless extension candidates. Maximal degree in co-relation 27114. Up to 2661 conditions per place. [2024-02-19 15:05:18,598 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 776 selfloop transitions, 760 changer transitions 204/1815 dead transitions. [2024-02-19 15:05:18,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 1815 transitions, 28396 flow [2024-02-19 15:05:18,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-02-19 15:05:18,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2024-02-19 15:05:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 450 transitions. [2024-02-19 15:05:18,602 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.40106951871657753 [2024-02-19 15:05:18,603 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 135 predicate places. [2024-02-19 15:05:18,603 INFO L507 AbstractCegarLoop]: Abstraction has has 159 places, 1815 transitions, 28396 flow [2024-02-19 15:05:18,603 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:18,604 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:18,604 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:18,615 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:05:18,807 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:18,807 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:05:18,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:18,811 INFO L85 PathProgramCache]: Analyzing trace with hash -747221853, now seen corresponding path program 6 times [2024-02-19 15:05:18,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:05:18,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461870981] [2024-02-19 15:05:18,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:18,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:05:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:18,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:05:18,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461870981] [2024-02-19 15:05:18,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461870981] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:05:18,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310267482] [2024-02-19 15:05:18,960 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 15:05:18,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:18,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:18,977 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:05:19,001 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:05:19,029 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-02-19 15:05:19,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:05:19,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:05:19,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:19,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:05:19,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:19,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310267482] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:19,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:05:19,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 15 [2024-02-19 15:05:19,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357680912] [2024-02-19 15:05:19,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:19,282 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-19 15:05:19,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:05:19,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-19 15:05:19,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-02-19 15:05:19,293 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2024-02-19 15:05:19,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 1815 transitions, 28396 flow. Second operand has 15 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 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:05:19,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:19,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2024-02-19 15:05:19,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:24,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 15:05:28,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 15:05:29,152 INFO L124 PetriNetUnfolderBase]: 2759/4672 cut-off events. [2024-02-19 15:05:29,153 INFO L125 PetriNetUnfolderBase]: For 4192/4192 co-relation queries the response was YES. [2024-02-19 15:05:29,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39885 conditions, 4672 events. 2759/4672 cut-off events. For 4192/4192 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 27825 event pairs, 2 based on Foata normal form. 20/4692 useless extension candidates. Maximal degree in co-relation 39142. Up to 3469 conditions per place. [2024-02-19 15:05:29,278 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 1099 selfloop transitions, 859 changer transitions 268/2301 dead transitions. [2024-02-19 15:05:29,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 2301 transitions, 40534 flow [2024-02-19 15:05:29,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-02-19 15:05:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-02-19 15:05:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 273 transitions. [2024-02-19 15:05:29,282 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2024-02-19 15:05:29,284 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 161 predicate places. [2024-02-19 15:05:29,284 INFO L507 AbstractCegarLoop]: Abstraction has has 185 places, 2301 transitions, 40534 flow [2024-02-19 15:05:29,284 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 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:05:29,284 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:29,284 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:29,296 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:05:29,496 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:29,496 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:05:29,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:29,497 INFO L85 PathProgramCache]: Analyzing trace with hash -147864191, now seen corresponding path program 7 times [2024-02-19 15:05:29,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:05:29,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874625073] [2024-02-19 15:05:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:29,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:05:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:29,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:29,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:05:29,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874625073] [2024-02-19 15:05:29,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874625073] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:05:29,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267237104] [2024-02-19 15:05:29,676 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-19 15:05:29,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:29,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:29,689 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:05:29,711 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:05:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:29,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:05:29,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:29,830 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:05:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:30,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267237104] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:30,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:05:30,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 16 [2024-02-19 15:05:30,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641801354] [2024-02-19 15:05:30,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:30,015 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-19 15:05:30,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:05:30,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-19 15:05:30,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-02-19 15:05:30,050 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2024-02-19 15:05:30,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 2301 transitions, 40534 flow. Second operand has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 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:05:30,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:30,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2024-02-19 15:05:30,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:33,718 INFO L124 PetriNetUnfolderBase]: 4735/7944 cut-off events. [2024-02-19 15:05:33,718 INFO L125 PetriNetUnfolderBase]: For 6923/6923 co-relation queries the response was YES. [2024-02-19 15:05:33,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75538 conditions, 7944 events. 4735/7944 cut-off events. For 6923/6923 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 50508 event pairs, 2 based on Foata normal form. 105/8049 useless extension candidates. Maximal degree in co-relation 74638. Up to 6331 conditions per place. [2024-02-19 15:05:33,795 INFO L140 encePairwiseOnDemand]: 11/22 looper letters, 1986 selfloop transitions, 1626 changer transitions 375/3988 dead transitions. [2024-02-19 15:05:33,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 3988 transitions, 77917 flow [2024-02-19 15:05:33,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-02-19 15:05:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2024-02-19 15:05:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 407 transitions. [2024-02-19 15:05:33,797 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4111111111111111 [2024-02-19 15:05:33,797 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 204 predicate places. [2024-02-19 15:05:33,798 INFO L507 AbstractCegarLoop]: Abstraction has has 228 places, 3988 transitions, 77917 flow [2024-02-19 15:05:33,798 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 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:05:33,798 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:33,798 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:33,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-02-19 15:05:34,009 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:34,009 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:05:34,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:34,009 INFO L85 PathProgramCache]: Analyzing trace with hash -720653721, now seen corresponding path program 8 times [2024-02-19 15:05:34,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:05:34,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724111673] [2024-02-19 15:05:34,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:34,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:05:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:34,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:05:34,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724111673] [2024-02-19 15:05:34,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724111673] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:05:34,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261763501] [2024-02-19 15:05:34,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:05:34,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:34,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:34,189 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:05:34,190 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:05:34,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:05:34,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:05:34,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:05:34,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:34,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:05:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:34,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261763501] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:34,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:05:34,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-02-19 15:05:34,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107574963] [2024-02-19 15:05:34,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:34,559 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-19 15:05:34,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:05:34,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-19 15:05:34,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-02-19 15:05:34,569 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2024-02-19 15:05:34,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 3988 transitions, 77917 flow. Second operand has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 17 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:05:34,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:34,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2024-02-19 15:05:34,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:39,474 INFO L124 PetriNetUnfolderBase]: 5499/9260 cut-off events. [2024-02-19 15:05:39,475 INFO L125 PetriNetUnfolderBase]: For 12326/12326 co-relation queries the response was YES. [2024-02-19 15:05:39,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96378 conditions, 9260 events. 5499/9260 cut-off events. For 12326/12326 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 61250 event pairs, 4 based on Foata normal form. 60/9320 useless extension candidates. Maximal degree in co-relation 95217. Up to 7487 conditions per place. [2024-02-19 15:05:39,547 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 2230 selfloop transitions, 1849 changer transitions 441/4679 dead transitions. [2024-02-19 15:05:39,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 4679 transitions, 100550 flow [2024-02-19 15:05:39,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-02-19 15:05:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-02-19 15:05:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 247 transitions. [2024-02-19 15:05:39,549 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4678030303030303 [2024-02-19 15:05:39,549 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 227 predicate places. [2024-02-19 15:05:39,549 INFO L507 AbstractCegarLoop]: Abstraction has has 251 places, 4679 transitions, 100550 flow [2024-02-19 15:05:39,550 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 17 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:05:39,550 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:39,550 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:39,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-02-19 15:05:39,761 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,SelfDestructingSolverStorable9 [2024-02-19 15:05:39,762 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:05:39,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:39,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1604820093, now seen corresponding path program 9 times [2024-02-19 15:05:39,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:05:39,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695690326] [2024-02-19 15:05:39,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:39,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:05:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:39,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:05:39,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695690326] [2024-02-19 15:05:39,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695690326] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:05:39,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681468462] [2024-02-19 15:05:39,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:05:39,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:39,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:39,901 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:05:39,916 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:05:39,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-02-19 15:05:39,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:05:39,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:05:39,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:40,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:40,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:05:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:40,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681468462] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:40,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:05:40,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 16 [2024-02-19 15:05:40,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619983417] [2024-02-19 15:05:40,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:40,303 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-19 15:05:40,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:05:40,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-19 15:05:40,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-02-19 15:05:40,317 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2024-02-19 15:05:40,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 4679 transitions, 100550 flow. Second operand has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 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:05:40,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:40,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2024-02-19 15:05:40,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:46,910 INFO L124 PetriNetUnfolderBase]: 5940/9895 cut-off events. [2024-02-19 15:05:46,910 INFO L125 PetriNetUnfolderBase]: For 17812/17812 co-relation queries the response was YES. [2024-02-19 15:05:46,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112256 conditions, 9895 events. 5940/9895 cut-off events. For 17812/17812 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 65166 event pairs, 4 based on Foata normal form. 14/9909 useless extension candidates. Maximal degree in co-relation 110999. Up to 8056 conditions per place. [2024-02-19 15:05:47,023 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 2200 selfloop transitions, 2215 changer transitions 474/5048 dead transitions. [2024-02-19 15:05:47,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 5048 transitions, 118278 flow [2024-02-19 15:05:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-02-19 15:05:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-02-19 15:05:47,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 204 transitions. [2024-02-19 15:05:47,025 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-02-19 15:05:47,026 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 247 predicate places. [2024-02-19 15:05:47,026 INFO L507 AbstractCegarLoop]: Abstraction has has 271 places, 5048 transitions, 118278 flow [2024-02-19 15:05:47,026 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 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:05:47,026 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:47,026 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:47,060 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:05:47,238 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:47,238 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:05:47,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:47,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1098473827, now seen corresponding path program 10 times [2024-02-19 15:05:47,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:05:47,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115749421] [2024-02-19 15:05:47,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:47,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:05:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:47,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:05:47,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115749421] [2024-02-19 15:05:47,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115749421] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:05:47,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624898038] [2024-02-19 15:05:47,355 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:05:47,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:47,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:47,356 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:05:47,372 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:05:47,405 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:05:47,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:05:47,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:05:47,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:47,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:05:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:47,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624898038] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:47,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:05:47,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 16 [2024-02-19 15:05:47,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855345936] [2024-02-19 15:05:47,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:47,631 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-19 15:05:47,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:05:47,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-19 15:05:47,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-02-19 15:05:47,637 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2024-02-19 15:05:47,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 5048 transitions, 118278 flow. Second operand has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 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:05:47,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:47,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2024-02-19 15:05:47,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:56,485 INFO L124 PetriNetUnfolderBase]: 6281/10418 cut-off events. [2024-02-19 15:05:56,486 INFO L125 PetriNetUnfolderBase]: For 28804/28804 co-relation queries the response was YES. [2024-02-19 15:05:56,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127410 conditions, 10418 events. 6281/10418 cut-off events. For 28804/28804 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 68922 event pairs, 4 based on Foata normal form. 10/10428 useless extension candidates. Maximal degree in co-relation 126169. Up to 8401 conditions per place. [2024-02-19 15:05:56,600 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 2734 selfloop transitions, 1920 changer transitions 491/5304 dead transitions. [2024-02-19 15:05:56,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 5304 transitions, 134708 flow [2024-02-19 15:05:56,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-02-19 15:05:56,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-02-19 15:05:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 158 transitions. [2024-02-19 15:05:56,602 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.44886363636363635 [2024-02-19 15:05:56,604 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 262 predicate places. [2024-02-19 15:05:56,604 INFO L507 AbstractCegarLoop]: Abstraction has has 286 places, 5304 transitions, 134708 flow [2024-02-19 15:05:56,604 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 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:05:56,604 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:56,604 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:56,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-02-19 15:05:56,812 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,SelfDestructingSolverStorable11 [2024-02-19 15:05:56,813 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:05:56,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:56,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1759369511, now seen corresponding path program 11 times [2024-02-19 15:05:56,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:05:56,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662528376] [2024-02-19 15:05:56,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:56,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:05:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:56,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:56,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:05:56,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662528376] [2024-02-19 15:05:56,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662528376] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:05:56,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032764874] [2024-02-19 15:05:56,967 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:05:56,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:56,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:56,981 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:05:56,988 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:05:57,035 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-02-19 15:05:57,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:05:57,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:05:57,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:57,133 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:05:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:57,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032764874] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:57,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:05:57,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 17 [2024-02-19 15:05:57,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612401512] [2024-02-19 15:05:57,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:57,272 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-19 15:05:57,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:05:57,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-19 15:05:57,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-02-19 15:05:57,289 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2024-02-19 15:05:57,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 5304 transitions, 134708 flow. Second operand has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 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:05:57,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:57,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2024-02-19 15:05:57,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:05,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 15:06:17,906 INFO L124 PetriNetUnfolderBase]: 9563/15841 cut-off events. [2024-02-19 15:06:17,907 INFO L125 PetriNetUnfolderBase]: For 44623/44623 co-relation queries the response was YES. [2024-02-19 15:06:17,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209533 conditions, 15841 events. 9563/15841 cut-off events. For 44623/44623 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 110461 event pairs, 2 based on Foata normal form. 146/15987 useless extension candidates. Maximal degree in co-relation 208078. Up to 13096 conditions per place. [2024-02-19 15:06:18,143 INFO L140 encePairwiseOnDemand]: 11/22 looper letters, 4924 selfloop transitions, 2589 changer transitions 594/8108 dead transitions. [2024-02-19 15:06:18,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 8108 transitions, 221652 flow [2024-02-19 15:06:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-02-19 15:06:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2024-02-19 15:06:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 497 transitions. [2024-02-19 15:06:18,147 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.41074380165289254 [2024-02-19 15:06:18,147 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 316 predicate places. [2024-02-19 15:06:18,148 INFO L507 AbstractCegarLoop]: Abstraction has has 340 places, 8108 transitions, 221652 flow [2024-02-19 15:06:18,148 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 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:06:18,148 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:18,148 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:18,160 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:06:18,359 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,SelfDestructingSolverStorable12 [2024-02-19 15:06:18,359 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:06:18,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:18,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1062780357, now seen corresponding path program 12 times [2024-02-19 15:06:18,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:06:18,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789139332] [2024-02-19 15:06:18,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:06:18,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:06:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:18,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:06:18,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:06:18,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789139332] [2024-02-19 15:06:18,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789139332] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:06:18,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193921228] [2024-02-19 15:06:18,461 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 15:06:18,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:18,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:06:18,477 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:06:18,478 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:06:18,548 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-02-19 15:06:18,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:06:18,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:06:18,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:18,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:06:18,629 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:06:18,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193921228] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:18,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:06:18,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2024-02-19 15:06:18,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707481682] [2024-02-19 15:06:18,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:18,883 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-19 15:06:18,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:06:18,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-19 15:06:18,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-02-19 15:06:18,895 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2024-02-19 15:06:18,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 8108 transitions, 221652 flow. Second operand has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 17 states have internal predecessors, (100), 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:06:18,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:18,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2024-02-19 15:06:18,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:47,071 INFO L124 PetriNetUnfolderBase]: 10349/17187 cut-off events. [2024-02-19 15:06:47,071 INFO L125 PetriNetUnfolderBase]: For 65286/65286 co-relation queries the response was YES. [2024-02-19 15:06:47,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242799 conditions, 17187 events. 10349/17187 cut-off events. For 65286/65286 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 122441 event pairs, 2 based on Foata normal form. 48/17235 useless extension candidates. Maximal degree in co-relation 241120. Up to 14269 conditions per place. [2024-02-19 15:06:47,251 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 5560 selfloop transitions, 2267 changer transitions 661/8770 dead transitions. [2024-02-19 15:06:47,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 8770 transitions, 256990 flow [2024-02-19 15:06:47,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-02-19 15:06:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-02-19 15:06:47,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 262 transitions. [2024-02-19 15:06:47,254 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.44107744107744107 [2024-02-19 15:06:47,254 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 342 predicate places. [2024-02-19 15:06:47,255 INFO L507 AbstractCegarLoop]: Abstraction has has 366 places, 8770 transitions, 256990 flow [2024-02-19 15:06:47,255 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 17 states have internal predecessors, (100), 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:06:47,255 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:47,255 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:47,266 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:06:47,466 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-02-19 15:06:47,466 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:06:47,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:47,467 INFO L85 PathProgramCache]: Analyzing trace with hash 789316771, now seen corresponding path program 13 times [2024-02-19 15:06:47,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:06:47,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393822098] [2024-02-19 15:06:47,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:06:47,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:06:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:06:47,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:06:47,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393822098] [2024-02-19 15:06:47,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393822098] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:06:47,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862140330] [2024-02-19 15:06:47,586 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-19 15:06:47,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:47,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:06:47,587 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:06:47,600 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:06:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:47,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:06:47,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:06:47,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:06:47,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862140330] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:47,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:06:47,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2024-02-19 15:06:47,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647384363] [2024-02-19 15:06:47,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:47,938 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-19 15:06:47,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:06:47,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-19 15:06:47,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-02-19 15:06:47,943 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2024-02-19 15:06:47,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 8770 transitions, 256990 flow. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 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:06:47,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:47,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2024-02-19 15:06:47,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:07:21,602 INFO L124 PetriNetUnfolderBase]: 10440/17306 cut-off events. [2024-02-19 15:07:21,602 INFO L125 PetriNetUnfolderBase]: For 83999/83999 co-relation queries the response was YES. [2024-02-19 15:07:21,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260303 conditions, 17306 events. 10440/17306 cut-off events. For 83999/83999 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 122947 event pairs, 2 based on Foata normal form. 8/17314 useless extension candidates. Maximal degree in co-relation 258622. Up to 14386 conditions per place. [2024-02-19 15:07:21,803 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 5509 selfloop transitions, 2355 changer transitions 696/8842 dead transitions. [2024-02-19 15:07:21,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 8842 transitions, 276275 flow [2024-02-19 15:07:21,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-02-19 15:07:21,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-02-19 15:07:21,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 204 transitions. [2024-02-19 15:07:21,805 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-02-19 15:07:21,805 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 359 predicate places. [2024-02-19 15:07:21,806 INFO L507 AbstractCegarLoop]: Abstraction has has 383 places, 8842 transitions, 276275 flow [2024-02-19 15:07:21,806 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 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:07:21,806 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:07:21,811 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:07:21,825 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:07:22,022 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,SelfDestructingSolverStorable14 [2024-02-19 15:07:22,022 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:07:22,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:07:22,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1440135971, now seen corresponding path program 14 times [2024-02-19 15:07:22,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:07:22,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313771192] [2024-02-19 15:07:22,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:07:22,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:07:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:07:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:07:22,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:07:22,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313771192] [2024-02-19 15:07:22,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313771192] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:07:22,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519460027] [2024-02-19 15:07:22,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:07:22,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:07:22,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:07:22,112 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:07:22,113 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:07:22,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:07:22,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:07:22,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:07:22,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:07:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:07:22,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:07:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:07:22,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519460027] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:07:22,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:07:22,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2024-02-19 15:07:22,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831748918] [2024-02-19 15:07:22,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:07:22,441 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-19 15:07:22,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:07:22,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-19 15:07:22,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-02-19 15:07:22,450 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2024-02-19 15:07:22,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 8842 transitions, 276275 flow. Second operand has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 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:07:22,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:07:22,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2024-02-19 15:07:22,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:07:59,339 INFO L124 PetriNetUnfolderBase]: 10646/17640 cut-off events. [2024-02-19 15:07:59,340 INFO L125 PetriNetUnfolderBase]: For 108577/108577 co-relation queries the response was YES. [2024-02-19 15:07:59,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281310 conditions, 17640 events. 10646/17640 cut-off events. For 108577/108577 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 125669 event pairs, 2 based on Foata normal form. 8/17648 useless extension candidates. Maximal degree in co-relation 279531. Up to 14686 conditions per place. [2024-02-19 15:07:59,517 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 5715 selfloop transitions, 2298 changer transitions 721/9016 dead transitions. [2024-02-19 15:07:59,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 9016 transitions, 299233 flow [2024-02-19 15:07:59,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-19 15:07:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-02-19 15:07:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 143 transitions. [2024-02-19 15:07:59,518 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-02-19 15:07:59,519 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 373 predicate places. [2024-02-19 15:07:59,519 INFO L507 AbstractCegarLoop]: Abstraction has has 397 places, 9016 transitions, 299233 flow [2024-02-19 15:07:59,519 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 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:07:59,519 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:07:59,519 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:07:59,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-02-19 15:07:59,722 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:07:59,722 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:07:59,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:07:59,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1172192665, now seen corresponding path program 15 times [2024-02-19 15:07:59,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:07:59,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950219873] [2024-02-19 15:07:59,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:07:59,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:07:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:07:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:07:59,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:07:59,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950219873] [2024-02-19 15:07:59,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950219873] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:07:59,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117627040] [2024-02-19 15:07:59,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:07:59,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:07:59,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:07:59,908 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:07:59,923 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:07:59,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-02-19 15:07:59,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:07:59,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:07:59,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:08:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:08:00,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:08:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:08:00,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117627040] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:08:00,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:08:00,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2024-02-19 15:08:00,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781859302] [2024-02-19 15:08:00,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:08:00,249 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-02-19 15:08:00,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:08:00,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-02-19 15:08:00,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-02-19 15:08:00,263 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2024-02-19 15:08:00,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 9016 transitions, 299233 flow. Second operand has 18 states, 18 states have (on average 5.888888888888889) internal successors, (106), 18 states have internal predecessors, (106), 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:08:00,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:08:00,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2024-02-19 15:08:00,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:08:33,700 INFO L124 PetriNetUnfolderBase]: 11254/18694 cut-off events. [2024-02-19 15:08:33,700 INFO L125 PetriNetUnfolderBase]: For 141177/141177 co-relation queries the response was YES. [2024-02-19 15:08:33,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315061 conditions, 18694 events. 11254/18694 cut-off events. For 141177/141177 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 135152 event pairs, 4 based on Foata normal form. 60/18754 useless extension candidates. Maximal degree in co-relation 312994. Up to 15648 conditions per place. [2024-02-19 15:08:33,893 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 5837 selfloop transitions, 2626 changer transitions 796/9541 dead transitions. [2024-02-19 15:08:33,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 9541 transitions, 335435 flow [2024-02-19 15:08:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-02-19 15:08:33,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-02-19 15:08:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 284 transitions. [2024-02-19 15:08:33,895 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4303030303030303 [2024-02-19 15:08:33,895 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 402 predicate places. [2024-02-19 15:08:33,895 INFO L507 AbstractCegarLoop]: Abstraction has has 426 places, 9541 transitions, 335435 flow [2024-02-19 15:08:33,896 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.888888888888889) internal successors, (106), 18 states have internal predecessors, (106), 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:08:33,896 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:08:33,896 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:08:33,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-02-19 15:08:34,106 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-02-19 15:08:34,107 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:08:34,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:08:34,107 INFO L85 PathProgramCache]: Analyzing trace with hash -96481509, now seen corresponding path program 16 times [2024-02-19 15:08:34,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:08:34,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232336769] [2024-02-19 15:08:34,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:08:34,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:08:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:08:34,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:08:34,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:08:34,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232336769] [2024-02-19 15:08:34,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232336769] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:08:34,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025124504] [2024-02-19 15:08:34,191 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:08:34,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:08:34,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:08:34,192 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:08:34,193 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:08:34,261 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:08:34,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:08:34,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:08:34,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:08:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:08:34,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:08:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:08:34,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025124504] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:08:34,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:08:34,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2024-02-19 15:08:34,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10705159] [2024-02-19 15:08:34,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:08:34,563 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-19 15:08:34,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:08:34,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-19 15:08:34,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-02-19 15:08:34,576 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2024-02-19 15:08:34,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 9541 transitions, 335435 flow. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 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:08:34,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:08:34,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2024-02-19 15:08:34,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:09:14,486 INFO L124 PetriNetUnfolderBase]: 11249/18673 cut-off events. [2024-02-19 15:09:14,486 INFO L125 PetriNetUnfolderBase]: For 169042/169042 co-relation queries the response was YES. [2024-02-19 15:09:14,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331745 conditions, 18673 events. 11249/18673 cut-off events. For 169042/169042 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 134861 event pairs, 4 based on Foata normal form. 16/18689 useless extension candidates. Maximal degree in co-relation 329650. Up to 15635 conditions per place. [2024-02-19 15:09:14,727 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 4793 selfloop transitions, 3654 changer transitions 804/9533 dead transitions. [2024-02-19 15:09:14,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 9533 transitions, 353646 flow [2024-02-19 15:09:14,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-02-19 15:09:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-02-19 15:09:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 218 transitions. [2024-02-19 15:09:14,731 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4308300395256917 [2024-02-19 15:09:14,731 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 421 predicate places. [2024-02-19 15:09:14,731 INFO L507 AbstractCegarLoop]: Abstraction has has 445 places, 9533 transitions, 353646 flow [2024-02-19 15:09:14,731 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 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:09:14,732 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:09:14,732 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:09:14,742 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:09:14,942 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,SelfDestructingSolverStorable17 [2024-02-19 15:09:14,943 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:09:14,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:09:14,943 INFO L85 PathProgramCache]: Analyzing trace with hash -418063703, now seen corresponding path program 17 times [2024-02-19 15:09:14,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:09:14,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003570225] [2024-02-19 15:09:14,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:14,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:09:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:09:15,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:09:15,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003570225] [2024-02-19 15:09:15,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003570225] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:09:15,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379402018] [2024-02-19 15:09:15,332 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:09:15,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:09:15,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:09:15,333 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:09:15,334 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:09:15,407 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-02-19 15:09:15,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:09:15,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-19 15:09:15,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:09:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:09:20,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:09:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:09:34,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379402018] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:09:34,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:09:34,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 21 [2024-02-19 15:09:34,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982844919] [2024-02-19 15:09:34,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:09:34,688 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-02-19 15:09:34,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:09:34,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-02-19 15:09:34,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=354, Unknown=2, NotChecked=0, Total=462 [2024-02-19 15:09:38,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 15:09:38,744 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2024-02-19 15:09:38,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 9533 transitions, 353646 flow. Second operand has 22 states, 22 states have (on average 5.909090909090909) internal successors, (130), 22 states have internal predecessors, (130), 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:09:38,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:09:38,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2024-02-19 15:09:38,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:10:44,727 INFO L124 PetriNetUnfolderBase]: 15277/25631 cut-off events. [2024-02-19 15:10:44,727 INFO L125 PetriNetUnfolderBase]: For 213276/213276 co-relation queries the response was YES. [2024-02-19 15:10:44,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479479 conditions, 25631 events. 15277/25631 cut-off events. For 213276/213276 co-relation queries the response was YES. Maximal size of possible extension queue 1082. Compared 197194 event pairs, 4 based on Foata normal form. 8/25639 useless extension candidates. Maximal degree in co-relation 476227. Up to 21735 conditions per place. [2024-02-19 15:10:45,244 INFO L140 encePairwiseOnDemand]: 11/22 looper letters, 9909 selfloop transitions, 1290 changer transitions 1970/13170 dead transitions. [2024-02-19 15:10:45,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 13170 transitions, 514455 flow [2024-02-19 15:10:45,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-02-19 15:10:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-02-19 15:10:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 274 transitions. [2024-02-19 15:10:45,254 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.479020979020979 [2024-02-19 15:10:45,254 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 446 predicate places. [2024-02-19 15:10:45,254 INFO L507 AbstractCegarLoop]: Abstraction has has 470 places, 13170 transitions, 514455 flow [2024-02-19 15:10:45,255 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.909090909090909) internal successors, (130), 22 states have internal predecessors, (130), 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:10:45,255 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:10:45,255 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:10:45,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-02-19 15:10:45,470 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:10:45,470 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:10:45,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:10:45,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2036628543, now seen corresponding path program 18 times [2024-02-19 15:10:45,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:10:45,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419062701] [2024-02-19 15:10:45,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:10:45,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:10:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:10:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:10:45,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:10:45,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419062701] [2024-02-19 15:10:45,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419062701] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:10:45,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183223389] [2024-02-19 15:10:45,578 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 15:10:45,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:10:45,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:10:45,593 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:10:45,593 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:10:45,668 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-02-19 15:10:45,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:10:45,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-19 15:10:45,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:10:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:10:45,791 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:10:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:10:46,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183223389] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:10:46,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:10:46,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 14 [2024-02-19 15:10:46,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342615988] [2024-02-19 15:10:46,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:10:46,087 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-19 15:10:46,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:10:46,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-19 15:10:46,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-02-19 15:10:46,165 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2024-02-19 15:10:46,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 13170 transitions, 514455 flow. Second operand has 15 states, 15 states have (on average 8.066666666666666) internal successors, (121), 15 states have internal predecessors, (121), 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:10:46,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:10:46,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2024-02-19 15:10:46,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:12:30,399 INFO L124 PetriNetUnfolderBase]: 15421/25897 cut-off events. [2024-02-19 15:12:30,399 INFO L125 PetriNetUnfolderBase]: For 221901/221901 co-relation queries the response was YES. [2024-02-19 15:12:30,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507733 conditions, 25897 events. 15421/25897 cut-off events. For 221901/221901 co-relation queries the response was YES. Maximal size of possible extension queue 1090. Compared 199844 event pairs, 4 based on Foata normal form. 112/26009 useless extension candidates. Maximal degree in co-relation 504330. Up to 21975 conditions per place. [2024-02-19 15:12:30,907 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 6902 selfloop transitions, 3167 changer transitions 2041/13355 dead transitions. [2024-02-19 15:12:30,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 13355 transitions, 545610 flow [2024-02-19 15:12:30,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 15:12:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 15:12:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 186 transitions. [2024-02-19 15:12:30,909 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6038961038961039 [2024-02-19 15:12:30,909 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 459 predicate places. [2024-02-19 15:12:30,909 INFO L507 AbstractCegarLoop]: Abstraction has has 483 places, 13355 transitions, 545610 flow [2024-02-19 15:12:30,909 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.066666666666666) internal successors, (121), 15 states have internal predecessors, (121), 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:12:30,910 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:12:30,910 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:12:30,921 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:12:31,120 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:12:31,121 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:12:31,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:12:31,122 INFO L85 PathProgramCache]: Analyzing trace with hash 279914353, now seen corresponding path program 19 times [2024-02-19 15:12:31,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:12:31,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730312892] [2024-02-19 15:12:31,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:12:31,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:12:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:12:31,284 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:12:31,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:12:31,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730312892] [2024-02-19 15:12:31,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730312892] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:12:31,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263890610] [2024-02-19 15:12:31,285 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-19 15:12:31,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:12:31,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:12:31,286 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:12:31,289 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:12:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:12:31,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:12:31,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:12:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:12:31,497 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:12:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:12:31,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263890610] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:12:31,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:12:31,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2024-02-19 15:12:31,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941173264] [2024-02-19 15:12:31,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:12:31,914 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-19 15:12:31,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:12:31,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-19 15:12:31,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2024-02-19 15:12:31,933 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2024-02-19 15:12:31,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 13355 transitions, 545610 flow. Second operand has 23 states, 23 states have (on average 5.043478260869565) internal successors, (116), 23 states have internal predecessors, (116), 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:12:31,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:12:31,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2024-02-19 15:12:31,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:12:47,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 15:14:45,651 INFO L124 PetriNetUnfolderBase]: 19382/32493 cut-off events. [2024-02-19 15:14:45,652 INFO L125 PetriNetUnfolderBase]: For 284351/284351 co-relation queries the response was YES. [2024-02-19 15:14:45,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668017 conditions, 32493 events. 19382/32493 cut-off events. For 284351/284351 co-relation queries the response was YES. Maximal size of possible extension queue 1290. Compared 257403 event pairs, 2 based on Foata normal form. 168/32661 useless extension candidates. Maximal degree in co-relation 664039. Up to 27788 conditions per place. [2024-02-19 15:14:46,117 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 9361 selfloop transitions, 4908 changer transitions 2452/16722 dead transitions. [2024-02-19 15:14:46,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 16722 transitions, 714881 flow [2024-02-19 15:14:46,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-02-19 15:14:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2024-02-19 15:14:46,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 421 transitions. [2024-02-19 15:14:46,120 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.38272727272727275 [2024-02-19 15:14:46,120 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 508 predicate places. [2024-02-19 15:14:46,120 INFO L507 AbstractCegarLoop]: Abstraction has has 532 places, 16722 transitions, 714881 flow [2024-02-19 15:14:46,121 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.043478260869565) internal successors, (116), 23 states have internal predecessors, (116), 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:14:46,121 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:14:46,121 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:14:46,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-02-19 15:14:46,332 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:14:46,333 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:14:46,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:14:46,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1355625509, now seen corresponding path program 20 times [2024-02-19 15:14:46,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:14:46,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426834281] [2024-02-19 15:14:46,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:14:46,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:14:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:14:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:14:46,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:14:46,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426834281] [2024-02-19 15:14:46,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426834281] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:14:46,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40884243] [2024-02-19 15:14:46,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:14:46,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:14:46,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:14:46,481 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:14:46,482 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:14:46,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:14:46,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:14:46,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 15:14:46,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:14:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:14:46,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:14:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:14:47,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40884243] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:14:47,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:14:47,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 22 [2024-02-19 15:14:47,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475982880] [2024-02-19 15:14:47,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:14:47,073 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-19 15:14:47,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:14:47,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-19 15:14:47,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2024-02-19 15:14:47,090 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2024-02-19 15:14:47,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 16722 transitions, 714881 flow. Second operand has 23 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 23 states have internal predecessors, (123), 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:14:47,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:14:47,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2024-02-19 15:14:47,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:17:58,504 INFO L124 PetriNetUnfolderBase]: 19524/32674 cut-off events. [2024-02-19 15:17:58,504 INFO L125 PetriNetUnfolderBase]: For 285774/285774 co-relation queries the response was YES. [2024-02-19 15:17:58,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704490 conditions, 32674 events. 19524/32674 cut-off events. For 285774/285774 co-relation queries the response was YES. Maximal size of possible extension queue 1282. Compared 258200 event pairs, 2 based on Foata normal form. 22/32696 useless extension candidates. Maximal degree in co-relation 700621. Up to 27941 conditions per place. [2024-02-19 15:17:58,972 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 10164 selfloop transitions, 4280 changer transitions 2530/16975 dead transitions. [2024-02-19 15:17:58,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 16975 transitions, 757707 flow [2024-02-19 15:17:58,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-02-19 15:17:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2024-02-19 15:17:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 249 transitions. [2024-02-19 15:17:58,974 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.390282131661442 [2024-02-19 15:17:58,974 INFO L308 CegarLoopForPetriNet]: 24 programPoint places, 533 predicate places. [2024-02-19 15:17:58,974 INFO L507 AbstractCegarLoop]: Abstraction has has 557 places, 16975 transitions, 757707 flow [2024-02-19 15:17:58,974 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 23 states have internal predecessors, (123), 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:17:58,974 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:17:58,975 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:17:58,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-02-19 15:17:59,178 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,SelfDestructingSolverStorable21 [2024-02-19 15:17:59,179 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:17:59,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:17:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1855646585, now seen corresponding path program 21 times [2024-02-19 15:17:59,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:17:59,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669992718] [2024-02-19 15:17:59,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:17:59,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:17:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:17:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:17:59,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:17:59,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669992718] [2024-02-19 15:17:59,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669992718] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:17:59,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326535031] [2024-02-19 15:17:59,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:17:59,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:17:59,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:17:59,377 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:17:59,380 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:17:59,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-02-19 15:17:59,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:17:59,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 18 conjunts are in the unsatisfiable core [2024-02-19 15:17:59,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:17:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:17:59,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:18:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:18:02,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326535031] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:18:02,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:18:02,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 26 [2024-02-19 15:18:02,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247277243] [2024-02-19 15:18:02,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:18:02,197 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-02-19 15:18:02,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:18:02,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-02-19 15:18:02,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2024-02-19 15:18:02,206 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2024-02-19 15:18:02,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 16975 transitions, 757707 flow. Second operand has 27 states, 27 states have (on average 5.111111111111111) internal successors, (138), 27 states have internal predecessors, (138), 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:18:02,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:18:02,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2024-02-19 15:18:02,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:18:13,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-19 15:18:22,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 15:18:36,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15