./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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-mts.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 cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:58:50,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:58:50,501 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:58:50,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:58:50,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:58:50,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:58:50,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:58:50,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:58:50,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:58:50,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:58:50,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:58:50,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:58:50,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:58:50,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:58:50,534 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:58:50,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:58:50,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:58:50,534 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:58:50,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:58:50,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:58:50,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:58:50,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:58:50,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:58:50,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:58:50,536 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:58:50,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:58:50,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:58:50,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:58:50,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:58:50,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:58:50,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:58:50,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:58:50,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:58:50,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:58:50,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:58:50,539 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:58:50,539 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:58:50,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:58:50,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:58:50,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:58:50,539 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:58:50,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:58:50,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:58:50,540 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 -> cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e [2024-06-27 16:58:50,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:58:50,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:58:50,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:58:50,805 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:58:50,805 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:58:50,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2024-06-27 16:58:51,791 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:58:52,016 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:58:52,017 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2024-06-27 16:58:52,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bec37d18/3d7f30c002c447cdb611a551cdd1377c/FLAGdc7fc3d6c [2024-06-27 16:58:52,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bec37d18/3d7f30c002c447cdb611a551cdd1377c [2024-06-27 16:58:52,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:58:52,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:58:52,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:58:52,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:58:52,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:58:52,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:58:52" (1/1) ... [2024-06-27 16:58:52,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58faf2bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:52, skipping insertion in model container [2024-06-27 16:58:52,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:58:52" (1/1) ... [2024-06-27 16:58:52,090 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:58:52,245 WARN L247 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-mts.wvr.c[2572,2585] [2024-06-27 16:58:52,262 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:58:52,270 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:58:52,300 WARN L247 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-mts.wvr.c[2572,2585] [2024-06-27 16:58:52,305 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:58:52,319 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:58:52,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:52 WrapperNode [2024-06-27 16:58:52,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:58:52,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:58:52,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:58:52,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:58:52,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:52" (1/1) ... [2024-06-27 16:58:52,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:52" (1/1) ... [2024-06-27 16:58:52,354 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 13, calls inlined = 19, statements flattened = 216 [2024-06-27 16:58:52,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:58:52,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:58:52,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:58:52,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:58:52,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:52" (1/1) ... [2024-06-27 16:58:52,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:52" (1/1) ... [2024-06-27 16:58:52,372 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:52" (1/1) ... [2024-06-27 16:58:52,384 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-06-27 16:58:52,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:52" (1/1) ... [2024-06-27 16:58:52,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:52" (1/1) ... [2024-06-27 16:58:52,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:52" (1/1) ... [2024-06-27 16:58:52,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:52" (1/1) ... [2024-06-27 16:58:52,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:52" (1/1) ... [2024-06-27 16:58:52,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:52" (1/1) ... [2024-06-27 16:58:52,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:58:52,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:58:52,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:58:52,400 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:58:52,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:52" (1/1) ... [2024-06-27 16:58:52,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:58:52,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:58:52,437 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-06-27 16:58:52,444 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-06-27 16:58:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:58:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:58:52,505 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:58:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:58:52,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:58:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 16:58:52,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 16:58:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:58:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 16:58:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 16:58:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 16:58:52,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 16:58:52,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 16:58:52,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 16:58:52,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:58:52,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:58:52,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 16:58:52,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 16:58:52,515 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 16:58:52,594 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:58:52,596 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:58:52,890 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:58:52,890 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:58:53,148 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:58:53,149 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-27 16:58:53,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:58:53 BoogieIcfgContainer [2024-06-27 16:58:53,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:58:53,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:58:53,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:58:53,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:58:53,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:58:52" (1/3) ... [2024-06-27 16:58:53,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40476bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:58:53, skipping insertion in model container [2024-06-27 16:58:53,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:52" (2/3) ... [2024-06-27 16:58:53,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40476bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:58:53, skipping insertion in model container [2024-06-27 16:58:53,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:58:53" (3/3) ... [2024-06-27 16:58:53,158 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2024-06-27 16:58:53,164 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:58:53,171 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:58:53,171 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:58:53,171 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:58:53,220 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-06-27 16:58:53,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 79 flow [2024-06-27 16:58:53,280 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-06-27 16:58:53,280 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:58:53,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2024-06-27 16:58:53,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 29 transitions, 79 flow [2024-06-27 16:58:53,286 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 25 transitions, 68 flow [2024-06-27 16:58:53,299 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:58:53,313 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@17d4db16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:58:53,314 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 16:58:53,323 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:58:53,325 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2024-06-27 16:58:53,325 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:58:53,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:58:53,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:58:53,326 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:58:53,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:58:53,332 INFO L85 PathProgramCache]: Analyzing trace with hash 810057854, now seen corresponding path program 1 times [2024-06-27 16:58:53,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:58:53,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729530179] [2024-06-27 16:58:53,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:53,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:58:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:53,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:58:53,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729530179] [2024-06-27 16:58:53,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729530179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:58:53,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:58:53,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:58:53,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372963937] [2024-06-27 16:58:53,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:58:53,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:58:53,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:58:53,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:58:53,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:58:53,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-27 16:58:53,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:53,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:58:53,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-27 16:58:53,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:58:54,158 INFO L124 PetriNetUnfolderBase]: 439/661 cut-off events. [2024-06-27 16:58:54,158 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-06-27 16:58:54,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1382 conditions, 661 events. 439/661 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2305 event pairs, 124 based on Foata normal form. 1/542 useless extension candidates. Maximal degree in co-relation 1176. Up to 423 conditions per place. [2024-06-27 16:58:54,167 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 35 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2024-06-27 16:58:54,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 42 transitions, 197 flow [2024-06-27 16:58:54,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:58:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:58:54,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-06-27 16:58:54,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6436781609195402 [2024-06-27 16:58:54,179 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 68 flow. Second operand 3 states and 56 transitions. [2024-06-27 16:58:54,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 42 transitions, 197 flow [2024-06-27 16:58:54,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 42 transitions, 175 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 16:58:54,183 INFO L231 Difference]: Finished difference. Result has 28 places, 28 transitions, 82 flow [2024-06-27 16:58:54,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=28, PETRI_TRANSITIONS=28} [2024-06-27 16:58:54,187 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2024-06-27 16:58:54,187 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 28 transitions, 82 flow [2024-06-27 16:58:54,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:54,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:58:54,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:58:54,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:58:54,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:58:54,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:58:54,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1894890144, now seen corresponding path program 1 times [2024-06-27 16:58:54,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:58:54,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481219989] [2024-06-27 16:58:54,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:54,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:58:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:58:54,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:58:54,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481219989] [2024-06-27 16:58:54,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481219989] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:58:54,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:58:54,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:58:54,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742069472] [2024-06-27 16:58:54,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:58:54,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:58:54,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:58:54,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:58:54,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:58:54,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-27 16:58:54,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 28 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-06-27 16:58:54,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:58:54,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-27 16:58:54,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:58:54,404 INFO L124 PetriNetUnfolderBase]: 439/678 cut-off events. [2024-06-27 16:58:54,404 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2024-06-27 16:58:54,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 678 events. 439/678 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2372 event pairs, 287 based on Foata normal form. 0/677 useless extension candidates. Maximal degree in co-relation 484. Up to 641 conditions per place. [2024-06-27 16:58:54,407 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 25 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2024-06-27 16:58:54,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 29 transitions, 138 flow [2024-06-27 16:58:54,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:58:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:58:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2024-06-27 16:58:54,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45977011494252873 [2024-06-27 16:58:54,410 INFO L175 Difference]: Start difference. First operand has 28 places, 28 transitions, 82 flow. Second operand 3 states and 40 transitions. [2024-06-27 16:58:54,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 29 transitions, 138 flow [2024-06-27 16:58:54,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:58:54,413 INFO L231 Difference]: Finished difference. Result has 30 places, 29 transitions, 90 flow [2024-06-27 16:58:54,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=30, PETRI_TRANSITIONS=29} [2024-06-27 16:58:54,414 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2024-06-27 16:58:54,414 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 29 transitions, 90 flow [2024-06-27 16:58:54,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-06-27 16:58:54,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:58:54,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:58:54,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:58:54,416 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:58:54,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:58:54,419 INFO L85 PathProgramCache]: Analyzing trace with hash -390222636, now seen corresponding path program 1 times [2024-06-27 16:58:54,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:58:54,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328304965] [2024-06-27 16:58:54,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:54,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:58:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:58:54,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:58:54,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328304965] [2024-06-27 16:58:54,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328304965] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:58:54,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:58:54,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:58:54,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422026851] [2024-06-27 16:58:54,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:58:54,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:58:54,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:58:54,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:58:54,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:58:54,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 16:58:54,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 29 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:54,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:58:54,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 16:58:54,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:58:54,646 INFO L124 PetriNetUnfolderBase]: 538/782 cut-off events. [2024-06-27 16:58:54,646 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2024-06-27 16:58:54,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1787 conditions, 782 events. 538/782 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2437 event pairs, 170 based on Foata normal form. 0/759 useless extension candidates. Maximal degree in co-relation 1774. Up to 405 conditions per place. [2024-06-27 16:58:54,649 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 36 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2024-06-27 16:58:54,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 41 transitions, 204 flow [2024-06-27 16:58:54,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:58:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:58:54,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2024-06-27 16:58:54,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4396551724137931 [2024-06-27 16:58:54,651 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 90 flow. Second operand 4 states and 51 transitions. [2024-06-27 16:58:54,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 41 transitions, 204 flow [2024-06-27 16:58:54,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 41 transitions, 198 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 16:58:54,652 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 105 flow [2024-06-27 16:58:54,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2024-06-27 16:58:54,653 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2024-06-27 16:58:54,653 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 105 flow [2024-06-27 16:58:54,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:54,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:58:54,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:58:54,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 16:58:54,654 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:58:54,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:58:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash 13087628, now seen corresponding path program 1 times [2024-06-27 16:58:54,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:58:54,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309231048] [2024-06-27 16:58:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:54,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:58:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:58:54,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:58:54,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309231048] [2024-06-27 16:58:54,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309231048] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:58:54,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329022388] [2024-06-27 16:58:54,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:54,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:58:54,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:58:54,734 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-06-27 16:58:54,831 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-06-27 16:58:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:54,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 16:58:54,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:58:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:58:54,953 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:58:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:58:54,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329022388] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 16:58:54,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:58:54,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-06-27 16:58:54,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699422354] [2024-06-27 16:58:54,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:58:54,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:58:54,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:58:54,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:58:54,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 16:58:54,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-27 16:58:54,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:54,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:58:54,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-27 16:58:54,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:58:55,101 INFO L124 PetriNetUnfolderBase]: 441/667 cut-off events. [2024-06-27 16:58:55,101 INFO L125 PetriNetUnfolderBase]: For 285/285 co-relation queries the response was YES. [2024-06-27 16:58:55,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 667 events. 441/667 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2221 event pairs, 196 based on Foata normal form. 50/717 useless extension candidates. Maximal degree in co-relation 1713. Up to 462 conditions per place. [2024-06-27 16:58:55,105 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 37 selfloop transitions, 5 changer transitions 0/45 dead transitions. [2024-06-27 16:58:55,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 241 flow [2024-06-27 16:58:55,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:58:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:58:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2024-06-27 16:58:55,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43448275862068964 [2024-06-27 16:58:55,107 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 105 flow. Second operand 5 states and 63 transitions. [2024-06-27 16:58:55,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 241 flow [2024-06-27 16:58:55,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 235 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:58:55,110 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 122 flow [2024-06-27 16:58:55,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2024-06-27 16:58:55,112 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2024-06-27 16:58:55,112 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 122 flow [2024-06-27 16:58:55,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:55,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:58:55,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:58:55,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-27 16:58:55,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:58:55,342 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:58:55,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:58:55,343 INFO L85 PathProgramCache]: Analyzing trace with hash -479888153, now seen corresponding path program 1 times [2024-06-27 16:58:55,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:58:55,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538460080] [2024-06-27 16:58:55,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:55,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:58:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:56,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:58:56,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538460080] [2024-06-27 16:58:56,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538460080] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:58:56,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25571670] [2024-06-27 16:58:56,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:56,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:58:56,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:58:56,122 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-06-27 16:58:56,123 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-06-27 16:58:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:56,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 32 conjunts are in the unsatisfiable core [2024-06-27 16:58:56,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:58:56,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 16:58:56,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 38 [2024-06-27 16:58:56,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:56,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:58:57,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2024-06-27 16:58:57,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 84 [2024-06-27 16:58:57,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 86 [2024-06-27 16:58:57,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 115 [2024-06-27 16:58:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:57,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25571670] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:58:57,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:58:57,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2024-06-27 16:58:57,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759442941] [2024-06-27 16:58:57,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:58:57,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-06-27 16:58:57,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:58:57,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-06-27 16:58:57,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2024-06-27 16:58:57,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-27 16:58:57,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 122 flow. Second operand has 27 states, 27 states have (on average 7.444444444444445) internal successors, (201), 27 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:57,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:58:57,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-27 16:58:57,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:58:58,714 INFO L124 PetriNetUnfolderBase]: 1051/1619 cut-off events. [2024-06-27 16:58:58,714 INFO L125 PetriNetUnfolderBase]: For 1081/1087 co-relation queries the response was YES. [2024-06-27 16:58:58,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4554 conditions, 1619 events. 1051/1619 cut-off events. For 1081/1087 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6960 event pairs, 26 based on Foata normal form. 8/1627 useless extension candidates. Maximal degree in co-relation 3255. Up to 809 conditions per place. [2024-06-27 16:58:58,722 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 117 selfloop transitions, 53 changer transitions 2/175 dead transitions. [2024-06-27 16:58:58,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 175 transitions, 949 flow [2024-06-27 16:58:58,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-06-27 16:58:58,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-06-27 16:58:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 268 transitions. [2024-06-27 16:58:58,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4863883847549909 [2024-06-27 16:58:58,725 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 122 flow. Second operand 19 states and 268 transitions. [2024-06-27 16:58:58,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 175 transitions, 949 flow [2024-06-27 16:58:58,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 175 transitions, 933 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-27 16:58:58,729 INFO L231 Difference]: Finished difference. Result has 62 places, 78 transitions, 500 flow [2024-06-27 16:58:58,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=500, PETRI_PLACES=62, PETRI_TRANSITIONS=78} [2024-06-27 16:58:58,730 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 31 predicate places. [2024-06-27 16:58:58,730 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 500 flow [2024-06-27 16:58:58,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.444444444444445) internal successors, (201), 27 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:58,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:58:58,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:58:58,760 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-06-27 16:58:58,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:58:58,962 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:58:58,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:58:58,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1128554049, now seen corresponding path program 2 times [2024-06-27 16:58:58,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:58:58,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594562733] [2024-06-27 16:58:58,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:58,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:58:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:59,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:59,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:58:59,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594562733] [2024-06-27 16:58:59,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594562733] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:58:59,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077301547] [2024-06-27 16:58:59,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:58:59,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:58:59,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:58:59,529 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-06-27 16:58:59,552 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-06-27 16:58:59,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:58:59,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:58:59,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 36 conjunts are in the unsatisfiable core [2024-06-27 16:58:59,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:58:59,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 16:58:59,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 38 [2024-06-27 16:58:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:59,974 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:00,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 195 [2024-06-27 16:59:01,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:59:01,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 287 treesize of output 317 [2024-06-27 16:59:21,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 90 [2024-06-27 16:59:21,414 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-06-27 16:59:21,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 1 [2024-06-27 16:59:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:21,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077301547] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:21,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:59:21,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2024-06-27 16:59:21,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693718473] [2024-06-27 16:59:21,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:21,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-06-27 16:59:21,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:59:21,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-06-27 16:59:21,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2024-06-27 16:59:21,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 16:59:21,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 500 flow. Second operand has 24 states, 24 states have (on average 6.875) internal successors, (165), 24 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:21,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:21,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 16:59:21,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:22,242 INFO L124 PetriNetUnfolderBase]: 1687/2434 cut-off events. [2024-06-27 16:59:22,242 INFO L125 PetriNetUnfolderBase]: For 5353/5353 co-relation queries the response was YES. [2024-06-27 16:59:22,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9392 conditions, 2434 events. 1687/2434 cut-off events. For 5353/5353 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9981 event pairs, 290 based on Foata normal form. 1/2435 useless extension candidates. Maximal degree in co-relation 9149. Up to 1895 conditions per place. [2024-06-27 16:59:22,259 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 107 selfloop transitions, 34 changer transitions 1/143 dead transitions. [2024-06-27 16:59:22,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 143 transitions, 1128 flow [2024-06-27 16:59:22,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 16:59:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 16:59:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-27 16:59:22,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45517241379310347 [2024-06-27 16:59:22,261 INFO L175 Difference]: Start difference. First operand has 62 places, 78 transitions, 500 flow. Second operand 10 states and 132 transitions. [2024-06-27 16:59:22,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 143 transitions, 1128 flow [2024-06-27 16:59:22,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 143 transitions, 1029 flow, removed 40 selfloop flow, removed 2 redundant places. [2024-06-27 16:59:22,273 INFO L231 Difference]: Finished difference. Result has 74 places, 98 transitions, 669 flow [2024-06-27 16:59:22,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=669, PETRI_PLACES=74, PETRI_TRANSITIONS=98} [2024-06-27 16:59:22,276 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 43 predicate places. [2024-06-27 16:59:22,276 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 98 transitions, 669 flow [2024-06-27 16:59:22,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.875) internal successors, (165), 24 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:22,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:22,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:22,293 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-06-27 16:59:22,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:22,490 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:59:22,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1065817201, now seen corresponding path program 3 times [2024-06-27 16:59:22,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:59:22,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187944023] [2024-06-27 16:59:22,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:59:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:23,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:59:23,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187944023] [2024-06-27 16:59:23,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187944023] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:59:23,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128564857] [2024-06-27 16:59:23,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:59:23,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:23,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:59:23,022 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-06-27 16:59:23,023 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-06-27 16:59:23,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-06-27 16:59:23,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:59:23,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 34 conjunts are in the unsatisfiable core [2024-06-27 16:59:23,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:23,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 16:59:23,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:59:23,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 81 [2024-06-27 16:59:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:23,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:24,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 86 [2024-06-27 16:59:24,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 115 [2024-06-27 16:59:24,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2024-06-27 16:59:24,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 84 [2024-06-27 16:59:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:24,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128564857] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:24,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:59:24,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-06-27 16:59:24,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521973180] [2024-06-27 16:59:24,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:24,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-06-27 16:59:24,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:59:24,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-06-27 16:59:24,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2024-06-27 16:59:24,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 16:59:24,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 98 transitions, 669 flow. Second operand has 26 states, 26 states have (on average 6.653846153846154) internal successors, (173), 26 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:24,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:24,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 16:59:24,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:25,884 INFO L124 PetriNetUnfolderBase]: 2176/3131 cut-off events. [2024-06-27 16:59:25,885 INFO L125 PetriNetUnfolderBase]: For 7848/7848 co-relation queries the response was YES. [2024-06-27 16:59:25,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12614 conditions, 3131 events. 2176/3131 cut-off events. For 7848/7848 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13507 event pairs, 297 based on Foata normal form. 2/3133 useless extension candidates. Maximal degree in co-relation 12378. Up to 2324 conditions per place. [2024-06-27 16:59:25,899 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 162 selfloop transitions, 50 changer transitions 2/215 dead transitions. [2024-06-27 16:59:25,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 215 transitions, 1751 flow [2024-06-27 16:59:25,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-06-27 16:59:25,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-06-27 16:59:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 233 transitions. [2024-06-27 16:59:25,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.446360153256705 [2024-06-27 16:59:25,902 INFO L175 Difference]: Start difference. First operand has 74 places, 98 transitions, 669 flow. Second operand 18 states and 233 transitions. [2024-06-27 16:59:25,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 215 transitions, 1751 flow [2024-06-27 16:59:25,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 215 transitions, 1734 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-27 16:59:25,916 INFO L231 Difference]: Finished difference. Result has 94 places, 124 transitions, 999 flow [2024-06-27 16:59:25,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=999, PETRI_PLACES=94, PETRI_TRANSITIONS=124} [2024-06-27 16:59:25,917 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 63 predicate places. [2024-06-27 16:59:25,917 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 124 transitions, 999 flow [2024-06-27 16:59:25,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.653846153846154) internal successors, (173), 26 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:25,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:25,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:25,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-27 16:59:26,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:26,131 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:59:26,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:26,131 INFO L85 PathProgramCache]: Analyzing trace with hash -271198019, now seen corresponding path program 4 times [2024-06-27 16:59:26,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:59:26,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610486864] [2024-06-27 16:59:26,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:26,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:59:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:26,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:59:26,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610486864] [2024-06-27 16:59:26,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610486864] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:59:26,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897409653] [2024-06-27 16:59:26,673 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 16:59:26,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:26,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:59:26,674 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-06-27 16:59:26,695 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-06-27 16:59:26,768 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 16:59:26,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:59:26,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 34 conjunts are in the unsatisfiable core [2024-06-27 16:59:26,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:26,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 16:59:27,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 38 [2024-06-27 16:59:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:27,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:27,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 219 [2024-06-27 16:59:28,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:59:28,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 359 treesize of output 373 [2024-06-27 16:59:46,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 90 [2024-06-27 16:59:46,337 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-06-27 16:59:46,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 1 [2024-06-27 16:59:46,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:46,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897409653] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:46,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:59:46,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2024-06-27 16:59:46,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178711669] [2024-06-27 16:59:46,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:46,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-06-27 16:59:46,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:59:46,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-06-27 16:59:46,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2024-06-27 16:59:46,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 16:59:46,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 124 transitions, 999 flow. Second operand has 24 states, 24 states have (on average 6.875) internal successors, (165), 24 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:46,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:46,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 16:59:46,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:47,105 INFO L124 PetriNetUnfolderBase]: 2324/3344 cut-off events. [2024-06-27 16:59:47,106 INFO L125 PetriNetUnfolderBase]: For 11315/11315 co-relation queries the response was YES. [2024-06-27 16:59:47,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14724 conditions, 3344 events. 2324/3344 cut-off events. For 11315/11315 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14510 event pairs, 414 based on Foata normal form. 1/3345 useless extension candidates. Maximal degree in co-relation 14466. Up to 2785 conditions per place. [2024-06-27 16:59:47,127 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 139 selfloop transitions, 35 changer transitions 1/176 dead transitions. [2024-06-27 16:59:47,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 176 transitions, 1618 flow [2024-06-27 16:59:47,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 16:59:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 16:59:47,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-06-27 16:59:47,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789272030651341 [2024-06-27 16:59:47,128 INFO L175 Difference]: Start difference. First operand has 94 places, 124 transitions, 999 flow. Second operand 9 states and 125 transitions. [2024-06-27 16:59:47,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 176 transitions, 1618 flow [2024-06-27 16:59:47,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 176 transitions, 1470 flow, removed 57 selfloop flow, removed 7 redundant places. [2024-06-27 16:59:47,149 INFO L231 Difference]: Finished difference. Result has 97 places, 131 transitions, 1020 flow [2024-06-27 16:59:47,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1020, PETRI_PLACES=97, PETRI_TRANSITIONS=131} [2024-06-27 16:59:47,149 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 66 predicate places. [2024-06-27 16:59:47,149 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 131 transitions, 1020 flow [2024-06-27 16:59:47,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.875) internal successors, (165), 24 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:47,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:47,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:47,161 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-06-27 16:59:47,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:47,363 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:59:47,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:47,364 INFO L85 PathProgramCache]: Analyzing trace with hash 651817233, now seen corresponding path program 5 times [2024-06-27 16:59:47,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:59:47,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444992516] [2024-06-27 16:59:47,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:47,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:59:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:47,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:59:47,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444992516] [2024-06-27 16:59:47,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444992516] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:59:47,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163951447] [2024-06-27 16:59:47,959 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 16:59:47,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:47,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:59:47,960 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-06-27 16:59:47,996 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-06-27 16:59:48,067 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-06-27 16:59:48,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:59:48,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 36 conjunts are in the unsatisfiable core [2024-06-27 16:59:48,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:48,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 16:59:48,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:59:48,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 81 [2024-06-27 16:59:48,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:48,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:50,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-06-27 16:59:50,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2024-06-27 16:59:50,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2024-06-27 16:59:50,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 81 [2024-06-27 16:59:50,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 87 [2024-06-27 16:59:50,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 115 [2024-06-27 16:59:50,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2024-06-27 16:59:50,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2024-06-27 16:59:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:50,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163951447] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:50,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:59:50,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 26 [2024-06-27 16:59:50,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242090212] [2024-06-27 16:59:50,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:50,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-06-27 16:59:50,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:59:50,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-06-27 16:59:50,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2024-06-27 16:59:50,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 16:59:50,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 131 transitions, 1020 flow. Second operand has 27 states, 27 states have (on average 6.555555555555555) internal successors, (177), 27 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:50,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:50,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 16:59:50,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:53,575 INFO L124 PetriNetUnfolderBase]: 3449/4915 cut-off events. [2024-06-27 16:59:53,576 INFO L125 PetriNetUnfolderBase]: For 17312/17312 co-relation queries the response was YES. [2024-06-27 16:59:53,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21534 conditions, 4915 events. 3449/4915 cut-off events. For 17312/17312 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 22579 event pairs, 367 based on Foata normal form. 2/4917 useless extension candidates. Maximal degree in co-relation 21272. Up to 3384 conditions per place. [2024-06-27 16:59:53,610 INFO L140 encePairwiseOnDemand]: 16/29 looper letters, 234 selfloop transitions, 130 changer transitions 2/367 dead transitions. [2024-06-27 16:59:53,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 367 transitions, 3301 flow [2024-06-27 16:59:53,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-06-27 16:59:53,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-06-27 16:59:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 403 transitions. [2024-06-27 16:59:53,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40872210953346855 [2024-06-27 16:59:53,613 INFO L175 Difference]: Start difference. First operand has 97 places, 131 transitions, 1020 flow. Second operand 34 states and 403 transitions. [2024-06-27 16:59:53,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 367 transitions, 3301 flow [2024-06-27 16:59:53,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 367 transitions, 3237 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 16:59:53,652 INFO L231 Difference]: Finished difference. Result has 136 places, 225 transitions, 2130 flow [2024-06-27 16:59:53,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2130, PETRI_PLACES=136, PETRI_TRANSITIONS=225} [2024-06-27 16:59:53,653 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 105 predicate places. [2024-06-27 16:59:53,653 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 225 transitions, 2130 flow [2024-06-27 16:59:53,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.555555555555555) internal successors, (177), 27 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:53,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:53,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:53,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-06-27 16:59:53,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:53,868 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:59:53,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:53,869 INFO L85 PathProgramCache]: Analyzing trace with hash 951043089, now seen corresponding path program 6 times [2024-06-27 16:59:53,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:59:53,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783379150] [2024-06-27 16:59:53,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:53,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:59:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:54,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:59:54,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783379150] [2024-06-27 16:59:54,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783379150] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:59:54,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491542346] [2024-06-27 16:59:54,439 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 16:59:54,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:54,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:59:54,448 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-06-27 16:59:54,475 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-06-27 16:59:54,535 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-06-27 16:59:54,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:59:54,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 36 conjunts are in the unsatisfiable core [2024-06-27 16:59:54,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:54,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 16:59:54,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 38 [2024-06-27 16:59:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:54,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:55,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 108 [2024-06-27 16:59:55,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:59:55,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 143 [2024-06-27 16:59:56,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2024-06-27 16:59:56,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2024-06-27 16:59:56,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 106 [2024-06-27 16:59:56,534 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-06-27 16:59:56,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 153 [2024-06-27 16:59:56,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2024-06-27 16:59:56,771 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-06-27 16:59:56,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 1 [2024-06-27 16:59:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:56,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491542346] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:56,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:59:56,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2024-06-27 16:59:56,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390126684] [2024-06-27 16:59:56,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:56,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-06-27 16:59:56,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:59:56,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-06-27 16:59:56,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-06-27 16:59:56,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 16:59:56,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 225 transitions, 2130 flow. Second operand has 24 states, 24 states have (on average 6.875) internal successors, (165), 24 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:56,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:56,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 16:59:56,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:57,918 INFO L124 PetriNetUnfolderBase]: 3606/5143 cut-off events. [2024-06-27 16:59:57,918 INFO L125 PetriNetUnfolderBase]: For 32948/32948 co-relation queries the response was YES. [2024-06-27 16:59:58,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26524 conditions, 5143 events. 3606/5143 cut-off events. For 32948/32948 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 23710 event pairs, 571 based on Foata normal form. 1/5144 useless extension candidates. Maximal degree in co-relation 26174. Up to 4634 conditions per place. [2024-06-27 16:59:58,030 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 224 selfloop transitions, 41 changer transitions 1/267 dead transitions. [2024-06-27 16:59:58,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 267 transitions, 2928 flow [2024-06-27 16:59:58,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 16:59:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 16:59:58,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-27 16:59:58,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4559386973180077 [2024-06-27 16:59:58,033 INFO L175 Difference]: Start difference. First operand has 136 places, 225 transitions, 2130 flow. Second operand 9 states and 119 transitions. [2024-06-27 16:59:58,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 267 transitions, 2928 flow [2024-06-27 16:59:58,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 267 transitions, 2387 flow, removed 238 selfloop flow, removed 11 redundant places. [2024-06-27 16:59:58,107 INFO L231 Difference]: Finished difference. Result has 135 places, 230 transitions, 1772 flow [2024-06-27 16:59:58,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1772, PETRI_PLACES=135, PETRI_TRANSITIONS=230} [2024-06-27 16:59:58,108 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 104 predicate places. [2024-06-27 16:59:58,108 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 230 transitions, 1772 flow [2024-06-27 16:59:58,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.875) internal successors, (165), 24 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:58,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:58,109 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:58,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-06-27 16:59:58,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:58,320 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:59:58,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:58,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2051286542, now seen corresponding path program 7 times [2024-06-27 16:59:58,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:59:58,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276398036] [2024-06-27 16:59:58,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:58,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:59:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:59:58,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:59:58,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276398036] [2024-06-27 16:59:58,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276398036] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:59:58,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024549472] [2024-06-27 16:59:58,391 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-06-27 16:59:58,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:58,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:59:58,405 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-06-27 16:59:58,453 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-06-27 16:59:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:58,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 16:59:58,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:59:58,586 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:58,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:59:58,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024549472] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:58,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:59:58,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-06-27 16:59:58,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438555034] [2024-06-27 16:59:58,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:58,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-27 16:59:58,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:59:58,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-27 16:59:58,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-06-27 16:59:58,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-27 16:59:58,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 230 transitions, 1772 flow. Second operand has 14 states, 14 states have (on average 8.285714285714286) internal successors, (116), 14 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-06-27 16:59:58,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:58,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-27 16:59:58,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:59,267 INFO L124 PetriNetUnfolderBase]: 3198/4817 cut-off events. [2024-06-27 16:59:59,267 INFO L125 PetriNetUnfolderBase]: For 32749/32989 co-relation queries the response was YES. [2024-06-27 16:59:59,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24387 conditions, 4817 events. 3198/4817 cut-off events. For 32749/32989 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 24875 event pairs, 1324 based on Foata normal form. 136/4951 useless extension candidates. Maximal degree in co-relation 24223. Up to 3083 conditions per place. [2024-06-27 16:59:59,307 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 263 selfloop transitions, 26 changer transitions 0/294 dead transitions. [2024-06-27 16:59:59,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 294 transitions, 2848 flow [2024-06-27 16:59:59,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 16:59:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 16:59:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-27 16:59:59,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4870689655172414 [2024-06-27 16:59:59,309 INFO L175 Difference]: Start difference. First operand has 135 places, 230 transitions, 1772 flow. Second operand 8 states and 113 transitions. [2024-06-27 16:59:59,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 294 transitions, 2848 flow [2024-06-27 16:59:59,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 294 transitions, 2760 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-27 16:59:59,375 INFO L231 Difference]: Finished difference. Result has 138 places, 240 transitions, 1877 flow [2024-06-27 16:59:59,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1692, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1877, PETRI_PLACES=138, PETRI_TRANSITIONS=240} [2024-06-27 16:59:59,376 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 107 predicate places. [2024-06-27 16:59:59,376 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 240 transitions, 1877 flow [2024-06-27 16:59:59,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.285714285714286) internal successors, (116), 14 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-06-27 16:59:59,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:59,377 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:59,404 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-06-27 16:59:59,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-06-27 16:59:59,588 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:59:59,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:59,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1338238594, now seen corresponding path program 8 times [2024-06-27 16:59:59,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:59:59,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458197685] [2024-06-27 16:59:59,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:59,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:59:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:59,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:59:59,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:59:59,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458197685] [2024-06-27 16:59:59,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458197685] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:59:59,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499555621] [2024-06-27 16:59:59,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:59:59,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:59,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:59:59,652 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-06-27 16:59:59,659 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-06-27 16:59:59,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:59:59,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:59:59,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 16:59:59,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:59,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:59:59,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:59:59,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499555621] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:59,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:59:59,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-06-27 16:59:59,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739406331] [2024-06-27 16:59:59,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:59,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-27 16:59:59,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:59:59,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-27 16:59:59,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-06-27 16:59:59,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-27 16:59:59,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 240 transitions, 1877 flow. Second operand has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:59,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:59,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-27 16:59:59,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:00,367 INFO L124 PetriNetUnfolderBase]: 2924/4501 cut-off events. [2024-06-27 17:00:00,368 INFO L125 PetriNetUnfolderBase]: For 33305/33552 co-relation queries the response was YES. [2024-06-27 17:00:00,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23099 conditions, 4501 events. 2924/4501 cut-off events. For 33305/33552 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 24151 event pairs, 949 based on Foata normal form. 246/4745 useless extension candidates. Maximal degree in co-relation 22697. Up to 1414 conditions per place. [2024-06-27 17:00:00,404 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 261 selfloop transitions, 46 changer transitions 0/312 dead transitions. [2024-06-27 17:00:00,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 312 transitions, 3040 flow [2024-06-27 17:00:00,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:00:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:00:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2024-06-27 17:00:00,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5221674876847291 [2024-06-27 17:00:00,405 INFO L175 Difference]: Start difference. First operand has 138 places, 240 transitions, 1877 flow. Second operand 7 states and 106 transitions. [2024-06-27 17:00:00,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 312 transitions, 3040 flow [2024-06-27 17:00:00,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 312 transitions, 3027 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 17:00:00,492 INFO L231 Difference]: Finished difference. Result has 141 places, 222 transitions, 1853 flow [2024-06-27 17:00:00,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1714, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1853, PETRI_PLACES=141, PETRI_TRANSITIONS=222} [2024-06-27 17:00:00,495 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 110 predicate places. [2024-06-27 17:00:00,495 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 222 transitions, 1853 flow [2024-06-27 17:00:00,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:00,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:00,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:00,510 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-06-27 17:00:00,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:00,711 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:00:00,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:00,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1784502229, now seen corresponding path program 1 times [2024-06-27 17:00:00,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:00:00,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571685307] [2024-06-27 17:00:00,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:00:00,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:00:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:00:00,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:00:00,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571685307] [2024-06-27 17:00:00,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571685307] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:00:00,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855385974] [2024-06-27 17:00:00,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:00:00,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:00,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:00:00,794 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-06-27 17:00:00,812 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-06-27 17:00:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:00,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 17:00:00,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:00:00,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:00:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:00:00,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855385974] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:00:00,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:00:00,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-06-27 17:00:00,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996955521] [2024-06-27 17:00:00,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:00:00,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 17:00:00,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:00:00,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 17:00:00,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-06-27 17:00:00,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-27 17:00:00,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 222 transitions, 1853 flow. Second operand has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:00,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:00,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-27 17:00:00,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:01,571 INFO L124 PetriNetUnfolderBase]: 2459/3954 cut-off events. [2024-06-27 17:00:01,571 INFO L125 PetriNetUnfolderBase]: For 31018/31185 co-relation queries the response was YES. [2024-06-27 17:00:01,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20901 conditions, 3954 events. 2459/3954 cut-off events. For 31018/31185 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 22296 event pairs, 968 based on Foata normal form. 289/4243 useless extension candidates. Maximal degree in co-relation 20498. Up to 1438 conditions per place. [2024-06-27 17:00:01,602 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 252 selfloop transitions, 10 changer transitions 12/279 dead transitions. [2024-06-27 17:00:01,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 279 transitions, 2951 flow [2024-06-27 17:00:01,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:00:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:00:01,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2024-06-27 17:00:01,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 17:00:01,604 INFO L175 Difference]: Start difference. First operand has 141 places, 222 transitions, 1853 flow. Second operand 6 states and 87 transitions. [2024-06-27 17:00:01,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 279 transitions, 2951 flow [2024-06-27 17:00:01,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 279 transitions, 2789 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-27 17:00:01,678 INFO L231 Difference]: Finished difference. Result has 140 places, 169 transitions, 1442 flow [2024-06-27 17:00:01,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1442, PETRI_PLACES=140, PETRI_TRANSITIONS=169} [2024-06-27 17:00:01,679 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 109 predicate places. [2024-06-27 17:00:01,679 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 169 transitions, 1442 flow [2024-06-27 17:00:01,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:01,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:01,680 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:01,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-06-27 17:00:01,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-06-27 17:00:01,889 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:00:01,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:01,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1681289207, now seen corresponding path program 9 times [2024-06-27 17:00:01,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:00:01,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007488471] [2024-06-27 17:00:01,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:00:01,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:00:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:00:01,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:00:01,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007488471] [2024-06-27 17:00:01,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007488471] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:00:01,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362675920] [2024-06-27 17:00:01,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:00:01,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:01,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:00:01,992 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-06-27 17:00:02,036 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-06-27 17:00:02,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:00:02,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:00:02,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 17:00:02,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:02,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:00:02,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:00:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:00:02,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362675920] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:00:02,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:00:02,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-06-27 17:00:02,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537073604] [2024-06-27 17:00:02,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:00:02,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-06-27 17:00:02,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:00:02,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-06-27 17:00:02,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-06-27 17:00:02,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 17:00:02,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 169 transitions, 1442 flow. Second operand has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:02,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:02,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 17:00:02,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:03,169 INFO L124 PetriNetUnfolderBase]: 3672/5541 cut-off events. [2024-06-27 17:00:03,170 INFO L125 PetriNetUnfolderBase]: For 47227/47227 co-relation queries the response was YES. [2024-06-27 17:00:03,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30680 conditions, 5541 events. 3672/5541 cut-off events. For 47227/47227 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 29338 event pairs, 952 based on Foata normal form. 22/5563 useless extension candidates. Maximal degree in co-relation 30200. Up to 1482 conditions per place. [2024-06-27 17:00:03,206 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 364 selfloop transitions, 72 changer transitions 0/437 dead transitions. [2024-06-27 17:00:03,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 437 transitions, 4727 flow [2024-06-27 17:00:03,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 17:00:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 17:00:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 181 transitions. [2024-06-27 17:00:03,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4458128078817734 [2024-06-27 17:00:03,208 INFO L175 Difference]: Start difference. First operand has 140 places, 169 transitions, 1442 flow. Second operand 14 states and 181 transitions. [2024-06-27 17:00:03,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 437 transitions, 4727 flow [2024-06-27 17:00:03,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 437 transitions, 4679 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-27 17:00:03,294 INFO L231 Difference]: Finished difference. Result has 153 places, 207 transitions, 2039 flow [2024-06-27 17:00:03,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1420, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2039, PETRI_PLACES=153, PETRI_TRANSITIONS=207} [2024-06-27 17:00:03,295 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 122 predicate places. [2024-06-27 17:00:03,295 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 207 transitions, 2039 flow [2024-06-27 17:00:03,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:03,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:03,296 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:03,306 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-06-27 17:00:03,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-06-27 17:00:03,507 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:00:03,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:03,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1554617895, now seen corresponding path program 10 times [2024-06-27 17:00:03,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:00:03,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146330834] [2024-06-27 17:00:03,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:00:03,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:00:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:03,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:00:03,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146330834] [2024-06-27 17:00:03,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146330834] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:00:03,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868755360] [2024-06-27 17:00:03,599 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:00:03,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:03,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:00:03,600 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-06-27 17:00:03,625 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-06-27 17:00:03,681 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:00:03,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:00:03,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 17:00:03,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:03,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:00:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:03,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868755360] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:00:03,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:00:03,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-06-27 17:00:03,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226503235] [2024-06-27 17:00:03,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:00:03,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-06-27 17:00:03,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:00:03,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-06-27 17:00:03,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-06-27 17:00:03,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 17:00:03,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 207 transitions, 2039 flow. Second operand has 19 states, 19 states have (on average 6.315789473684211) internal successors, (120), 19 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:03,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:03,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 17:00:03,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:04,766 INFO L124 PetriNetUnfolderBase]: 4367/6541 cut-off events. [2024-06-27 17:00:04,766 INFO L125 PetriNetUnfolderBase]: For 70975/70975 co-relation queries the response was YES. [2024-06-27 17:00:04,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40088 conditions, 6541 events. 4367/6541 cut-off events. For 70975/70975 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 34057 event pairs, 1037 based on Foata normal form. 19/6560 useless extension candidates. Maximal degree in co-relation 39581. Up to 1849 conditions per place. [2024-06-27 17:00:04,812 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 334 selfloop transitions, 49 changer transitions 0/384 dead transitions. [2024-06-27 17:00:04,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 384 transitions, 4569 flow [2024-06-27 17:00:04,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 17:00:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 17:00:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 155 transitions. [2024-06-27 17:00:04,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4454022988505747 [2024-06-27 17:00:04,814 INFO L175 Difference]: Start difference. First operand has 153 places, 207 transitions, 2039 flow. Second operand 12 states and 155 transitions. [2024-06-27 17:00:04,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 384 transitions, 4569 flow [2024-06-27 17:00:05,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 384 transitions, 4117 flow, removed 216 selfloop flow, removed 4 redundant places. [2024-06-27 17:00:05,003 INFO L231 Difference]: Finished difference. Result has 164 places, 225 transitions, 2149 flow [2024-06-27 17:00:05,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2149, PETRI_PLACES=164, PETRI_TRANSITIONS=225} [2024-06-27 17:00:05,004 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 133 predicate places. [2024-06-27 17:00:05,004 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 225 transitions, 2149 flow [2024-06-27 17:00:05,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.315789473684211) internal successors, (120), 19 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:05,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:05,005 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:05,018 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-06-27 17:00:05,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-06-27 17:00:05,217 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:00:05,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1944870311, now seen corresponding path program 11 times [2024-06-27 17:00:05,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:00:05,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946529012] [2024-06-27 17:00:05,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:00:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:00:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:00:05,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:00:05,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946529012] [2024-06-27 17:00:05,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946529012] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:00:05,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253734232] [2024-06-27 17:00:05,303 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 17:00:05,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:05,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:00:05,304 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-06-27 17:00:05,307 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-06-27 17:00:05,384 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:00:05,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:00:05,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 17:00:05,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:05,470 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:05,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:00:05,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:05,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253734232] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:00:05,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:00:05,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2024-06-27 17:00:05,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145274235] [2024-06-27 17:00:05,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:00:05,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-27 17:00:05,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:00:05,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-27 17:00:05,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-06-27 17:00:05,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 17:00:05,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 225 transitions, 2149 flow. Second operand has 17 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:05,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:05,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 17:00:05,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:07,273 INFO L124 PetriNetUnfolderBase]: 4693/7024 cut-off events. [2024-06-27 17:00:07,274 INFO L125 PetriNetUnfolderBase]: For 63043/63043 co-relation queries the response was YES. [2024-06-27 17:00:07,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41379 conditions, 7024 events. 4693/7024 cut-off events. For 63043/63043 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 37263 event pairs, 471 based on Foata normal form. 20/7044 useless extension candidates. Maximal degree in co-relation 40857. Up to 2007 conditions per place. [2024-06-27 17:00:07,318 INFO L140 encePairwiseOnDemand]: 16/29 looper letters, 311 selfloop transitions, 333 changer transitions 0/645 dead transitions. [2024-06-27 17:00:07,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 645 transitions, 7440 flow [2024-06-27 17:00:07,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-06-27 17:00:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-06-27 17:00:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 391 transitions. [2024-06-27 17:00:07,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39655172413793105 [2024-06-27 17:00:07,321 INFO L175 Difference]: Start difference. First operand has 164 places, 225 transitions, 2149 flow. Second operand 34 states and 391 transitions. [2024-06-27 17:00:07,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 645 transitions, 7440 flow [2024-06-27 17:00:07,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 645 transitions, 7339 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-27 17:00:07,467 INFO L231 Difference]: Finished difference. Result has 200 places, 423 transitions, 5187 flow [2024-06-27 17:00:07,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=5187, PETRI_PLACES=200, PETRI_TRANSITIONS=423} [2024-06-27 17:00:07,468 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 169 predicate places. [2024-06-27 17:00:07,468 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 423 transitions, 5187 flow [2024-06-27 17:00:07,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:07,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:07,469 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:07,479 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-06-27 17:00:07,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-06-27 17:00:07,685 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:00:07,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:07,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2040312459, now seen corresponding path program 12 times [2024-06-27 17:00:07,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:00:07,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405854727] [2024-06-27 17:00:07,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:00:07,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:00:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:00:07,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:00:07,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405854727] [2024-06-27 17:00:07,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405854727] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:00:07,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299164655] [2024-06-27 17:00:07,789 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 17:00:07,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:07,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:00:07,791 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-06-27 17:00:07,791 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-06-27 17:00:07,869 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-06-27 17:00:07,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:00:07,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 17:00:07,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:00:07,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:00:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:00:08,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299164655] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:00:08,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:00:08,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-06-27 17:00:08,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382406513] [2024-06-27 17:00:08,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:00:08,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-06-27 17:00:08,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:00:08,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-06-27 17:00:08,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-06-27 17:00:08,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 17:00:08,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 423 transitions, 5187 flow. Second operand has 20 states, 20 states have (on average 6.35) internal successors, (127), 20 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:08,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:08,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 17:00:08,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:09,831 INFO L124 PetriNetUnfolderBase]: 5762/8528 cut-off events. [2024-06-27 17:00:09,831 INFO L125 PetriNetUnfolderBase]: For 95930/95930 co-relation queries the response was YES. [2024-06-27 17:00:09,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56148 conditions, 8528 events. 5762/8528 cut-off events. For 95930/95930 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 45637 event pairs, 917 based on Foata normal form. 20/8548 useless extension candidates. Maximal degree in co-relation 55588. Up to 2666 conditions per place. [2024-06-27 17:00:09,891 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 690 selfloop transitions, 244 changer transitions 0/935 dead transitions. [2024-06-27 17:00:09,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 935 transitions, 12859 flow [2024-06-27 17:00:09,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-06-27 17:00:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-06-27 17:00:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 368 transitions. [2024-06-27 17:00:09,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45320197044334976 [2024-06-27 17:00:09,893 INFO L175 Difference]: Start difference. First operand has 200 places, 423 transitions, 5187 flow. Second operand 28 states and 368 transitions. [2024-06-27 17:00:09,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 935 transitions, 12859 flow [2024-06-27 17:00:10,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 935 transitions, 11986 flow, removed 97 selfloop flow, removed 11 redundant places. [2024-06-27 17:00:10,187 INFO L231 Difference]: Finished difference. Result has 226 places, 534 transitions, 6887 flow [2024-06-27 17:00:10,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=4694, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=6887, PETRI_PLACES=226, PETRI_TRANSITIONS=534} [2024-06-27 17:00:10,188 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 195 predicate places. [2024-06-27 17:00:10,188 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 534 transitions, 6887 flow [2024-06-27 17:00:10,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.35) internal successors, (127), 20 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:10,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:10,188 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:10,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-06-27 17:00:10,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:10,400 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:00:10,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:10,400 INFO L85 PathProgramCache]: Analyzing trace with hash -232979963, now seen corresponding path program 13 times [2024-06-27 17:00:10,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:00:10,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745146666] [2024-06-27 17:00:10,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:00:10,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:00:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:10,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:00:10,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745146666] [2024-06-27 17:00:10,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745146666] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:00:10,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320576438] [2024-06-27 17:00:10,512 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-06-27 17:00:10,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:10,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:00:10,513 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-06-27 17:00:10,514 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-06-27 17:00:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:10,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 17:00:10,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:10,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:10,694 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:00:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:10,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320576438] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:00:10,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:00:10,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-06-27 17:00:10,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170868879] [2024-06-27 17:00:10,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:00:10,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-06-27 17:00:10,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:00:10,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-06-27 17:00:10,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-06-27 17:00:10,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 17:00:10,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 534 transitions, 6887 flow. Second operand has 20 states, 20 states have (on average 6.4) internal successors, (128), 20 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:10,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:10,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 17:00:10,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:12,580 INFO L124 PetriNetUnfolderBase]: 5917/8789 cut-off events. [2024-06-27 17:00:12,580 INFO L125 PetriNetUnfolderBase]: For 105210/105210 co-relation queries the response was YES. [2024-06-27 17:00:12,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59759 conditions, 8789 events. 5917/8789 cut-off events. For 105210/105210 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 47564 event pairs, 1167 based on Foata normal form. 20/8809 useless extension candidates. Maximal degree in co-relation 59158. Up to 2769 conditions per place. [2024-06-27 17:00:12,652 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 444 selfloop transitions, 339 changer transitions 0/784 dead transitions. [2024-06-27 17:00:12,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 784 transitions, 10929 flow [2024-06-27 17:00:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-06-27 17:00:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-06-27 17:00:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 240 transitions. [2024-06-27 17:00:12,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355716878402904 [2024-06-27 17:00:12,655 INFO L175 Difference]: Start difference. First operand has 226 places, 534 transitions, 6887 flow. Second operand 19 states and 240 transitions. [2024-06-27 17:00:12,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 784 transitions, 10929 flow [2024-06-27 17:00:13,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 784 transitions, 10334 flow, removed 173 selfloop flow, removed 10 redundant places. [2024-06-27 17:00:13,084 INFO L231 Difference]: Finished difference. Result has 238 places, 574 transitions, 7885 flow [2024-06-27 17:00:13,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=6336, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=302, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7885, PETRI_PLACES=238, PETRI_TRANSITIONS=574} [2024-06-27 17:00:13,085 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 207 predicate places. [2024-06-27 17:00:13,085 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 574 transitions, 7885 flow [2024-06-27 17:00:13,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.4) internal successors, (128), 20 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:13,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:13,085 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:13,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-06-27 17:00:13,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-06-27 17:00:13,301 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:00:13,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:13,317 INFO L85 PathProgramCache]: Analyzing trace with hash 148497085, now seen corresponding path program 14 times [2024-06-27 17:00:13,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:00:13,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093652999] [2024-06-27 17:00:13,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:00:13,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:00:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:13,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:00:13,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093652999] [2024-06-27 17:00:13,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093652999] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:00:13,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679360660] [2024-06-27 17:00:13,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:00:13,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:13,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:00:13,452 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-06-27 17:00:13,453 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-06-27 17:00:13,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:00:13,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:00:13,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 17:00:13,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:13,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:00:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:13,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679360660] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:00:13,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:00:13,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-06-27 17:00:13,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230076153] [2024-06-27 17:00:13,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:00:13,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-06-27 17:00:13,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:00:13,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-06-27 17:00:13,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-06-27 17:00:13,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 17:00:13,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 574 transitions, 7885 flow. Second operand has 21 states, 21 states have (on average 6.095238095238095) internal successors, (128), 21 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:13,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:13,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 17:00:13,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:15,857 INFO L124 PetriNetUnfolderBase]: 7507/11134 cut-off events. [2024-06-27 17:00:15,857 INFO L125 PetriNetUnfolderBase]: For 131791/131791 co-relation queries the response was YES. [2024-06-27 17:00:15,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76357 conditions, 11134 events. 7507/11134 cut-off events. For 131791/131791 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 63207 event pairs, 1596 based on Foata normal form. 19/11153 useless extension candidates. Maximal degree in co-relation 75684. Up to 3799 conditions per place. [2024-06-27 17:00:15,956 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 548 selfloop transitions, 367 changer transitions 0/916 dead transitions. [2024-06-27 17:00:15,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 916 transitions, 13198 flow [2024-06-27 17:00:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 17:00:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 17:00:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 185 transitions. [2024-06-27 17:00:15,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45566502463054187 [2024-06-27 17:00:15,963 INFO L175 Difference]: Start difference. First operand has 238 places, 574 transitions, 7885 flow. Second operand 14 states and 185 transitions. [2024-06-27 17:00:15,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 916 transitions, 13198 flow [2024-06-27 17:00:16,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 916 transitions, 12855 flow, removed 102 selfloop flow, removed 8 redundant places. [2024-06-27 17:00:16,571 INFO L231 Difference]: Finished difference. Result has 245 places, 664 transitions, 9970 flow [2024-06-27 17:00:16,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=7513, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=274, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=9970, PETRI_PLACES=245, PETRI_TRANSITIONS=664} [2024-06-27 17:00:16,572 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 214 predicate places. [2024-06-27 17:00:16,572 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 664 transitions, 9970 flow [2024-06-27 17:00:16,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.095238095238095) internal successors, (128), 21 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:16,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:16,573 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:16,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-06-27 17:00:16,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:16,784 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:00:16,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:16,784 INFO L85 PathProgramCache]: Analyzing trace with hash 35452851, now seen corresponding path program 15 times [2024-06-27 17:00:16,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:00:16,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975879744] [2024-06-27 17:00:16,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:00:16,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:00:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:16,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:00:16,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975879744] [2024-06-27 17:00:16,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975879744] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:00:16,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833118852] [2024-06-27 17:00:16,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:00:16,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:16,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:00:16,868 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-06-27 17:00:16,897 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-06-27 17:00:16,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:00:16,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:00:16,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 17:00:16,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:17,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:00:17,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:17,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833118852] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:00:17,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:00:17,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-06-27 17:00:17,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455415635] [2024-06-27 17:00:17,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:00:17,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-06-27 17:00:17,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:00:17,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-06-27 17:00:17,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-06-27 17:00:17,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 17:00:17,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 664 transitions, 9970 flow. Second operand has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:17,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:17,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 17:00:17,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:19,207 INFO L124 PetriNetUnfolderBase]: 7478/11082 cut-off events. [2024-06-27 17:00:19,207 INFO L125 PetriNetUnfolderBase]: For 141666/141666 co-relation queries the response was YES. [2024-06-27 17:00:19,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79260 conditions, 11082 events. 7478/11082 cut-off events. For 141666/141666 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 61814 event pairs, 1496 based on Foata normal form. 20/11102 useless extension candidates. Maximal degree in co-relation 78583. Up to 3695 conditions per place. [2024-06-27 17:00:19,310 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 567 selfloop transitions, 263 changer transitions 0/831 dead transitions. [2024-06-27 17:00:19,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 831 transitions, 13249 flow [2024-06-27 17:00:19,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 17:00:19,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 17:00:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 177 transitions. [2024-06-27 17:00:19,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43596059113300495 [2024-06-27 17:00:19,312 INFO L175 Difference]: Start difference. First operand has 245 places, 664 transitions, 9970 flow. Second operand 14 states and 177 transitions. [2024-06-27 17:00:19,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 831 transitions, 13249 flow [2024-06-27 17:00:19,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 831 transitions, 12873 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 17:00:20,000 INFO L231 Difference]: Finished difference. Result has 250 places, 664 transitions, 10134 flow [2024-06-27 17:00:20,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=9597, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=263, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10134, PETRI_PLACES=250, PETRI_TRANSITIONS=664} [2024-06-27 17:00:20,001 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 219 predicate places. [2024-06-27 17:00:20,001 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 664 transitions, 10134 flow [2024-06-27 17:00:20,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:20,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:20,001 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:20,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-06-27 17:00:20,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:20,215 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:00:20,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:20,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1841427883, now seen corresponding path program 16 times [2024-06-27 17:00:20,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:00:20,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115658464] [2024-06-27 17:00:20,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:00:20,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:00:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:20,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:00:20,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115658464] [2024-06-27 17:00:20,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115658464] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:00:20,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992506221] [2024-06-27 17:00:20,302 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:00:20,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:20,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:00:20,303 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-06-27 17:00:20,357 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-06-27 17:00:20,415 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:00:20,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:00:20,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 17:00:20,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:20,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:20,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:00:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:20,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992506221] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:00:20,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:00:20,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-06-27 17:00:20,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050972114] [2024-06-27 17:00:20,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:00:20,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-06-27 17:00:20,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:00:20,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-06-27 17:00:20,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-06-27 17:00:20,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 17:00:20,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 664 transitions, 10134 flow. Second operand has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 21 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-06-27 17:00:20,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:20,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 17:00:20,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:23,264 INFO L124 PetriNetUnfolderBase]: 8488/12499 cut-off events. [2024-06-27 17:00:23,264 INFO L125 PetriNetUnfolderBase]: For 174960/174960 co-relation queries the response was YES. [2024-06-27 17:00:23,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91701 conditions, 12499 events. 8488/12499 cut-off events. For 174960/174960 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 71050 event pairs, 1580 based on Foata normal form. 19/12518 useless extension candidates. Maximal degree in co-relation 91005. Up to 4393 conditions per place. [2024-06-27 17:00:23,363 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 712 selfloop transitions, 329 changer transitions 0/1042 dead transitions. [2024-06-27 17:00:23,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 1042 transitions, 16432 flow [2024-06-27 17:00:23,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 17:00:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 17:00:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 218 transitions. [2024-06-27 17:00:23,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4698275862068966 [2024-06-27 17:00:23,366 INFO L175 Difference]: Start difference. First operand has 250 places, 664 transitions, 10134 flow. Second operand 16 states and 218 transitions. [2024-06-27 17:00:23,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 1042 transitions, 16432 flow [2024-06-27 17:00:24,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 1042 transitions, 16280 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 17:00:24,079 INFO L231 Difference]: Finished difference. Result has 263 places, 736 transitions, 12454 flow [2024-06-27 17:00:24,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=9982, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=260, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=12454, PETRI_PLACES=263, PETRI_TRANSITIONS=736} [2024-06-27 17:00:24,080 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 232 predicate places. [2024-06-27 17:00:24,080 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 736 transitions, 12454 flow [2024-06-27 17:00:24,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 21 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-06-27 17:00:24,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:24,081 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:24,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-06-27 17:00:24,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:24,292 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:00:24,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:24,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1535589223, now seen corresponding path program 17 times [2024-06-27 17:00:24,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:00:24,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622377539] [2024-06-27 17:00:24,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:00:24,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:00:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:24,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:00:24,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622377539] [2024-06-27 17:00:24,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622377539] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:00:24,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021320301] [2024-06-27 17:00:24,448 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 17:00:24,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:24,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:00:24,449 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-06-27 17:00:24,474 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-06-27 17:00:24,551 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:00:24,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:00:24,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 17:00:24,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:24,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:00:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:24,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021320301] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:00:24,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:00:24,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2024-06-27 17:00:24,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253134026] [2024-06-27 17:00:24,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:00:24,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-06-27 17:00:24,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:00:24,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-06-27 17:00:24,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-06-27 17:00:24,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 17:00:24,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 736 transitions, 12454 flow. Second operand has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 19 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:24,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:24,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 17:00:24,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:28,254 INFO L124 PetriNetUnfolderBase]: 8460/12448 cut-off events. [2024-06-27 17:00:28,254 INFO L125 PetriNetUnfolderBase]: For 191277/191277 co-relation queries the response was YES. [2024-06-27 17:00:28,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94568 conditions, 12448 events. 8460/12448 cut-off events. For 191277/191277 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 70611 event pairs, 552 based on Foata normal form. 19/12467 useless extension candidates. Maximal degree in co-relation 93875. Up to 4381 conditions per place. [2024-06-27 17:00:28,399 INFO L140 encePairwiseOnDemand]: 16/29 looper letters, 476 selfloop transitions, 720 changer transitions 0/1197 dead transitions. [2024-06-27 17:00:28,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 1197 transitions, 20062 flow [2024-06-27 17:00:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-06-27 17:00:28,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2024-06-27 17:00:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 618 transitions. [2024-06-27 17:00:28,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40981432360742703 [2024-06-27 17:00:28,403 INFO L175 Difference]: Start difference. First operand has 263 places, 736 transitions, 12454 flow. Second operand 52 states and 618 transitions. [2024-06-27 17:00:28,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 1197 transitions, 20062 flow [2024-06-27 17:00:29,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 1197 transitions, 19892 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-27 17:00:29,312 INFO L231 Difference]: Finished difference. Result has 306 places, 897 transitions, 15877 flow [2024-06-27 17:00:29,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=12232, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=556, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=15877, PETRI_PLACES=306, PETRI_TRANSITIONS=897} [2024-06-27 17:00:29,312 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 275 predicate places. [2024-06-27 17:00:29,313 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 897 transitions, 15877 flow [2024-06-27 17:00:29,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 19 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:29,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:29,313 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:29,327 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-06-27 17:00:29,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:29,525 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:00:29,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:29,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1161993097, now seen corresponding path program 2 times [2024-06-27 17:00:29,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:00:29,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264517329] [2024-06-27 17:00:29,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:00:29,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:00:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:00:31,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:00:31,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264517329] [2024-06-27 17:00:31,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264517329] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:00:31,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136671364] [2024-06-27 17:00:31,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:00:31,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:31,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:00:31,261 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-06-27 17:00:31,263 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-06-27 17:00:31,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:00:31,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:00:31,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 56 conjunts are in the unsatisfiable core [2024-06-27 17:00:31,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:31,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 17:00:32,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:00:32,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 104 [2024-06-27 17:00:32,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:00:32,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:00:42,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 943 treesize of output 843 [2024-06-27 17:00:42,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:00:42,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2210 treesize of output 1722 [2024-06-27 17:01:01,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 836 treesize of output 750 [2024-06-27 17:01:01,163 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-06-27 17:01:01,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1610 treesize of output 1236 [2024-06-27 17:01:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:01:04,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136671364] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:01:04,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:01:04,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 37 [2024-06-27 17:01:04,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524063981] [2024-06-27 17:01:04,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:01:04,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-06-27 17:01:04,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:01:04,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-06-27 17:01:04,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1250, Unknown=0, NotChecked=0, Total=1406 [2024-06-27 17:01:04,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 17:01:04,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 897 transitions, 15877 flow. Second operand has 38 states, 38 states have (on average 6.0) internal successors, (228), 38 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:01:04,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:01:04,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 17:01:04,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:01:44,966 INFO L124 PetriNetUnfolderBase]: 11626/17231 cut-off events. [2024-06-27 17:01:44,967 INFO L125 PetriNetUnfolderBase]: For 281996/281996 co-relation queries the response was YES. [2024-06-27 17:01:45,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137870 conditions, 17231 events. 11626/17231 cut-off events. For 281996/281996 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 104843 event pairs, 509 based on Foata normal form. 1/17232 useless extension candidates. Maximal degree in co-relation 136942. Up to 11968 conditions per place. [2024-06-27 17:01:45,228 INFO L140 encePairwiseOnDemand]: 13/29 looper letters, 1153 selfloop transitions, 728 changer transitions 2/1884 dead transitions. [2024-06-27 17:01:45,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 1884 transitions, 34626 flow [2024-06-27 17:01:45,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-06-27 17:01:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2024-06-27 17:01:45,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 694 transitions. [2024-06-27 17:01:45,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40561075394506135 [2024-06-27 17:01:45,232 INFO L175 Difference]: Start difference. First operand has 306 places, 897 transitions, 15877 flow. Second operand 59 states and 694 transitions. [2024-06-27 17:01:45,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 1884 transitions, 34626 flow [2024-06-27 17:01:47,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 1884 transitions, 33916 flow, removed 187 selfloop flow, removed 12 redundant places. [2024-06-27 17:01:47,190 INFO L231 Difference]: Finished difference. Result has 390 places, 1442 transitions, 29092 flow [2024-06-27 17:01:47,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=15408, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=897, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=249, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=29092, PETRI_PLACES=390, PETRI_TRANSITIONS=1442} [2024-06-27 17:01:47,191 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 359 predicate places. [2024-06-27 17:01:47,191 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 1442 transitions, 29092 flow [2024-06-27 17:01:47,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.0) internal successors, (228), 38 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:01:47,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:01:47,192 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:01:47,206 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-06-27 17:01:47,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-06-27 17:01:47,397 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:01:47,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:01:47,397 INFO L85 PathProgramCache]: Analyzing trace with hash 668047400, now seen corresponding path program 18 times [2024-06-27 17:01:47,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:01:47,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424463322] [2024-06-27 17:01:47,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:01:47,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:01:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:01:47,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:01:47,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:01:47,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424463322] [2024-06-27 17:01:47,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424463322] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:01:47,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088170701] [2024-06-27 17:01:47,469 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 17:01:47,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:01:47,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:01:47,470 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-06-27 17:01:47,471 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-06-27 17:01:47,569 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-06-27 17:01:47,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:01:47,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 17:01:47,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:01:47,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:01:47,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:01:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:01:47,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088170701] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:01:47,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:01:47,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-06-27 17:01:47,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145469378] [2024-06-27 17:01:47,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:01:47,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-27 17:01:47,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:01:47,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-27 17:01:47,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-06-27 17:01:47,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 17:01:47,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 1442 transitions, 29092 flow. Second operand has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 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-06-27 17:01:47,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:01:47,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 17:01:47,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:01:53,088 INFO L124 PetriNetUnfolderBase]: 10127/14958 cut-off events. [2024-06-27 17:01:53,088 INFO L125 PetriNetUnfolderBase]: For 321794/321794 co-relation queries the response was YES. [2024-06-27 17:01:53,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136425 conditions, 14958 events. 10127/14958 cut-off events. For 321794/321794 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 87855 event pairs, 2755 based on Foata normal form. 142/15100 useless extension candidates. Maximal degree in co-relation 136304. Up to 12741 conditions per place. [2024-06-27 17:01:53,291 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 1240 selfloop transitions, 3 changer transitions 163/1407 dead transitions. [2024-06-27 17:01:53,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 1407 transitions, 31429 flow [2024-06-27 17:01:53,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:01:53,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:01:53,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-27 17:01:53,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482758620689655 [2024-06-27 17:01:53,293 INFO L175 Difference]: Start difference. First operand has 390 places, 1442 transitions, 29092 flow. Second operand 7 states and 91 transitions. [2024-06-27 17:01:53,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 1407 transitions, 31429 flow [2024-06-27 17:01:55,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 1407 transitions, 28632 flow, removed 1077 selfloop flow, removed 11 redundant places. [2024-06-27 17:01:55,662 INFO L231 Difference]: Finished difference. Result has 377 places, 1244 transitions, 24031 flow [2024-06-27 17:01:55,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=25570, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=24031, PETRI_PLACES=377, PETRI_TRANSITIONS=1244} [2024-06-27 17:01:55,664 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 346 predicate places. [2024-06-27 17:01:55,664 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 1244 transitions, 24031 flow [2024-06-27 17:01:55,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 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-06-27 17:01:55,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:01:55,665 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:01:55,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-06-27 17:01:55,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-06-27 17:01:55,876 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:01:55,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:01:55,877 INFO L85 PathProgramCache]: Analyzing trace with hash -184205337, now seen corresponding path program 3 times [2024-06-27 17:01:55,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:01:55,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958890571] [2024-06-27 17:01:55,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:01:55,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:01:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:01:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:01:57,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:01:57,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958890571] [2024-06-27 17:01:57,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958890571] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:01:57,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556500692] [2024-06-27 17:01:57,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:01:57,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:01:57,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:01:57,896 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:01:57,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-06-27 17:01:57,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-06-27 17:01:57,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:01:57,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 56 conjunts are in the unsatisfiable core [2024-06-27 17:01:57,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:01:58,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 17:01:58,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:01:58,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 104 [2024-06-27 17:01:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:01:59,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:02:10,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 980 treesize of output 876 [2024-06-27 17:02:10,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:02:10,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2258 treesize of output 1766 [2024-06-27 17:02:17,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 873 treesize of output 783 [2024-06-27 17:02:17,579 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-06-27 17:02:17,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1754 treesize of output 1357 [2024-06-27 17:02:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:02:20,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556500692] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:02:20,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:02:20,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 37 [2024-06-27 17:02:20,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674874276] [2024-06-27 17:02:20,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:02:20,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-06-27 17:02:20,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:02:20,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-06-27 17:02:20,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1250, Unknown=0, NotChecked=0, Total=1406 [2024-06-27 17:02:20,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 17:02:20,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 1244 transitions, 24031 flow. Second operand has 38 states, 38 states have (on average 6.0) internal successors, (228), 38 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:02:20,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:02:20,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 17:02:20,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:04:34,470 INFO L124 PetriNetUnfolderBase]: 12123/18008 cut-off events. [2024-06-27 17:04:34,470 INFO L125 PetriNetUnfolderBase]: For 373733/373733 co-relation queries the response was YES. [2024-06-27 17:04:34,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159494 conditions, 18008 events. 12123/18008 cut-off events. For 373733/373733 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 111961 event pairs, 560 based on Foata normal form. 3/18011 useless extension candidates. Maximal degree in co-relation 159376. Up to 10895 conditions per place. [2024-06-27 17:04:34,822 INFO L140 encePairwiseOnDemand]: 13/29 looper letters, 1466 selfloop transitions, 1147 changer transitions 3/2617 dead transitions. [2024-06-27 17:04:34,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 2617 transitions, 52911 flow [2024-06-27 17:04:34,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2024-06-27 17:04:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2024-06-27 17:04:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 1216 transitions. [2024-06-27 17:04:34,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.361474435196195 [2024-06-27 17:04:34,825 INFO L175 Difference]: Start difference. First operand has 377 places, 1244 transitions, 24031 flow. Second operand 116 states and 1216 transitions. [2024-06-27 17:04:34,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 2617 transitions, 52911 flow [2024-06-27 17:04:38,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 2617 transitions, 50749 flow, removed 956 selfloop flow, removed 17 redundant places. [2024-06-27 17:04:38,208 INFO L231 Difference]: Finished difference. Result has 471 places, 1948 transitions, 42340 flow [2024-06-27 17:04:38,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=23209, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=532, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=116, PETRI_FLOW=42340, PETRI_PLACES=471, PETRI_TRANSITIONS=1948} [2024-06-27 17:04:38,210 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 440 predicate places. [2024-06-27 17:04:38,210 INFO L495 AbstractCegarLoop]: Abstraction has has 471 places, 1948 transitions, 42340 flow [2024-06-27 17:04:38,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.0) internal successors, (228), 38 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:04:38,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:04:38,210 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:04:38,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-06-27 17:04:38,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:04:38,422 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:04:38,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:04:38,423 INFO L85 PathProgramCache]: Analyzing trace with hash -608111395, now seen corresponding path program 4 times [2024-06-27 17:04:38,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:04:38,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483935592] [2024-06-27 17:04:38,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:04:38,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:04:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:04:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:04:39,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:04:39,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483935592] [2024-06-27 17:04:39,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483935592] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:04:39,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325927230] [2024-06-27 17:04:39,998 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:04:39,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:04:39,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:04:39,999 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:04:40,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-06-27 17:04:40,124 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:04:40,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:04:40,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 54 conjunts are in the unsatisfiable core [2024-06-27 17:04:40,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:04:40,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-06-27 17:04:40,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:04:40,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 188 treesize of output 104 [2024-06-27 17:04:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:04:41,327 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:04:54,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 849 treesize of output 761 [2024-06-27 17:04:54,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:04:54,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1709 treesize of output 1313 [2024-06-27 17:05:25,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 913 treesize of output 817 [2024-06-27 17:05:25,753 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-06-27 17:05:25,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2043 treesize of output 1592 [2024-06-27 17:05:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:05:38,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325927230] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:05:38,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:05:38,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 39 [2024-06-27 17:05:38,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216609373] [2024-06-27 17:05:38,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:05:38,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-06-27 17:05:38,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:05:38,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-06-27 17:05:38,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1398, Unknown=0, NotChecked=0, Total=1560 [2024-06-27 17:05:38,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 17:05:38,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 1948 transitions, 42340 flow. Second operand has 40 states, 40 states have (on average 5.95) internal successors, (238), 40 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:05:38,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:05:38,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 17:05:38,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:06:06,778 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-06-27 17:06:06,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-06-27 17:06:06,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-06-27 17:06:06,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-06-27 17:06:06,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:06:06,980 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:950) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfoldingHelper(PetriNetUnfolderBase.java:226) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfolding(PetriNetUnfolderBase.java:183) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.(PetriNetUnfolderBase.java:123) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:72) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 63 more [2024-06-27 17:06:06,984 INFO L158 Benchmark]: Toolchain (without parser) took 434948.02ms. Allocated memory was 136.3MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 109.4MB in the beginning and 898.6MB in the end (delta: -789.2MB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2024-06-27 17:06:06,985 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:06:06,985 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.91ms. Allocated memory is still 136.3MB. Free memory was 109.4MB in the beginning and 96.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-06-27 17:06:06,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.51ms. Allocated memory is still 136.3MB. Free memory was 96.3MB in the beginning and 93.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:06:06,985 INFO L158 Benchmark]: Boogie Preprocessor took 40.33ms. Allocated memory is still 136.3MB. Free memory was 93.6MB in the beginning and 91.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:06:06,985 INFO L158 Benchmark]: RCFGBuilder took 749.88ms. Allocated memory is still 136.3MB. Free memory was 90.6MB in the beginning and 75.5MB in the end (delta: 15.1MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2024-06-27 17:06:06,985 INFO L158 Benchmark]: TraceAbstraction took 433833.36ms. Allocated memory was 136.3MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 74.9MB in the beginning and 898.6MB in the end (delta: -823.7MB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2024-06-27 17:06:06,986 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.91ms. Allocated memory is still 136.3MB. Free memory was 109.4MB in the beginning and 96.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.51ms. Allocated memory is still 136.3MB. Free memory was 96.3MB in the beginning and 93.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.33ms. Allocated memory is still 136.3MB. Free memory was 93.6MB in the beginning and 91.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 749.88ms. Allocated memory is still 136.3MB. Free memory was 90.6MB in the beginning and 75.5MB in the end (delta: 15.1MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * TraceAbstraction took 433833.36ms. Allocated memory was 136.3MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 74.9MB in the beginning and 898.6MB in the end (delta: -823.7MB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-mts.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:06:08,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:06:09,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-06-27 17:06:09,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:06:09,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:06:09,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:06:09,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:06:09,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:06:09,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:06:09,096 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:06:09,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:06:09,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:06:09,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:06:09,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:06:09,098 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:06:09,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:06:09,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:06:09,099 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:06:09,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:06:09,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:06:09,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:06:09,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:06:09,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:06:09,101 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-06-27 17:06:09,101 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-06-27 17:06:09,101 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:06:09,101 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-06-27 17:06:09,102 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:06:09,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:06:09,102 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:06:09,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:06:09,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:06:09,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:06:09,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:06:09,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:06:09,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:06:09,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:06:09,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:06:09,105 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-06-27 17:06:09,105 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-06-27 17:06:09,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:06:09,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:06:09,106 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:06:09,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:06:09,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:06:09,107 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-06-27 17:06:09,107 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 -> cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e [2024-06-27 17:06:09,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:06:09,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:06:09,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:06:09,381 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:06:09,382 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:06:09,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2024-06-27 17:06:10,574 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:06:10,759 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:06:10,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2024-06-27 17:06:10,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c844fae/586c6e1b8d084a35912c2e7bb3da3971/FLAGea7d3e96c [2024-06-27 17:06:10,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c844fae/586c6e1b8d084a35912c2e7bb3da3971 [2024-06-27 17:06:10,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:06:10,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:06:10,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:06:10,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:06:10,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:06:10,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:06:10" (1/1) ... [2024-06-27 17:06:10,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@595b4832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:06:10, skipping insertion in model container [2024-06-27 17:06:10,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:06:10" (1/1) ... [2024-06-27 17:06:10,815 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:06:11,019 WARN L247 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-mts.wvr.c[2572,2585] [2024-06-27 17:06:11,041 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:06:11,054 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-06-27 17:06:11,060 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:06:11,085 WARN L247 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-mts.wvr.c[2572,2585] [2024-06-27 17:06:11,094 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:06:11,098 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:06:11,128 WARN L247 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-mts.wvr.c[2572,2585] [2024-06-27 17:06:11,134 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:06:11,151 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:06:11,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:06:11 WrapperNode [2024-06-27 17:06:11,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:06:11,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:06:11,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:06:11,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:06:11,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:06:11" (1/1) ... [2024-06-27 17:06:11,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:06:11" (1/1) ... [2024-06-27 17:06:11,202 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 13, calls inlined = 19, statements flattened = 209 [2024-06-27 17:06:11,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:06:11,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:06:11,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:06:11,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:06:11,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:06:11" (1/1) ... [2024-06-27 17:06:11,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:06:11" (1/1) ... [2024-06-27 17:06:11,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:06:11" (1/1) ... [2024-06-27 17:06:11,246 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-06-27 17:06:11,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:06:11" (1/1) ... [2024-06-27 17:06:11,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:06:11" (1/1) ... [2024-06-27 17:06:11,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:06:11" (1/1) ... [2024-06-27 17:06:11,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:06:11" (1/1) ... [2024-06-27 17:06:11,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:06:11" (1/1) ... [2024-06-27 17:06:11,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:06:11" (1/1) ... [2024-06-27 17:06:11,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:06:11,284 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:06:11,284 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:06:11,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:06:11,285 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:06:11" (1/1) ... [2024-06-27 17:06:11,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:06:11,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:06:11,315 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-06-27 17:06:11,319 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-06-27 17:06:11,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:06:11,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-06-27 17:06:11,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-06-27 17:06:11,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-06-27 17:06:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-06-27 17:06:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 17:06:11,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 17:06:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 17:06:11,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 17:06:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 17:06:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 17:06:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:06:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:06:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 17:06:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:06:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:06:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-06-27 17:06:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-06-27 17:06:11,356 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:06:11,460 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:06:11,462 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:06:11,892 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:06:11,893 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:06:12,211 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:06:12,211 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-27 17:06:12,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:06:12 BoogieIcfgContainer [2024-06-27 17:06:12,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:06:12,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:06:12,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:06:12,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:06:12,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:06:10" (1/3) ... [2024-06-27 17:06:12,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e1b52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:06:12, skipping insertion in model container [2024-06-27 17:06:12,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:06:11" (2/3) ... [2024-06-27 17:06:12,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e1b52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:06:12, skipping insertion in model container [2024-06-27 17:06:12,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:06:12" (3/3) ... [2024-06-27 17:06:12,219 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2024-06-27 17:06:12,226 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:06:12,232 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:06:12,233 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 17:06:12,233 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:06:12,276 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-06-27 17:06:12,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 79 flow [2024-06-27 17:06:12,314 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-06-27 17:06:12,314 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 17:06:12,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2024-06-27 17:06:12,316 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 29 transitions, 79 flow [2024-06-27 17:06:12,318 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 25 transitions, 68 flow [2024-06-27 17:06:12,325 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:06:12,330 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d43dfb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:06:12,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 17:06:12,336 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:06:12,337 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2024-06-27 17:06:12,337 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 17:06:12,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:06:12,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:06:12,338 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:06:12,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:06:12,341 INFO L85 PathProgramCache]: Analyzing trace with hash 187391920, now seen corresponding path program 1 times [2024-06-27 17:06:12,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:06:12,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252776120] [2024-06-27 17:06:12,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:06:12,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:06:12,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:06:12,355 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:06:12,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-06-27 17:06:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:06:12,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:06:12,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:06:12,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:06:12,674 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:06:12,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:06:12,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252776120] [2024-06-27 17:06:12,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252776120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:06:12,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:06:12,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:06:12,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704452149] [2024-06-27 17:06:12,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:06:12,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:06:12,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:06:12,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:06:12,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:06:12,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-27 17:06:12,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:06:12,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:06:12,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-27 17:06:12,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:06:12,883 INFO L124 PetriNetUnfolderBase]: 439/652 cut-off events. [2024-06-27 17:06:12,884 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-06-27 17:06:12,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 652 events. 439/652 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2239 event pairs, 124 based on Foata normal form. 1/524 useless extension candidates. Maximal degree in co-relation 1167. Up to 423 conditions per place. [2024-06-27 17:06:12,891 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 35 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2024-06-27 17:06:12,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 42 transitions, 197 flow [2024-06-27 17:06:12,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:06:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:06:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-06-27 17:06:12,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6436781609195402 [2024-06-27 17:06:12,902 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 68 flow. Second operand 3 states and 56 transitions. [2024-06-27 17:06:12,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 42 transitions, 197 flow [2024-06-27 17:06:12,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 42 transitions, 175 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 17:06:12,907 INFO L231 Difference]: Finished difference. Result has 28 places, 28 transitions, 82 flow [2024-06-27 17:06:12,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=28, PETRI_TRANSITIONS=28} [2024-06-27 17:06:12,910 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2024-06-27 17:06:12,911 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 28 transitions, 82 flow [2024-06-27 17:06:12,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:06:12,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:06:12,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:06:12,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-06-27 17:06:13,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:06:13,114 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:06:13,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:06:13,115 INFO L85 PathProgramCache]: Analyzing trace with hash -110400218, now seen corresponding path program 1 times [2024-06-27 17:06:13,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:06:13,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190466437] [2024-06-27 17:06:13,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:06:13,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:06:13,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:06:13,117 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:06:13,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-06-27 17:06:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:06:13,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-27 17:06:13,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:06:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:06:13,285 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:06:13,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:06:13,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190466437] [2024-06-27 17:06:13,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190466437] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:06:13,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:06:13,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:06:13,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279993574] [2024-06-27 17:06:13,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:06:13,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:06:13,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:06:13,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:06:13,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:06:13,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-27 17:06:13,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 28 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:06:13,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:06:13,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-27 17:06:13,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:06:13,435 INFO L124 PetriNetUnfolderBase]: 422/626 cut-off events. [2024-06-27 17:06:13,435 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-06-27 17:06:13,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 626 events. 422/626 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2152 event pairs, 177 based on Foata normal form. 52/666 useless extension candidates. Maximal degree in co-relation 604. Up to 434 conditions per place. [2024-06-27 17:06:13,446 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 36 selfloop transitions, 5 changer transitions 0/43 dead transitions. [2024-06-27 17:06:13,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 43 transitions, 208 flow [2024-06-27 17:06:13,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:06:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:06:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2024-06-27 17:06:13,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42758620689655175 [2024-06-27 17:06:13,448 INFO L175 Difference]: Start difference. First operand has 28 places, 28 transitions, 82 flow. Second operand 5 states and 62 transitions. [2024-06-27 17:06:13,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 43 transitions, 208 flow [2024-06-27 17:06:13,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 200 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:06:13,450 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 97 flow [2024-06-27 17:06:13,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2024-06-27 17:06:13,451 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-27 17:06:13,451 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 97 flow [2024-06-27 17:06:13,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:06:13,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:06:13,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:06:13,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-06-27 17:06:13,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:06:13,655 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:06:13,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:06:13,655 INFO L85 PathProgramCache]: Analyzing trace with hash 613807249, now seen corresponding path program 1 times [2024-06-27 17:06:13,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:06:13,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743336759] [2024-06-27 17:06:13,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:06:13,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:06:13,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:06:13,657 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:06:13,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-06-27 17:06:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:06:13,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 17:06:13,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:06:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:06:13,756 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:06:13,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:06:13,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743336759] [2024-06-27 17:06:13,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743336759] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:06:13,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:06:13,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:06:13,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103045318] [2024-06-27 17:06:13,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:06:13,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:06:13,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:06:13,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:06:13,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:06:13,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-27 17:06:13,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-06-27 17:06:13,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:06:13,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-27 17:06:13,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:06:13,879 INFO L124 PetriNetUnfolderBase]: 422/632 cut-off events. [2024-06-27 17:06:13,879 INFO L125 PetriNetUnfolderBase]: For 496/496 co-relation queries the response was YES. [2024-06-27 17:06:13,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 632 events. 422/632 cut-off events. For 496/496 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2095 event pairs, 275 based on Foata normal form. 1/617 useless extension candidates. Maximal degree in co-relation 643. Up to 611 conditions per place. [2024-06-27 17:06:13,882 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 26 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2024-06-27 17:06:13,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 155 flow [2024-06-27 17:06:13,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:06:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:06:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2024-06-27 17:06:13,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45977011494252873 [2024-06-27 17:06:13,884 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 97 flow. Second operand 3 states and 40 transitions. [2024-06-27 17:06:13,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 155 flow [2024-06-27 17:06:13,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 144 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 17:06:13,885 INFO L231 Difference]: Finished difference. Result has 32 places, 30 transitions, 98 flow [2024-06-27 17:06:13,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=32, PETRI_TRANSITIONS=30} [2024-06-27 17:06:13,886 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-27 17:06:13,886 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 30 transitions, 98 flow [2024-06-27 17:06:13,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-06-27 17:06:13,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:06:13,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:06:13,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-06-27 17:06:14,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:06:14,092 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:06:14,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:06:14,093 INFO L85 PathProgramCache]: Analyzing trace with hash -575371510, now seen corresponding path program 1 times [2024-06-27 17:06:14,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:06:14,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066241745] [2024-06-27 17:06:14,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:06:14,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:06:14,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:06:14,101 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:06:14,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-06-27 17:06:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:06:14,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-27 17:06:14,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:06:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:06:14,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:06:14,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:06:14,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:06:14,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066241745] [2024-06-27 17:06:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066241745] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:06:14,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 17:06:14,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-06-27 17:06:14,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611604962] [2024-06-27 17:06:14,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:06:14,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:06:14,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:06:14,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:06:14,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 17:06:14,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 17:06:14,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:06:14,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:06:14,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 17:06:14,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:06:14,554 INFO L124 PetriNetUnfolderBase]: 546/788 cut-off events. [2024-06-27 17:06:14,555 INFO L125 PetriNetUnfolderBase]: For 343/343 co-relation queries the response was YES. [2024-06-27 17:06:14,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1982 conditions, 788 events. 546/788 cut-off events. For 343/343 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2428 event pairs, 177 based on Foata normal form. 0/759 useless extension candidates. Maximal degree in co-relation 1968. Up to 393 conditions per place. [2024-06-27 17:06:14,558 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 38 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2024-06-27 17:06:14,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 43 transitions, 226 flow [2024-06-27 17:06:14,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:06:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:06:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2024-06-27 17:06:14,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4396551724137931 [2024-06-27 17:06:14,560 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 98 flow. Second operand 4 states and 51 transitions. [2024-06-27 17:06:14,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 43 transitions, 226 flow [2024-06-27 17:06:14,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 222 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:06:14,561 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 115 flow [2024-06-27 17:06:14,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2024-06-27 17:06:14,562 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2024-06-27 17:06:14,562 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 115 flow [2024-06-27 17:06:14,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:06:14,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:06:14,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:06:14,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-06-27 17:06:14,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:06:14,766 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:06:14,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:06:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2123195997, now seen corresponding path program 1 times [2024-06-27 17:06:14,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:06:14,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206281623] [2024-06-27 17:06:14,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:06:14,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:06:14,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:06:14,769 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:06:14,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-06-27 17:06:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:06:14,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjunts are in the unsatisfiable core [2024-06-27 17:06:14,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:06:15,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:06:15,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:06:15,613 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 17:06:15,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:06:15,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:06:15,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:06:15,618 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 17:06:15,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:06:15,621 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 17:06:15,622 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 17:06:15,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:06:15,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 246 treesize of output 90 [2024-06-27 17:06:15,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:06:15,927 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:06:16,943 INFO L349 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2024-06-27 17:06:16,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 675 treesize of output 233 [2024-06-27 17:06:36,963 WARN L293 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 569 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 17:07:15,669 WARN L293 SmtUtils]: Spent 6.98s on a formula simplification that was a NOOP. DAG size: 567 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 17:07:49,048 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 581 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 17:08:23,728 WARN L293 SmtUtils]: Spent 14.46s on a formula simplification that was a NOOP. DAG size: 585 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 17:08:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:08:23,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:08:23,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206281623] [2024-06-27 17:08:23,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206281623] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:08:23,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:08:23,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2024-06-27 17:08:23,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302113496] [2024-06-27 17:08:23,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:08:23,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-27 17:08:23,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:08:23,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-27 17:08:23,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=212, Unknown=5, NotChecked=0, Total=272 [2024-06-27 17:08:27,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:08:27,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-27 17:08:27,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 115 flow. Second operand has 17 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:08:27,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:08:27,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-27 17:08:27,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:08:44,806 WARN L293 SmtUtils]: Spent 12.15s on a formula simplification. DAG size of input: 598 DAG size of output: 250 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 17:08:49,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:09:05,811 WARN L293 SmtUtils]: Spent 12.47s on a formula simplification. DAG size of input: 596 DAG size of output: 247 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 17:09:07,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:09:11,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:09:12,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:09:13,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:09:15,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:09:17,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:09:18,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:09:24,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:09:25,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:09:28,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:09:33,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:09:36,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:09:38,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:09:39,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:09:41,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:09:47,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:09:49,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:09:51,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:09:55,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:09:57,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:10:03,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:10:06,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:10:09,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:10:10,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:10:12,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:10:14,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:10:15,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:10:20,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:10:31,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:10:38,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:10:41,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:10:43,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:10:45,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:10:47,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:10:48,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:10:52,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:10:54,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:10:57,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:10:58,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:11:02,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:11:04,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:11:08,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:11:13,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:11:15,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:11:19,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:11:20,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:11:23,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:11:26,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:11:29,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:11:32,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:11:33,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:11:34,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:11:38,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:11:39,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:11:42,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:11:45,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:11:47,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:11:53,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:11:57,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:12:00,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:12:02,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:12:04,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:12:06,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:12:08,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:12:12,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:12:16,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:12:18,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:12:22,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:12:24,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:12:24,495 INFO L124 PetriNetUnfolderBase]: 1026/1483 cut-off events. [2024-06-27 17:12:24,496 INFO L125 PetriNetUnfolderBase]: For 744/744 co-relation queries the response was YES. [2024-06-27 17:12:24,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4184 conditions, 1483 events. 1026/1483 cut-off events. For 744/744 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5600 event pairs, 85 based on Foata normal form. 1/1484 useless extension candidates. Maximal degree in co-relation 3689. Up to 838 conditions per place. [2024-06-27 17:12:24,508 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 78 selfloop transitions, 23 changer transitions 1/103 dead transitions. [2024-06-27 17:12:24,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 103 transitions, 566 flow [2024-06-27 17:12:24,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:12:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:12:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2024-06-27 17:12:24,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095785440613027 [2024-06-27 17:12:24,573 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 115 flow. Second operand 9 states and 133 transitions. [2024-06-27 17:12:24,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 103 transitions, 566 flow [2024-06-27 17:12:24,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 103 transitions, 555 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:12:24,577 INFO L231 Difference]: Finished difference. Result has 46 places, 49 transitions, 274 flow [2024-06-27 17:12:24,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=274, PETRI_PLACES=46, PETRI_TRANSITIONS=49} [2024-06-27 17:12:24,578 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-27 17:12:24,578 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 49 transitions, 274 flow [2024-06-27 17:12:24,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:12:24,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:12:24,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:12:24,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-06-27 17:12:24,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:12:24,779 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:12:24,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:12:24,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1909666897, now seen corresponding path program 2 times [2024-06-27 17:12:24,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:12:24,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520905141] [2024-06-27 17:12:24,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:12:24,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:12:24,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:12:24,782 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:12:24,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-06-27 17:12:24,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:12:24,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:12:24,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-27 17:12:24,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:12:27,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:12:27,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:12:27,972 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 17:12:27,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:12:27,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:12:27,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:12:28,003 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 17:12:28,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:12:28,016 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 17:12:28,020 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 17:12:28,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:12:28,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 246 treesize of output 90 [2024-06-27 17:12:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:12:28,712 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:12:30,917 INFO L349 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2024-06-27 17:12:30,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 675 treesize of output 233 Killed by 15