./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-ring.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-bad-ring.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 be394a9cdc866c1e1426a3fe296e99873bcf37ee5e7e1c9e487b239a3e0a8fbe --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:47:40,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:47:40,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:47:40,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:47:40,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:47:40,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:47:40,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:47:40,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:47:40,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:47:40,532 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:47:40,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:47:40,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:47:40,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:47:40,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:47:40,533 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:47:40,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:47:40,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:47:40,534 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:47:40,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:47:40,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:47:40,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:47:40,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:47:40,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:47:40,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:47:40,536 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:47:40,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:47:40,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:47:40,537 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:47:40,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:47:40,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:47:40,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:47:40,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:47:40,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:47:40,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:47:40,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:47:40,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:47:40,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:47:40,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:47:40,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:47:40,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:47:40,539 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:47:40,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:47:40,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:47:40,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 -> be394a9cdc866c1e1426a3fe296e99873bcf37ee5e7e1c9e487b239a3e0a8fbe [2024-06-27 16:47:40,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:47:40,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:47:40,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:47:40,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:47:40,723 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:47:40,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2024-06-27 16:47:41,680 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:47:41,854 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:47:41,854 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2024-06-27 16:47:41,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f13060dc/c1a7560f4f824bd8a5d7ce7f8b79e538/FLAG653d869f2 [2024-06-27 16:47:41,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f13060dc/c1a7560f4f824bd8a5d7ce7f8b79e538 [2024-06-27 16:47:41,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:47:41,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:47:41,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:47:41,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:47:41,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:47:41,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:47:41" (1/1) ... [2024-06-27 16:47:41,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@176fc5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:41, skipping insertion in model container [2024-06-27 16:47:41,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:47:41" (1/1) ... [2024-06-27 16:47:41,911 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:47:42,086 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-bad-ring.wvr.c[3986,3999] [2024-06-27 16:47:42,092 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:47:42,098 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:47:42,119 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-bad-ring.wvr.c[3986,3999] [2024-06-27 16:47:42,121 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:47:42,136 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:47:42,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42 WrapperNode [2024-06-27 16:47:42,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:47:42,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:47:42,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:47:42,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:47:42,144 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:47:42" (1/1) ... [2024-06-27 16:47:42,151 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:47:42" (1/1) ... [2024-06-27 16:47:42,176 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 312 [2024-06-27 16:47:42,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:47:42,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:47:42,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:47:42,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:47:42,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,208 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-06-27 16:47:42,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,223 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:47:42,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:47:42,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:47:42,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:47:42,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (1/1) ... [2024-06-27 16:47:42,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:47:42,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:47:42,281 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:47:42,284 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:47:42,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:47:42,314 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:47:42,314 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:47:42,314 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:47:42,314 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:47:42,314 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 16:47:42,314 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 16:47:42,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:47:42,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 16:47:42,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 16:47:42,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 16:47:42,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 16:47:42,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 16:47:42,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 16:47:42,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:47:42,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:47:42,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 16:47:42,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 16:47:42,319 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:47:42,401 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:47:42,403 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:47:42,699 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:47:42,699 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:47:42,960 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:47:42,961 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-06-27 16:47:42,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:47:42 BoogieIcfgContainer [2024-06-27 16:47:42,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:47:42,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:47:42,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:47:42,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:47:42,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:47:41" (1/3) ... [2024-06-27 16:47:42,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532ed2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:47:42, skipping insertion in model container [2024-06-27 16:47:42,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:47:42" (2/3) ... [2024-06-27 16:47:42,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532ed2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:47:42, skipping insertion in model container [2024-06-27 16:47:42,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:47:42" (3/3) ... [2024-06-27 16:47:42,974 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2024-06-27 16:47:42,982 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:47:42,990 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:47:42,990 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:47:42,990 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:47:43,052 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-06-27 16:47:43,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 48 transitions, 117 flow [2024-06-27 16:47:43,120 INFO L124 PetriNetUnfolderBase]: 8/45 cut-off events. [2024-06-27 16:47:43,121 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:47:43,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 8/45 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-06-27 16:47:43,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 48 transitions, 117 flow [2024-06-27 16:47:43,127 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 44 transitions, 106 flow [2024-06-27 16:47:43,139 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:47:43,149 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;@2c9c4d60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:47:43,150 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 16:47:43,166 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:47:43,166 INFO L124 PetriNetUnfolderBase]: 8/43 cut-off events. [2024-06-27 16:47:43,166 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:47:43,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:43,167 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 16:47:43,168 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:47:43,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:43,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1548629740, now seen corresponding path program 1 times [2024-06-27 16:47:43,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:43,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106290684] [2024-06-27 16:47:43,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:43,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:43,420 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:47:43,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:43,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106290684] [2024-06-27 16:47:43,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106290684] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:47:43,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:47:43,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:47:43,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284509418] [2024-06-27 16:47:43,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:47:43,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-06-27 16:47:43,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:47:43,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-06-27 16:47:43,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-06-27 16:47:43,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:47:43,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 106 flow. Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 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:47:43,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:47:43,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:47:43,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:47:43,717 INFO L124 PetriNetUnfolderBase]: 1049/1799 cut-off events. [2024-06-27 16:47:43,717 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-06-27 16:47:43,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3314 conditions, 1799 events. 1049/1799 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9499 event pairs, 858 based on Foata normal form. 165/1779 useless extension candidates. Maximal degree in co-relation 3107. Up to 1394 conditions per place. [2024-06-27 16:47:43,731 INFO L140 encePairwiseOnDemand]: 46/48 looper letters, 32 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2024-06-27 16:47:43,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 42 transitions, 166 flow [2024-06-27 16:47:43,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-06-27 16:47:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-06-27 16:47:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2024-06-27 16:47:43,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-06-27 16:47:43,743 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 106 flow. Second operand 2 states and 60 transitions. [2024-06-27 16:47:43,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 42 transitions, 166 flow [2024-06-27 16:47:43,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 154 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 16:47:43,750 INFO L231 Difference]: Finished difference. Result has 41 places, 42 transitions, 90 flow [2024-06-27 16:47:43,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=41, PETRI_TRANSITIONS=42} [2024-06-27 16:47:43,754 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2024-06-27 16:47:43,755 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 90 flow [2024-06-27 16:47:43,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 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:47:43,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:43,755 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:47:43,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:47:43,756 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:47:43,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:43,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1379772624, now seen corresponding path program 1 times [2024-06-27 16:47:43,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:43,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43260718] [2024-06-27 16:47:43,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:43,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:43,877 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:47:43,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:43,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43260718] [2024-06-27 16:47:43,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43260718] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:47:43,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:47:43,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:47:43,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105771009] [2024-06-27 16:47:43,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:47:43,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:47:43,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:47:43,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:47:43,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:47:43,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:47:43,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:47:43,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:47:43,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:47:43,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:47:44,086 INFO L124 PetriNetUnfolderBase]: 1040/1732 cut-off events. [2024-06-27 16:47:44,088 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-06-27 16:47:44,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3223 conditions, 1732 events. 1040/1732 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8672 event pairs, 266 based on Foata normal form. 33/1662 useless extension candidates. Maximal degree in co-relation 3220. Up to 1251 conditions per place. [2024-06-27 16:47:44,096 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 42 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2024-06-27 16:47:44,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 208 flow [2024-06-27 16:47:44,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:47:44,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:47:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-06-27 16:47:44,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2024-06-27 16:47:44,099 INFO L175 Difference]: Start difference. First operand has 41 places, 42 transitions, 90 flow. Second operand 3 states and 85 transitions. [2024-06-27 16:47:44,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 208 flow [2024-06-27 16:47:44,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 208 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:47:44,102 INFO L231 Difference]: Finished difference. Result has 44 places, 44 transitions, 109 flow [2024-06-27 16:47:44,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=44, PETRI_TRANSITIONS=44} [2024-06-27 16:47:44,103 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2024-06-27 16:47:44,103 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 109 flow [2024-06-27 16:47:44,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:47:44,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:44,104 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:47:44,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:47:44,105 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:47:44,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:44,107 INFO L85 PathProgramCache]: Analyzing trace with hash 58375550, now seen corresponding path program 2 times [2024-06-27 16:47:44,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:44,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422503251] [2024-06-27 16:47:44,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:44,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:44,241 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:47:44,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:44,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422503251] [2024-06-27 16:47:44,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422503251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:47:44,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:47:44,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:47:44,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804310650] [2024-06-27 16:47:44,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:47:44,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:47:44,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:47:44,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:47:44,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:47:44,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:47:44,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:47:44,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:47:44,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:47:44,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:47:44,392 INFO L124 PetriNetUnfolderBase]: 871/1554 cut-off events. [2024-06-27 16:47:44,392 INFO L125 PetriNetUnfolderBase]: For 239/241 co-relation queries the response was YES. [2024-06-27 16:47:44,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3137 conditions, 1554 events. 871/1554 cut-off events. For 239/241 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7971 event pairs, 315 based on Foata normal form. 32/1477 useless extension candidates. Maximal degree in co-relation 3132. Up to 794 conditions per place. [2024-06-27 16:47:44,399 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 45 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2024-06-27 16:47:44,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 237 flow [2024-06-27 16:47:44,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:47:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:47:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-06-27 16:47:44,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2024-06-27 16:47:44,402 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 109 flow. Second operand 3 states and 85 transitions. [2024-06-27 16:47:44,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 237 flow [2024-06-27 16:47:44,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:47:44,404 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 118 flow [2024-06-27 16:47:44,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2024-06-27 16:47:44,405 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2024-06-27 16:47:44,405 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 118 flow [2024-06-27 16:47:44,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:47:44,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:44,406 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:47:44,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 16:47:44,407 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:47:44,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:44,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2118938302, now seen corresponding path program 3 times [2024-06-27 16:47:44,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:44,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514012739] [2024-06-27 16:47:44,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:44,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:44,496 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:47:44,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:44,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514012739] [2024-06-27 16:47:44,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514012739] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:47:44,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:47:44,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:47:44,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805987074] [2024-06-27 16:47:44,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:47:44,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:47:44,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:47:44,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:47:44,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:47:44,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:47:44,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:47:44,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:47:44,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:47:44,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:47:44,690 INFO L124 PetriNetUnfolderBase]: 1319/2209 cut-off events. [2024-06-27 16:47:44,690 INFO L125 PetriNetUnfolderBase]: For 472/500 co-relation queries the response was YES. [2024-06-27 16:47:44,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4910 conditions, 2209 events. 1319/2209 cut-off events. For 472/500 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12431 event pairs, 426 based on Foata normal form. 1/2109 useless extension candidates. Maximal degree in co-relation 4904. Up to 1175 conditions per place. [2024-06-27 16:47:44,700 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 48 selfloop transitions, 2 changer transitions 6/66 dead transitions. [2024-06-27 16:47:44,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 286 flow [2024-06-27 16:47:44,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:47:44,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:47:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-06-27 16:47:44,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2024-06-27 16:47:44,704 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 118 flow. Second operand 3 states and 94 transitions. [2024-06-27 16:47:44,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 286 flow [2024-06-27 16:47:44,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:47:44,707 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 124 flow [2024-06-27 16:47:44,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2024-06-27 16:47:44,708 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2024-06-27 16:47:44,708 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 124 flow [2024-06-27 16:47:44,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:47:44,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:44,709 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:47:44,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 16:47:44,709 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:47:44,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2126932116, now seen corresponding path program 1 times [2024-06-27 16:47:44,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:44,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305764741] [2024-06-27 16:47:44,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:44,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:47:44,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:44,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305764741] [2024-06-27 16:47:44,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305764741] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:47:44,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:47:44,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:47:44,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409414932] [2024-06-27 16:47:44,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:47:44,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:47:44,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:47:44,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:47:44,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:47:44,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:47:44,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:47:44,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:47:44,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:47:44,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:47:44,914 INFO L124 PetriNetUnfolderBase]: 496/826 cut-off events. [2024-06-27 16:47:44,914 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2024-06-27 16:47:44,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1890 conditions, 826 events. 496/826 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3791 event pairs, 190 based on Foata normal form. 44/825 useless extension candidates. Maximal degree in co-relation 1883. Up to 546 conditions per place. [2024-06-27 16:47:44,919 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 39 selfloop transitions, 2 changer transitions 1/52 dead transitions. [2024-06-27 16:47:44,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 228 flow [2024-06-27 16:47:44,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:47:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:47:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-06-27 16:47:44,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-27 16:47:44,921 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 124 flow. Second operand 3 states and 80 transitions. [2024-06-27 16:47:44,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 228 flow [2024-06-27 16:47:44,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 224 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 16:47:44,923 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 132 flow [2024-06-27 16:47:44,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-06-27 16:47:44,928 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2024-06-27 16:47:44,928 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 132 flow [2024-06-27 16:47:44,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:47:44,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:44,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:47:44,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 16:47:44,929 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:47:44,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:44,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1398072178, now seen corresponding path program 2 times [2024-06-27 16:47:44,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:44,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976311623] [2024-06-27 16:47:44,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:44,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:47:45,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:45,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976311623] [2024-06-27 16:47:45,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976311623] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:47:45,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:47:45,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:47:45,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803218809] [2024-06-27 16:47:45,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:47:45,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:47:45,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:47:45,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:47:45,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:47:45,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:47:45,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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:47:45,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:47:45,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:47:45,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:47:45,201 INFO L124 PetriNetUnfolderBase]: 545/932 cut-off events. [2024-06-27 16:47:45,201 INFO L125 PetriNetUnfolderBase]: For 255/255 co-relation queries the response was YES. [2024-06-27 16:47:45,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2184 conditions, 932 events. 545/932 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4388 event pairs, 411 based on Foata normal form. 13/898 useless extension candidates. Maximal degree in co-relation 2176. Up to 745 conditions per place. [2024-06-27 16:47:45,205 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 35 selfloop transitions, 2 changer transitions 15/62 dead transitions. [2024-06-27 16:47:45,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 271 flow [2024-06-27 16:47:45,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:47:45,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:47:45,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2024-06-27 16:47:45,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-27 16:47:45,207 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 132 flow. Second operand 5 states and 114 transitions. [2024-06-27 16:47:45,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 271 flow [2024-06-27 16:47:45,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 62 transitions, 269 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:47:45,209 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 146 flow [2024-06-27 16:47:45,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2024-06-27 16:47:45,211 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2024-06-27 16:47:45,212 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 146 flow [2024-06-27 16:47:45,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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:47:45,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:45,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:47:45,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 16:47:45,212 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:47:45,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:45,213 INFO L85 PathProgramCache]: Analyzing trace with hash 437576286, now seen corresponding path program 1 times [2024-06-27 16:47:45,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:45,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279758053] [2024-06-27 16:47:45,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:45,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:45,364 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:47:45,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:45,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279758053] [2024-06-27 16:47:45,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279758053] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:47:45,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:47:45,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:47:45,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121164902] [2024-06-27 16:47:45,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:47:45,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:47:45,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:47:45,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:47:45,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:47:45,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:47:45,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:47:45,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:47:45,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:47:45,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:47:45,481 INFO L124 PetriNetUnfolderBase]: 570/981 cut-off events. [2024-06-27 16:47:45,482 INFO L125 PetriNetUnfolderBase]: For 322/322 co-relation queries the response was YES. [2024-06-27 16:47:45,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2334 conditions, 981 events. 570/981 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4716 event pairs, 437 based on Foata normal form. 6/941 useless extension candidates. Maximal degree in co-relation 2323. Up to 746 conditions per place. [2024-06-27 16:47:45,486 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 36 selfloop transitions, 2 changer transitions 15/63 dead transitions. [2024-06-27 16:47:45,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 63 transitions, 295 flow [2024-06-27 16:47:45,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:47:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:47:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-06-27 16:47:45,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5260416666666666 [2024-06-27 16:47:45,487 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 146 flow. Second operand 4 states and 101 transitions. [2024-06-27 16:47:45,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 63 transitions, 295 flow [2024-06-27 16:47:45,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 283 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 16:47:45,491 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 152 flow [2024-06-27 16:47:45,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2024-06-27 16:47:45,491 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2024-06-27 16:47:45,491 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 152 flow [2024-06-27 16:47:45,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:47:45,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:45,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:47:45,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 16:47:45,492 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:47:45,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:45,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1816335908, now seen corresponding path program 1 times [2024-06-27 16:47:45,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:45,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79767518] [2024-06-27 16:47:45,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:45,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:47:45,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:45,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79767518] [2024-06-27 16:47:45,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79767518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:47:45,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:47:45,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:47:45,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82288140] [2024-06-27 16:47:45,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:47:45,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:47:45,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:47:45,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:47:45,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:47:45,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:47:45,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:47:45,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:47:45,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:47:45,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:47:45,708 INFO L124 PetriNetUnfolderBase]: 602/1061 cut-off events. [2024-06-27 16:47:45,708 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2024-06-27 16:47:45,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2486 conditions, 1061 events. 602/1061 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5196 event pairs, 462 based on Foata normal form. 6/1012 useless extension candidates. Maximal degree in co-relation 2475. Up to 747 conditions per place. [2024-06-27 16:47:45,713 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 37 selfloop transitions, 2 changer transitions 17/66 dead transitions. [2024-06-27 16:47:45,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 315 flow [2024-06-27 16:47:45,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:47:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:47:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-06-27 16:47:45,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-06-27 16:47:45,714 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 152 flow. Second operand 4 states and 102 transitions. [2024-06-27 16:47:45,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 315 flow [2024-06-27 16:47:45,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 307 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 16:47:45,716 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 160 flow [2024-06-27 16:47:45,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2024-06-27 16:47:45,718 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 12 predicate places. [2024-06-27 16:47:45,718 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 160 flow [2024-06-27 16:47:45,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:47:45,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:45,719 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:47:45,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 16:47:45,719 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:47:45,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:45,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1361437026, now seen corresponding path program 1 times [2024-06-27 16:47:45,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:45,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284504225] [2024-06-27 16:47:45,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:45,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:47:45,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:45,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284504225] [2024-06-27 16:47:45,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284504225] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:47:45,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043291342] [2024-06-27 16:47:45,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:45,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:47:45,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:47:45,980 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:47:46,028 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:47:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:46,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-27 16:47:46,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:47:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:47:46,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:47:46,337 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 12 treesize of output 4 [2024-06-27 16:47:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:47:46,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043291342] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:47:46,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:47:46,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2024-06-27 16:47:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790425663] [2024-06-27 16:47:46,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:47:46,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-06-27 16:47:46,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:47:46,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-06-27 16:47:46,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-06-27 16:47:46,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:47:46,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 160 flow. Second operand has 16 states, 16 states have (on average 18.0) internal successors, (288), 16 states have internal predecessors, (288), 0 states have call successors, (0), 0 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:47:46,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:47:46,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:47:46,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:47:46,838 INFO L124 PetriNetUnfolderBase]: 772/1342 cut-off events. [2024-06-27 16:47:46,838 INFO L125 PetriNetUnfolderBase]: For 387/387 co-relation queries the response was YES. [2024-06-27 16:47:46,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3166 conditions, 1342 events. 772/1342 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6989 event pairs, 380 based on Foata normal form. 36/1307 useless extension candidates. Maximal degree in co-relation 3154. Up to 649 conditions per place. [2024-06-27 16:47:46,843 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 43 selfloop transitions, 4 changer transitions 42/99 dead transitions. [2024-06-27 16:47:46,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 99 transitions, 488 flow [2024-06-27 16:47:46,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 16:47:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 16:47:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 199 transitions. [2024-06-27 16:47:46,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46064814814814814 [2024-06-27 16:47:46,845 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 160 flow. Second operand 9 states and 199 transitions. [2024-06-27 16:47:46,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 99 transitions, 488 flow [2024-06-27 16:47:46,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 99 transitions, 476 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 16:47:46,848 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 180 flow [2024-06-27 16:47:46,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=180, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2024-06-27 16:47:46,849 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2024-06-27 16:47:46,851 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 180 flow [2024-06-27 16:47:46,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 18.0) internal successors, (288), 16 states have internal predecessors, (288), 0 states have call successors, (0), 0 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:47:46,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:46,851 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:47:46,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-27 16:47:47,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:47:47,063 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:47:47,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:47,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1083772964, now seen corresponding path program 2 times [2024-06-27 16:47:47,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:47,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501033042] [2024-06-27 16:47:47,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:47,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:47:47,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:47,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501033042] [2024-06-27 16:47:47,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501033042] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:47:47,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919908501] [2024-06-27 16:47:47,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:47:47,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:47:47,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:47:47,595 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:47:47,616 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:47:47,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:47:47,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:47:47,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 22 conjunts are in the unsatisfiable core [2024-06-27 16:47:47,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:47:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:47:47,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:47:48,072 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2024-06-27 16:47:48,072 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 37 treesize of output 15 [2024-06-27 16:47:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 16:47:48,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919908501] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:47:48,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:47:48,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 21 [2024-06-27 16:47:48,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727039494] [2024-06-27 16:47:48,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:47:48,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-06-27 16:47:48,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:47:48,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-06-27 16:47:48,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2024-06-27 16:47:48,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 16:47:48,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 50 transitions, 180 flow. Second operand has 21 states, 21 states have (on average 15.333333333333334) internal successors, (322), 21 states have internal predecessors, (322), 0 states have call successors, (0), 0 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:47:48,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:47:48,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 16:47:48,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:47:49,086 INFO L124 PetriNetUnfolderBase]: 1780/2882 cut-off events. [2024-06-27 16:47:49,086 INFO L125 PetriNetUnfolderBase]: For 1613/1625 co-relation queries the response was YES. [2024-06-27 16:47:49,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7072 conditions, 2882 events. 1780/2882 cut-off events. For 1613/1625 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 16548 event pairs, 264 based on Foata normal form. 128/2852 useless extension candidates. Maximal degree in co-relation 7057. Up to 952 conditions per place. [2024-06-27 16:47:49,101 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 126 selfloop transitions, 18 changer transitions 22/174 dead transitions. [2024-06-27 16:47:49,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 174 transitions, 902 flow [2024-06-27 16:47:49,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-06-27 16:47:49,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-06-27 16:47:49,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 364 transitions. [2024-06-27 16:47:49,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212962962962963 [2024-06-27 16:47:49,103 INFO L175 Difference]: Start difference. First operand has 67 places, 50 transitions, 180 flow. Second operand 18 states and 364 transitions. [2024-06-27 16:47:49,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 174 transitions, 902 flow [2024-06-27 16:47:49,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 174 transitions, 860 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-27 16:47:49,109 INFO L231 Difference]: Finished difference. Result has 81 places, 63 transitions, 295 flow [2024-06-27 16:47:49,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=295, PETRI_PLACES=81, PETRI_TRANSITIONS=63} [2024-06-27 16:47:49,110 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places. [2024-06-27 16:47:49,110 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 295 flow [2024-06-27 16:47:49,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 15.333333333333334) internal successors, (322), 21 states have internal predecessors, (322), 0 states have call successors, (0), 0 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:47:49,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:49,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:47:49,126 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:47:49,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-06-27 16:47:49,324 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:47:49,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:49,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1579971170, now seen corresponding path program 3 times [2024-06-27 16:47:49,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:49,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878373254] [2024-06-27 16:47:49,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:49,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:47:49,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:49,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878373254] [2024-06-27 16:47:49,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878373254] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:47:49,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014360686] [2024-06-27 16:47:49,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:47:49,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:47:49,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:47:49,837 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:47:49,864 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:47:49,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 16:47:49,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:47:49,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 19 conjunts are in the unsatisfiable core [2024-06-27 16:47:49,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:47:50,366 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2024-06-27 16:47:50,366 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 34 treesize of output 13 [2024-06-27 16:47:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:47:50,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:47:50,545 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2024-06-27 16:47:50,545 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 36 treesize of output 15 [2024-06-27 16:47:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:47:50,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014360686] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:47:50,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:47:50,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-06-27 16:47:50,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034085323] [2024-06-27 16:47:50,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:47:50,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-06-27 16:47:50,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:47:50,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-06-27 16:47:50,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2024-06-27 16:47:50,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 16:47:50,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 63 transitions, 295 flow. Second operand has 25 states, 25 states have (on average 14.56) internal successors, (364), 25 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:47:50,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:47:50,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 16:47:50,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:47:52,053 INFO L124 PetriNetUnfolderBase]: 1672/2745 cut-off events. [2024-06-27 16:47:52,053 INFO L125 PetriNetUnfolderBase]: For 3211/3211 co-relation queries the response was YES. [2024-06-27 16:47:52,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7563 conditions, 2745 events. 1672/2745 cut-off events. For 3211/3211 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 15076 event pairs, 118 based on Foata normal form. 30/2758 useless extension candidates. Maximal degree in co-relation 7545. Up to 850 conditions per place. [2024-06-27 16:47:52,068 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 172 selfloop transitions, 28 changer transitions 3/211 dead transitions. [2024-06-27 16:47:52,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 211 transitions, 1175 flow [2024-06-27 16:47:52,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-06-27 16:47:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-06-27 16:47:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 433 transitions. [2024-06-27 16:47:52,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4100378787878788 [2024-06-27 16:47:52,071 INFO L175 Difference]: Start difference. First operand has 81 places, 63 transitions, 295 flow. Second operand 22 states and 433 transitions. [2024-06-27 16:47:52,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 211 transitions, 1175 flow [2024-06-27 16:47:52,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 211 transitions, 1118 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-27 16:47:52,079 INFO L231 Difference]: Finished difference. Result has 97 places, 73 transitions, 383 flow [2024-06-27 16:47:52,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=383, PETRI_PLACES=97, PETRI_TRANSITIONS=73} [2024-06-27 16:47:52,079 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 51 predicate places. [2024-06-27 16:47:52,080 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 73 transitions, 383 flow [2024-06-27 16:47:52,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 14.56) internal successors, (364), 25 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:47:52,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:52,080 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:47:52,092 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:47:52,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:47:52,292 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:47:52,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:52,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2114155272, now seen corresponding path program 4 times [2024-06-27 16:47:52,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:52,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131362607] [2024-06-27 16:47:52,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:52,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 16:47:52,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:52,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131362607] [2024-06-27 16:47:52,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131362607] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:47:52,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764458738] [2024-06-27 16:47:52,431 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 16:47:52,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:47:52,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:47:52,432 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:47:52,453 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:47:52,560 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 16:47:52,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:47:52,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 19 conjunts are in the unsatisfiable core [2024-06-27 16:47:52,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:47:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:47:52,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:47:53,214 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2024-06-27 16:47:53,215 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 36 treesize of output 15 [2024-06-27 16:47:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:47:53,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764458738] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:47:53,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:47:53,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 23 [2024-06-27 16:47:53,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196597669] [2024-06-27 16:47:53,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:47:53,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-06-27 16:47:53,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:47:53,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-06-27 16:47:53,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-06-27 16:47:53,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 16:47:53,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 73 transitions, 383 flow. Second operand has 23 states, 23 states have (on average 14.869565217391305) internal successors, (342), 23 states have internal predecessors, (342), 0 states have call successors, (0), 0 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:47:53,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:47:53,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 16:47:53,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:47:55,587 INFO L124 PetriNetUnfolderBase]: 6006/9817 cut-off events. [2024-06-27 16:47:55,587 INFO L125 PetriNetUnfolderBase]: For 13689/13709 co-relation queries the response was YES. [2024-06-27 16:47:55,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28322 conditions, 9817 events. 6006/9817 cut-off events. For 13689/13709 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 68888 event pairs, 1490 based on Foata normal form. 144/9799 useless extension candidates. Maximal degree in co-relation 28303. Up to 1294 conditions per place. [2024-06-27 16:47:55,648 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 305 selfloop transitions, 59 changer transitions 67/439 dead transitions. [2024-06-27 16:47:55,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 439 transitions, 2868 flow [2024-06-27 16:47:55,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-06-27 16:47:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2024-06-27 16:47:55,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 765 transitions. [2024-06-27 16:47:55,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43074324324324326 [2024-06-27 16:47:55,652 INFO L175 Difference]: Start difference. First operand has 97 places, 73 transitions, 383 flow. Second operand 37 states and 765 transitions. [2024-06-27 16:47:55,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 439 transitions, 2868 flow [2024-06-27 16:47:55,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 439 transitions, 2731 flow, removed 37 selfloop flow, removed 13 redundant places. [2024-06-27 16:47:55,682 INFO L231 Difference]: Finished difference. Result has 146 places, 124 transitions, 1023 flow [2024-06-27 16:47:55,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1023, PETRI_PLACES=146, PETRI_TRANSITIONS=124} [2024-06-27 16:47:55,683 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 100 predicate places. [2024-06-27 16:47:55,683 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 124 transitions, 1023 flow [2024-06-27 16:47:55,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.869565217391305) internal successors, (342), 23 states have internal predecessors, (342), 0 states have call successors, (0), 0 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:47:55,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:55,683 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:47:55,695 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:47:55,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:47:55,895 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 16:47:55,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:55,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1254641800, now seen corresponding path program 1 times [2024-06-27 16:47:55,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:55,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583872781] [2024-06-27 16:47:55,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:55,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 16:47:56,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:56,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583872781] [2024-06-27 16:47:56,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583872781] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:47:56,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474119001] [2024-06-27 16:47:56,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:56,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:47:56,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:47:56,197 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:47:56,220 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:47:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:56,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-27 16:47:56,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:47:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 16:47:56,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:47:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 16:47:56,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474119001] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:47:56,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:47:56,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-06-27 16:47:56,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538420082] [2024-06-27 16:47:56,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:47:56,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-06-27 16:47:56,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:47:56,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-06-27 16:47:56,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-06-27 16:47:56,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:47:56,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 124 transitions, 1023 flow. Second operand has 18 states, 18 states have (on average 17.88888888888889) internal successors, (322), 18 states have internal predecessors, (322), 0 states have call successors, (0), 0 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:47:56,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:47:56,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:47:56,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:47:58,059 INFO L124 PetriNetUnfolderBase]: 6319/11289 cut-off events. [2024-06-27 16:47:58,059 INFO L125 PetriNetUnfolderBase]: For 52948/53495 co-relation queries the response was YES. [2024-06-27 16:47:58,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39156 conditions, 11289 events. 6319/11289 cut-off events. For 52948/53495 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 89696 event pairs, 3083 based on Foata normal form. 524/11375 useless extension candidates. Maximal degree in co-relation 39111. Up to 4878 conditions per place. [2024-06-27 16:47:58,133 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 137 selfloop transitions, 13 changer transitions 40/219 dead transitions. [2024-06-27 16:47:58,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 219 transitions, 2132 flow [2024-06-27 16:47:58,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 16:47:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 16:47:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 200 transitions. [2024-06-27 16:47:58,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-27 16:47:58,134 INFO L175 Difference]: Start difference. First operand has 146 places, 124 transitions, 1023 flow. Second operand 9 states and 200 transitions. [2024-06-27 16:47:58,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 219 transitions, 2132 flow [2024-06-27 16:47:58,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 219 transitions, 1973 flow, removed 72 selfloop flow, removed 9 redundant places. [2024-06-27 16:47:58,238 INFO L231 Difference]: Finished difference. Result has 144 places, 130 transitions, 1021 flow [2024-06-27 16:47:58,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1021, PETRI_PLACES=144, PETRI_TRANSITIONS=130} [2024-06-27 16:47:58,239 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 98 predicate places. [2024-06-27 16:47:58,239 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 130 transitions, 1021 flow [2024-06-27 16:47:58,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 17.88888888888889) internal successors, (322), 18 states have internal predecessors, (322), 0 states have call successors, (0), 0 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:47:58,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:47:58,239 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:47:58,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-06-27 16:47:58,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-06-27 16:47:58,445 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 16:47:58,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:47:58,446 INFO L85 PathProgramCache]: Analyzing trace with hash 174271604, now seen corresponding path program 2 times [2024-06-27 16:47:58,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:47:58,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843575497] [2024-06-27 16:47:58,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:47:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:47:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:47:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:47:59,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:47:59,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843575497] [2024-06-27 16:47:59,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843575497] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:47:59,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998472801] [2024-06-27 16:47:59,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:47:59,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:47:59,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:47:59,638 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:47:59,639 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:47:59,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:47:59,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:47:59,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 27 conjunts are in the unsatisfiable core [2024-06-27 16:47:59,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:47:59,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:47:59,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2024-06-27 16:47:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 16:47:59,972 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:48:00,196 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2024-06-27 16:48:00,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 101 [2024-06-27 16:48:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-27 16:48:00,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998472801] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 16:48:00,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:48:00,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17, 8] total 27 [2024-06-27 16:48:00,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384774095] [2024-06-27 16:48:00,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:48:00,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 16:48:00,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:48:00,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 16:48:00,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2024-06-27 16:48:00,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 16:48:00,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 130 transitions, 1021 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:48:00,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:48:00,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 16:48:00,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:48:02,474 INFO L124 PetriNetUnfolderBase]: 9946/16543 cut-off events. [2024-06-27 16:48:02,474 INFO L125 PetriNetUnfolderBase]: For 69084/70126 co-relation queries the response was YES. [2024-06-27 16:48:02,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55846 conditions, 16543 events. 9946/16543 cut-off events. For 69084/70126 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 124407 event pairs, 1339 based on Foata normal form. 606/16234 useless extension candidates. Maximal degree in co-relation 55801. Up to 9019 conditions per place. [2024-06-27 16:48:02,605 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 155 selfloop transitions, 17 changer transitions 1/200 dead transitions. [2024-06-27 16:48:02,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 200 transitions, 1867 flow [2024-06-27 16:48:02,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 16:48:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 16:48:02,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-06-27 16:48:02,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-27 16:48:02,606 INFO L175 Difference]: Start difference. First operand has 144 places, 130 transitions, 1021 flow. Second operand 7 states and 150 transitions. [2024-06-27 16:48:02,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 200 transitions, 1867 flow [2024-06-27 16:48:02,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 200 transitions, 1843 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-27 16:48:02,693 INFO L231 Difference]: Finished difference. Result has 149 places, 132 transitions, 1052 flow [2024-06-27 16:48:02,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1052, PETRI_PLACES=149, PETRI_TRANSITIONS=132} [2024-06-27 16:48:02,694 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 103 predicate places. [2024-06-27 16:48:02,694 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 132 transitions, 1052 flow [2024-06-27 16:48:02,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:48:02,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:48:02,695 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:48:02,722 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:48:02,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:48:02,908 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 16:48:02,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:48:02,909 INFO L85 PathProgramCache]: Analyzing trace with hash 729320223, now seen corresponding path program 1 times [2024-06-27 16:48:02,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:48:02,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692047350] [2024-06-27 16:48:02,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:02,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:48:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:03,193 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-06-27 16:48:03,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:48:03,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692047350] [2024-06-27 16:48:03,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692047350] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:48:03,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509241288] [2024-06-27 16:48:03,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:03,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:48:03,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:48:03,195 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:48:03,216 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:48:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:03,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-27 16:48:03,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:48:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-06-27 16:48:03,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:48:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-06-27 16:48:03,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509241288] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:48:03,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:48:03,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-06-27 16:48:03,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921337040] [2024-06-27 16:48:03,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:48:03,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-27 16:48:03,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:48:03,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-27 16:48:03,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-06-27 16:48:03,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:48:03,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 132 transitions, 1052 flow. Second operand has 17 states, 17 states have (on average 18.529411764705884) internal successors, (315), 17 states have internal predecessors, (315), 0 states have call successors, (0), 0 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:48:03,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:48:03,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:48:03,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:48:05,122 INFO L124 PetriNetUnfolderBase]: 5856/10847 cut-off events. [2024-06-27 16:48:05,122 INFO L125 PetriNetUnfolderBase]: For 58134/59336 co-relation queries the response was YES. [2024-06-27 16:48:05,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40809 conditions, 10847 events. 5856/10847 cut-off events. For 58134/59336 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 87651 event pairs, 2472 based on Foata normal form. 593/10961 useless extension candidates. Maximal degree in co-relation 40763. Up to 6221 conditions per place. [2024-06-27 16:48:05,180 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 77 selfloop transitions, 10 changer transitions 70/180 dead transitions. [2024-06-27 16:48:05,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 180 transitions, 1664 flow [2024-06-27 16:48:05,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 16:48:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 16:48:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2024-06-27 16:48:05,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4765625 [2024-06-27 16:48:05,182 INFO L175 Difference]: Start difference. First operand has 149 places, 132 transitions, 1052 flow. Second operand 8 states and 183 transitions. [2024-06-27 16:48:05,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 180 transitions, 1664 flow [2024-06-27 16:48:05,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 180 transitions, 1645 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:48:05,233 INFO L231 Difference]: Finished difference. Result has 156 places, 105 transitions, 798 flow [2024-06-27 16:48:05,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=798, PETRI_PLACES=156, PETRI_TRANSITIONS=105} [2024-06-27 16:48:05,235 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 110 predicate places. [2024-06-27 16:48:05,235 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 105 transitions, 798 flow [2024-06-27 16:48:05,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.529411764705884) internal successors, (315), 17 states have internal predecessors, (315), 0 states have call successors, (0), 0 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:48:05,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:48:05,235 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:48:05,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-06-27 16:48:05,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:48:05,446 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 16:48:05,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:48:05,447 INFO L85 PathProgramCache]: Analyzing trace with hash -965304417, now seen corresponding path program 1 times [2024-06-27 16:48:05,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:48:05,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108161383] [2024-06-27 16:48:05,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:05,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:48:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-06-27 16:48:05,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:48:05,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108161383] [2024-06-27 16:48:05,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108161383] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:48:05,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868687782] [2024-06-27 16:48:05,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:05,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:48:05,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:48:05,574 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:48:05,597 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:48:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:05,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 16:48:05,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:48:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-06-27 16:48:05,748 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:48:05,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868687782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:48:05,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:48:05,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-06-27 16:48:05,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752653605] [2024-06-27 16:48:05,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:48:05,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:48:05,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:48:05,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:48:05,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 16:48:05,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:48:05,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 105 transitions, 798 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:48:05,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:48:05,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:48:05,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:48:07,262 INFO L124 PetriNetUnfolderBase]: 6211/12161 cut-off events. [2024-06-27 16:48:07,262 INFO L125 PetriNetUnfolderBase]: For 74718/76277 co-relation queries the response was YES. [2024-06-27 16:48:07,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46823 conditions, 12161 events. 6211/12161 cut-off events. For 74718/76277 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 102537 event pairs, 2521 based on Foata normal form. 989/12833 useless extension candidates. Maximal degree in co-relation 46774. Up to 3943 conditions per place. [2024-06-27 16:48:07,344 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 137 selfloop transitions, 6 changer transitions 6/172 dead transitions. [2024-06-27 16:48:07,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 172 transitions, 1581 flow [2024-06-27 16:48:07,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:48:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:48:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2024-06-27 16:48:07,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-06-27 16:48:07,345 INFO L175 Difference]: Start difference. First operand has 156 places, 105 transitions, 798 flow. Second operand 4 states and 124 transitions. [2024-06-27 16:48:07,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 172 transitions, 1581 flow [2024-06-27 16:48:07,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 172 transitions, 1493 flow, removed 35 selfloop flow, removed 13 redundant places. [2024-06-27 16:48:07,432 INFO L231 Difference]: Finished difference. Result has 133 places, 103 transitions, 756 flow [2024-06-27 16:48:07,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=756, PETRI_PLACES=133, PETRI_TRANSITIONS=103} [2024-06-27 16:48:07,432 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 87 predicate places. [2024-06-27 16:48:07,433 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 103 transitions, 756 flow [2024-06-27 16:48:07,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:48:07,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:48:07,433 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:48:07,444 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:48:07,644 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,SelfDestructingSolverStorable15 [2024-06-27 16:48:07,644 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 16:48:07,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:48:07,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1261959005, now seen corresponding path program 2 times [2024-06-27 16:48:07,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:48:07,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295317896] [2024-06-27 16:48:07,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:07,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:48:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:48:09,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:48:09,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295317896] [2024-06-27 16:48:09,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295317896] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:48:09,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539940528] [2024-06-27 16:48:09,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:48:09,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:48:09,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:48:09,981 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:48:09,982 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:48:10,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:48:10,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:48:10,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 55 conjunts are in the unsatisfiable core [2024-06-27 16:48:10,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:48:11,110 INFO L349 Elim1Store]: treesize reduction 9, result has 85.7 percent of original size [2024-06-27 16:48:11,110 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 61 treesize of output 71 [2024-06-27 16:48:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:48:11,160 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:48:12,127 INFO L349 Elim1Store]: treesize reduction 8, result has 96.8 percent of original size [2024-06-27 16:48:12,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 79 treesize of output 267 [2024-06-27 16:48:27,727 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-27 16:48:27,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539940528] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:48:27,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:48:27,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 14] total 49 [2024-06-27 16:48:27,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44497742] [2024-06-27 16:48:27,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:48:27,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-06-27 16:48:27,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:48:27,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-06-27 16:48:27,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2155, Unknown=0, NotChecked=0, Total=2352 [2024-06-27 16:48:28,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-06-27 16:48:28,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 103 transitions, 756 flow. Second operand has 49 states, 49 states have (on average 12.204081632653061) internal successors, (598), 49 states have internal predecessors, (598), 0 states have call successors, (0), 0 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:48:28,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:48:28,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-06-27 16:48:28,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:48:34,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 16:48:38,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 16:48:42,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 16:48:48,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:48:52,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:48:55,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:48:59,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:49:03,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:49:07,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:49:11,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:49:15,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:49:19,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:49:23,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:49:27,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:49:32,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:49:36,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:49:40,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:49:44,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:49:49,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:49:53,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:49:57,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:50:03,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:50:08,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:50:12,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:50:16,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:50:21,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:50:25,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:50:29,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 16:50:36,335 INFO L124 PetriNetUnfolderBase]: 37376/60681 cut-off events. [2024-06-27 16:50:36,335 INFO L125 PetriNetUnfolderBase]: For 305860/308140 co-relation queries the response was YES. [2024-06-27 16:50:36,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237349 conditions, 60681 events. 37376/60681 cut-off events. For 305860/308140 co-relation queries the response was YES. Maximal size of possible extension queue 2550. Compared 518358 event pairs, 3676 based on Foata normal form. 2255/62598 useless extension candidates. Maximal degree in co-relation 237307. Up to 10903 conditions per place. [2024-06-27 16:50:37,085 INFO L140 encePairwiseOnDemand]: 31/48 looper letters, 406 selfloop transitions, 154 changer transitions 358/928 dead transitions. [2024-06-27 16:50:37,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 928 transitions, 8678 flow [2024-06-27 16:50:37,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-06-27 16:50:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2024-06-27 16:50:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 1375 transitions. [2024-06-27 16:50:37,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36725427350427353 [2024-06-27 16:50:37,088 INFO L175 Difference]: Start difference. First operand has 133 places, 103 transitions, 756 flow. Second operand 78 states and 1375 transitions. [2024-06-27 16:50:37,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 928 transitions, 8678 flow [2024-06-27 16:50:37,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 928 transitions, 8151 flow, removed 259 selfloop flow, removed 4 redundant places. [2024-06-27 16:50:37,742 INFO L231 Difference]: Finished difference. Result has 239 places, 223 transitions, 2503 flow [2024-06-27 16:50:37,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=2503, PETRI_PLACES=239, PETRI_TRANSITIONS=223} [2024-06-27 16:50:37,742 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 193 predicate places. [2024-06-27 16:50:37,743 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 223 transitions, 2503 flow [2024-06-27 16:50:37,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 12.204081632653061) internal successors, (598), 49 states have internal predecessors, (598), 0 states have call successors, (0), 0 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:50:37,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:50:37,743 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:50:37,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-06-27 16:50:37,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-06-27 16:50:37,944 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 16:50:37,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:50:37,944 INFO L85 PathProgramCache]: Analyzing trace with hash 966863337, now seen corresponding path program 3 times [2024-06-27 16:50:37,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:50:37,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488649182] [2024-06-27 16:50:37,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:50:37,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:50:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:50:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-06-27 16:50:38,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:50:38,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488649182] [2024-06-27 16:50:38,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488649182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:50:38,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:50:38,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:50:38,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488819014] [2024-06-27 16:50:38,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:50:38,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:50:38,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:50:38,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:50:38,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:50:38,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:50:38,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 223 transitions, 2503 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:50:38,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:50:38,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:50:38,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:50:42,520 INFO L124 PetriNetUnfolderBase]: 14422/25695 cut-off events. [2024-06-27 16:50:42,521 INFO L125 PetriNetUnfolderBase]: For 448065/450278 co-relation queries the response was YES. [2024-06-27 16:50:42,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121775 conditions, 25695 events. 14422/25695 cut-off events. For 448065/450278 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 213970 event pairs, 4541 based on Foata normal form. 1969/27022 useless extension candidates. Maximal degree in co-relation 121698. Up to 9115 conditions per place. [2024-06-27 16:50:42,822 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 187 selfloop transitions, 52 changer transitions 1/263 dead transitions. [2024-06-27 16:50:42,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 263 transitions, 3228 flow [2024-06-27 16:50:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:50:42,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:50:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2024-06-27 16:50:42,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-06-27 16:50:42,823 INFO L175 Difference]: Start difference. First operand has 239 places, 223 transitions, 2503 flow. Second operand 4 states and 124 transitions. [2024-06-27 16:50:42,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 263 transitions, 3228 flow [2024-06-27 16:50:43,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 263 transitions, 2794 flow, removed 173 selfloop flow, removed 34 redundant places. [2024-06-27 16:50:43,870 INFO L231 Difference]: Finished difference. Result has 159 places, 179 transitions, 1999 flow [2024-06-27 16:50:43,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1999, PETRI_PLACES=159, PETRI_TRANSITIONS=179} [2024-06-27 16:50:43,870 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 113 predicate places. [2024-06-27 16:50:43,870 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 179 transitions, 1999 flow [2024-06-27 16:50:43,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:50:43,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:50:43,871 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:50:43,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 16:50:43,871 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 16:50:43,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:50:43,871 INFO L85 PathProgramCache]: Analyzing trace with hash 32359453, now seen corresponding path program 4 times [2024-06-27 16:50:43,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:50:43,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722879872] [2024-06-27 16:50:43,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:50:43,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:50:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:50:43,947 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-06-27 16:50:43,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:50:43,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722879872] [2024-06-27 16:50:43,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722879872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:50:43,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:50:43,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:50:43,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386855163] [2024-06-27 16:50:43,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:50:43,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:50:43,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:50:43,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:50:43,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:50:43,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:50:43,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 179 transitions, 1999 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:50:43,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:50:43,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:50:43,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:50:44,340 INFO L124 PetriNetUnfolderBase]: 1368/3192 cut-off events. [2024-06-27 16:50:44,340 INFO L125 PetriNetUnfolderBase]: For 24234/24726 co-relation queries the response was YES. [2024-06-27 16:50:44,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10980 conditions, 3192 events. 1368/3192 cut-off events. For 24234/24726 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 23040 event pairs, 1009 based on Foata normal form. 458/3546 useless extension candidates. Maximal degree in co-relation 10921. Up to 2177 conditions per place. [2024-06-27 16:50:44,367 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 92 selfloop transitions, 9 changer transitions 2/123 dead transitions. [2024-06-27 16:50:44,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 123 transitions, 1380 flow [2024-06-27 16:50:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:50:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:50:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-06-27 16:50:44,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484375 [2024-06-27 16:50:44,368 INFO L175 Difference]: Start difference. First operand has 159 places, 179 transitions, 1999 flow. Second operand 4 states and 93 transitions. [2024-06-27 16:50:44,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 123 transitions, 1380 flow [2024-06-27 16:50:44,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 123 transitions, 1142 flow, removed 44 selfloop flow, removed 20 redundant places. [2024-06-27 16:50:44,406 INFO L231 Difference]: Finished difference. Result has 134 places, 113 transitions, 899 flow [2024-06-27 16:50:44,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=899, PETRI_PLACES=134, PETRI_TRANSITIONS=113} [2024-06-27 16:50:44,407 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 88 predicate places. [2024-06-27 16:50:44,407 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 113 transitions, 899 flow [2024-06-27 16:50:44,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:50:44,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:50:44,407 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:50:44,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 16:50:44,407 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 16:50:44,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:50:44,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1156251385, now seen corresponding path program 5 times [2024-06-27 16:50:44,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:50:44,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464626299] [2024-06-27 16:50:44,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:50:44,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:50:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:50:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 16:50:45,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:50:45,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464626299] [2024-06-27 16:50:45,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464626299] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:50:45,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242454574] [2024-06-27 16:50:45,101 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 16:50:45,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:50:45,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:50:45,102 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 16:50:45,104 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 16:50:45,320 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-06-27 16:50:45,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:50:45,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:50:45,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:50:45,423 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-06-27 16:50:45,424 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:50:45,477 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-06-27 16:50:45,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2024-06-27 16:50:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-06-27 16:50:45,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242454574] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:50:45,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:50:45,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 23 [2024-06-27 16:50:45,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754030940] [2024-06-27 16:50:45,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:50:45,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-06-27 16:50:45,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:50:45,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-06-27 16:50:45,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-06-27 16:50:45,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 16:50:45,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 113 transitions, 899 flow. Second operand has 23 states, 23 states have (on average 15.391304347826088) internal successors, (354), 23 states have internal predecessors, (354), 0 states have call successors, (0), 0 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:50:45,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:50:45,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 16:50:45,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:50:46,674 INFO L124 PetriNetUnfolderBase]: 1595/3399 cut-off events. [2024-06-27 16:50:46,675 INFO L125 PetriNetUnfolderBase]: For 13808/13837 co-relation queries the response was YES. [2024-06-27 16:50:46,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10989 conditions, 3399 events. 1595/3399 cut-off events. For 13808/13837 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 22093 event pairs, 449 based on Foata normal form. 209/3597 useless extension candidates. Maximal degree in co-relation 10946. Up to 629 conditions per place. [2024-06-27 16:50:46,695 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 148 selfloop transitions, 41 changer transitions 31/234 dead transitions. [2024-06-27 16:50:46,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 234 transitions, 1956 flow [2024-06-27 16:50:46,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-06-27 16:50:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-06-27 16:50:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 443 transitions. [2024-06-27 16:50:46,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36916666666666664 [2024-06-27 16:50:46,697 INFO L175 Difference]: Start difference. First operand has 134 places, 113 transitions, 899 flow. Second operand 25 states and 443 transitions. [2024-06-27 16:50:46,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 234 transitions, 1956 flow [2024-06-27 16:50:46,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 234 transitions, 1908 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-27 16:50:46,717 INFO L231 Difference]: Finished difference. Result has 161 places, 113 transitions, 1034 flow [2024-06-27 16:50:46,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1034, PETRI_PLACES=161, PETRI_TRANSITIONS=113} [2024-06-27 16:50:46,717 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 115 predicate places. [2024-06-27 16:50:46,717 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 113 transitions, 1034 flow [2024-06-27 16:50:46,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 15.391304347826088) internal successors, (354), 23 states have internal predecessors, (354), 0 states have call successors, (0), 0 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:50:46,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:50:46,718 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:50:46,731 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 16:50:46,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:50:46,918 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 16:50:46,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:50:46,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2079503113, now seen corresponding path program 6 times [2024-06-27 16:50:46,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:50:46,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279759951] [2024-06-27 16:50:46,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:50:46,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:50:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:50:47,112 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-06-27 16:50:47,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:50:47,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279759951] [2024-06-27 16:50:47,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279759951] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:50:47,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167669889] [2024-06-27 16:50:47,113 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 16:50:47,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:50:47,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:50:47,114 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 16:50:47,136 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 16:50:47,298 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-06-27 16:50:47,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:50:47,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 13 conjunts are in the unsatisfiable core [2024-06-27 16:50:47,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:50:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-27 16:50:47,497 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:50:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-27 16:50:47,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167669889] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:50:47,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:50:47,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 22 [2024-06-27 16:50:47,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800887733] [2024-06-27 16:50:47,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:50:47,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-06-27 16:50:47,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:50:47,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-06-27 16:50:47,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-06-27 16:50:47,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:50:47,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 113 transitions, 1034 flow. Second operand has 22 states, 22 states have (on average 18.09090909090909) internal successors, (398), 22 states have internal predecessors, (398), 0 states have call successors, (0), 0 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:50:47,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:50:47,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:50:47,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:50:48,343 INFO L124 PetriNetUnfolderBase]: 1308/3111 cut-off events. [2024-06-27 16:50:48,343 INFO L125 PetriNetUnfolderBase]: For 15207/15341 co-relation queries the response was YES. [2024-06-27 16:50:48,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10950 conditions, 3111 events. 1308/3111 cut-off events. For 15207/15341 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 20926 event pairs, 786 based on Foata normal form. 102/3171 useless extension candidates. Maximal degree in co-relation 10900. Up to 1174 conditions per place. [2024-06-27 16:50:48,360 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 92 selfloop transitions, 7 changer transitions 80/198 dead transitions. [2024-06-27 16:50:48,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 198 transitions, 2181 flow [2024-06-27 16:50:48,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 16:50:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 16:50:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 242 transitions. [2024-06-27 16:50:48,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4201388888888889 [2024-06-27 16:50:48,371 INFO L175 Difference]: Start difference. First operand has 161 places, 113 transitions, 1034 flow. Second operand 12 states and 242 transitions. [2024-06-27 16:50:48,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 198 transitions, 2181 flow [2024-06-27 16:50:48,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 198 transitions, 1843 flow, removed 79 selfloop flow, removed 21 redundant places. [2024-06-27 16:50:48,398 INFO L231 Difference]: Finished difference. Result has 155 places, 114 transitions, 895 flow [2024-06-27 16:50:48,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=895, PETRI_PLACES=155, PETRI_TRANSITIONS=114} [2024-06-27 16:50:48,398 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 109 predicate places. [2024-06-27 16:50:48,398 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 114 transitions, 895 flow [2024-06-27 16:50:48,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 18.09090909090909) internal successors, (398), 22 states have internal predecessors, (398), 0 states have call successors, (0), 0 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:50:48,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:50:48,399 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:50:48,412 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 16:50:48,599 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,SelfDestructingSolverStorable20 [2024-06-27 16:50:48,599 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 16:50:48,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:50:48,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1821939513, now seen corresponding path program 7 times [2024-06-27 16:50:48,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:50:48,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705382952] [2024-06-27 16:50:48,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:50:48,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:50:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:50:50,083 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:50:50,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:50:50,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705382952] [2024-06-27 16:50:50,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705382952] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:50:50,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149533977] [2024-06-27 16:50:50,084 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-06-27 16:50:50,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:50:50,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:50:50,088 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 16:50:50,112 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 16:50:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:50:50,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 46 conjunts are in the unsatisfiable core [2024-06-27 16:50:50,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:50:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 16:50:50,927 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:50:55,347 INFO L349 Elim1Store]: treesize reduction 4, result has 97.2 percent of original size [2024-06-27 16:50:55,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 58 treesize of output 155 [2024-06-27 16:50:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-06-27 16:50:55,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149533977] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:50:55,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:50:55,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 11] total 48 [2024-06-27 16:50:55,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493562843] [2024-06-27 16:50:55,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:50:55,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-06-27 16:50:55,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:50:55,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-06-27 16:50:55,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2070, Unknown=1, NotChecked=0, Total=2256 [2024-06-27 16:50:56,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 16:50:56,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 114 transitions, 895 flow. Second operand has 48 states, 48 states have (on average 11.708333333333334) internal successors, (562), 48 states have internal predecessors, (562), 0 states have call successors, (0), 0 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:50:56,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:50:56,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 16:50:56,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:51:02,764 INFO L124 PetriNetUnfolderBase]: 2097/4152 cut-off events. [2024-06-27 16:51:02,764 INFO L125 PetriNetUnfolderBase]: For 16121/16121 co-relation queries the response was YES. [2024-06-27 16:51:02,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14012 conditions, 4152 events. 2097/4152 cut-off events. For 16121/16121 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 25598 event pairs, 270 based on Foata normal form. 56/4207 useless extension candidates. Maximal degree in co-relation 13966. Up to 623 conditions per place. [2024-06-27 16:51:02,783 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 329 selfloop transitions, 125 changer transitions 33/493 dead transitions. [2024-06-27 16:51:02,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 493 transitions, 3778 flow [2024-06-27 16:51:02,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-06-27 16:51:02,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2024-06-27 16:51:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 1070 transitions. [2024-06-27 16:51:02,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30960648148148145 [2024-06-27 16:51:02,787 INFO L175 Difference]: Start difference. First operand has 155 places, 114 transitions, 895 flow. Second operand 72 states and 1070 transitions. [2024-06-27 16:51:02,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 493 transitions, 3778 flow [2024-06-27 16:51:02,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 493 transitions, 3572 flow, removed 89 selfloop flow, removed 13 redundant places. [2024-06-27 16:51:02,815 INFO L231 Difference]: Finished difference. Result has 224 places, 180 transitions, 1800 flow [2024-06-27 16:51:02,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=1800, PETRI_PLACES=224, PETRI_TRANSITIONS=180} [2024-06-27 16:51:02,816 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 178 predicate places. [2024-06-27 16:51:02,816 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 180 transitions, 1800 flow [2024-06-27 16:51:02,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 11.708333333333334) internal successors, (562), 48 states have internal predecessors, (562), 0 states have call successors, (0), 0 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:51:02,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:51:02,816 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:51:02,828 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 16:51:03,027 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,SelfDestructingSolverStorable21 [2024-06-27 16:51:03,028 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 16:51:03,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:51:03,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1088990379, now seen corresponding path program 8 times [2024-06-27 16:51:03,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:51:03,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696375279] [2024-06-27 16:51:03,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:51:03,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:51:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:51:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:51:04,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:51:04,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696375279] [2024-06-27 16:51:04,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696375279] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:51:04,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840789481] [2024-06-27 16:51:04,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:51:04,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:51:04,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:51:04,327 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 16:51:04,328 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 16:51:04,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:51:04,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:51:04,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 52 conjunts are in the unsatisfiable core [2024-06-27 16:51:04,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:51:04,980 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:51:04,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:51:05,309 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2024-06-27 16:51:05,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 101 [2024-06-27 16:51:05,666 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-06-27 16:51:05,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840789481] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:51:05,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:51:05,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12, 11] total 43 [2024-06-27 16:51:05,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257859239] [2024-06-27 16:51:05,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:51:05,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-06-27 16:51:05,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:51:05,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-06-27 16:51:05,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1667, Unknown=0, NotChecked=0, Total=1806 [2024-06-27 16:51:05,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 16:51:05,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 180 transitions, 1800 flow. Second operand has 43 states, 43 states have (on average 12.116279069767442) internal successors, (521), 43 states have internal predecessors, (521), 0 states have call successors, (0), 0 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:51:05,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:51:05,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 16:51:05,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:51:23,431 INFO L124 PetriNetUnfolderBase]: 2281/4631 cut-off events. [2024-06-27 16:51:23,432 INFO L125 PetriNetUnfolderBase]: For 31975/31975 co-relation queries the response was YES. [2024-06-27 16:51:23,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17991 conditions, 4631 events. 2281/4631 cut-off events. For 31975/31975 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 29293 event pairs, 328 based on Foata normal form. 84/4714 useless extension candidates. Maximal degree in co-relation 17935. Up to 690 conditions per place. [2024-06-27 16:51:23,471 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 311 selfloop transitions, 140 changer transitions 30/487 dead transitions. [2024-06-27 16:51:23,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 487 transitions, 4470 flow [2024-06-27 16:51:23,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-06-27 16:51:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2024-06-27 16:51:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 976 transitions. [2024-06-27 16:51:23,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3128205128205128 [2024-06-27 16:51:23,473 INFO L175 Difference]: Start difference. First operand has 224 places, 180 transitions, 1800 flow. Second operand 65 states and 976 transitions. [2024-06-27 16:51:23,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 487 transitions, 4470 flow [2024-06-27 16:51:23,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 487 transitions, 3976 flow, removed 140 selfloop flow, removed 26 redundant places. [2024-06-27 16:51:23,527 INFO L231 Difference]: Finished difference. Result has 269 places, 208 transitions, 2117 flow [2024-06-27 16:51:23,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=2117, PETRI_PLACES=269, PETRI_TRANSITIONS=208} [2024-06-27 16:51:23,527 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 223 predicate places. [2024-06-27 16:51:23,528 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 208 transitions, 2117 flow [2024-06-27 16:51:23,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 12.116279069767442) internal successors, (521), 43 states have internal predecessors, (521), 0 states have call successors, (0), 0 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:51:23,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:51:23,528 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:51:23,540 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 16:51:23,732 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,SelfDestructingSolverStorable22 [2024-06-27 16:51:23,732 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 16:51:23,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:51:23,733 INFO L85 PathProgramCache]: Analyzing trace with hash -283492957, now seen corresponding path program 9 times [2024-06-27 16:51:23,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:51:23,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226525753] [2024-06-27 16:51:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:51:23,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:51:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:51:25,156 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:51:25,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:51:25,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226525753] [2024-06-27 16:51:25,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226525753] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:51:25,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96296450] [2024-06-27 16:51:25,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:51:25,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:51:25,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:51:25,158 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 16:51:25,159 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 16:51:25,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-06-27 16:51:25,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:51:25,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 71 conjunts are in the unsatisfiable core [2024-06-27 16:51:25,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:51:27,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 16:51:27,050 INFO L349 Elim1Store]: treesize reduction 59, result has 27.2 percent of original size [2024-06-27 16:51:27,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 37 [2024-06-27 16:51:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 16:51:27,055 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:51:28,313 INFO L349 Elim1Store]: treesize reduction 41, result has 85.8 percent of original size [2024-06-27 16:51:28,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 83 treesize of output 271 [2024-06-27 16:51:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-06-27 16:51:29,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96296450] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:51:29,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:51:29,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 17] total 56 [2024-06-27 16:51:29,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675700377] [2024-06-27 16:51:29,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:51:29,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-06-27 16:51:29,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:51:29,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-06-27 16:51:29,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=2801, Unknown=0, NotChecked=0, Total=3080 [2024-06-27 16:51:30,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 16:51:30,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 208 transitions, 2117 flow. Second operand has 56 states, 56 states have (on average 11.410714285714286) internal successors, (639), 56 states have internal predecessors, (639), 0 states have call successors, (0), 0 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:51:30,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:51:30,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 16:51:30,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:51:40,772 INFO L124 PetriNetUnfolderBase]: 2680/5574 cut-off events. [2024-06-27 16:51:40,772 INFO L125 PetriNetUnfolderBase]: For 55407/55407 co-relation queries the response was YES. [2024-06-27 16:51:40,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22471 conditions, 5574 events. 2680/5574 cut-off events. For 55407/55407 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 37410 event pairs, 684 based on Foata normal form. 32/5605 useless extension candidates. Maximal degree in co-relation 22408. Up to 1376 conditions per place. [2024-06-27 16:51:40,817 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 381 selfloop transitions, 182 changer transitions 17/586 dead transitions. [2024-06-27 16:51:40,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 586 transitions, 5879 flow [2024-06-27 16:51:40,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-06-27 16:51:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2024-06-27 16:51:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 1145 transitions. [2024-06-27 16:51:40,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29449588477366256 [2024-06-27 16:51:40,819 INFO L175 Difference]: Start difference. First operand has 269 places, 208 transitions, 2117 flow. Second operand 81 states and 1145 transitions. [2024-06-27 16:51:40,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 586 transitions, 5879 flow [2024-06-27 16:51:40,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 586 transitions, 5548 flow, removed 51 selfloop flow, removed 33 redundant places. [2024-06-27 16:51:40,945 INFO L231 Difference]: Finished difference. Result has 333 places, 301 transitions, 3741 flow [2024-06-27 16:51:40,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1884, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=81, PETRI_FLOW=3741, PETRI_PLACES=333, PETRI_TRANSITIONS=301} [2024-06-27 16:51:40,946 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 287 predicate places. [2024-06-27 16:51:40,946 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 301 transitions, 3741 flow [2024-06-27 16:51:40,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 11.410714285714286) internal successors, (639), 56 states have internal predecessors, (639), 0 states have call successors, (0), 0 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:51:40,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:51:40,946 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:51:40,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-06-27 16:51:41,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:51:41,147 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 16:51:41,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:51:41,147 INFO L85 PathProgramCache]: Analyzing trace with hash 771454913, now seen corresponding path program 10 times [2024-06-27 16:51:41,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:51:41,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113950774] [2024-06-27 16:51:41,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:51:41,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:51:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:51:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:51:43,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:51:43,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113950774] [2024-06-27 16:51:43,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113950774] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:51:43,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653669365] [2024-06-27 16:51:43,073 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 16:51:43,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:51:43,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:51:43,075 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 16:51:43,076 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 16:51:43,270 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 16:51:43,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:51:43,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 28 conjunts are in the unsatisfiable core [2024-06-27 16:51:43,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:51:43,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:51:43,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2024-06-27 16:51:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-06-27 16:51:43,732 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:51:43,974 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2024-06-27 16:51:43,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 101 [2024-06-27 16:51:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-06-27 16:51:44,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653669365] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:51:44,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:51:44,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13, 11] total 44 [2024-06-27 16:51:44,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324080562] [2024-06-27 16:51:44,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:51:44,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-06-27 16:51:44,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:51:44,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-06-27 16:51:44,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1758, Unknown=0, NotChecked=0, Total=1892 [2024-06-27 16:51:44,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-06-27 16:51:44,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 301 transitions, 3741 flow. Second operand has 44 states, 44 states have (on average 12.568181818181818) internal successors, (553), 44 states have internal predecessors, (553), 0 states have call successors, (0), 0 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:51:44,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:51:44,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-06-27 16:51:44,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:51:54,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:51:57,541 INFO L124 PetriNetUnfolderBase]: 2274/4977 cut-off events. [2024-06-27 16:51:57,541 INFO L125 PetriNetUnfolderBase]: For 56035/56183 co-relation queries the response was YES. [2024-06-27 16:51:57,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20740 conditions, 4977 events. 2274/4977 cut-off events. For 56035/56183 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 33868 event pairs, 473 based on Foata normal form. 108/5036 useless extension candidates. Maximal degree in co-relation 20664. Up to 1246 conditions per place. [2024-06-27 16:51:57,586 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 202 selfloop transitions, 224 changer transitions 3/439 dead transitions. [2024-06-27 16:51:57,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 439 transitions, 5468 flow [2024-06-27 16:51:57,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-06-27 16:51:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2024-06-27 16:51:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 620 transitions. [2024-06-27 16:51:57,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3003875968992248 [2024-06-27 16:51:57,588 INFO L175 Difference]: Start difference. First operand has 333 places, 301 transitions, 3741 flow. Second operand 43 states and 620 transitions. [2024-06-27 16:51:57,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 439 transitions, 5468 flow [2024-06-27 16:51:57,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 439 transitions, 4983 flow, removed 178 selfloop flow, removed 35 redundant places. [2024-06-27 16:51:57,721 INFO L231 Difference]: Finished difference. Result has 337 places, 327 transitions, 4072 flow [2024-06-27 16:51:57,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3221, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=4072, PETRI_PLACES=337, PETRI_TRANSITIONS=327} [2024-06-27 16:51:57,722 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 291 predicate places. [2024-06-27 16:51:57,722 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 327 transitions, 4072 flow [2024-06-27 16:51:57,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 12.568181818181818) internal successors, (553), 44 states have internal predecessors, (553), 0 states have call successors, (0), 0 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:51:57,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:51:57,722 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:51:57,736 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 16:51:57,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:51:57,923 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 16:51:57,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:51:57,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2046135892, now seen corresponding path program 11 times [2024-06-27 16:51:57,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:51:57,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586585653] [2024-06-27 16:51:57,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:51:57,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:51:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:51:58,108 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-06-27 16:51:58,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:51:58,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586585653] [2024-06-27 16:51:58,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586585653] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:51:58,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520086506] [2024-06-27 16:51:58,109 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 16:51:58,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:51:58,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:51:58,110 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 16:51:58,111 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 16:51:58,343 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-06-27 16:51:58,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:51:58,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 13 conjunts are in the unsatisfiable core [2024-06-27 16:51:58,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:51:58,538 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-06-27 16:51:58,538 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:51:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-06-27 16:51:58,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520086506] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:51:58,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:51:58,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2024-06-27 16:51:58,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024783843] [2024-06-27 16:51:58,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:51:58,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-06-27 16:51:58,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:51:58,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-06-27 16:51:58,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2024-06-27 16:51:58,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:51:58,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 327 transitions, 4072 flow. Second operand has 23 states, 23 states have (on average 18.130434782608695) internal successors, (417), 23 states have internal predecessors, (417), 0 states have call successors, (0), 0 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:51:58,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:51:58,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:51:58,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:51:59,731 INFO L124 PetriNetUnfolderBase]: 2274/5947 cut-off events. [2024-06-27 16:51:59,731 INFO L125 PetriNetUnfolderBase]: For 34864/35176 co-relation queries the response was YES. [2024-06-27 16:51:59,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21961 conditions, 5947 events. 2274/5947 cut-off events. For 34864/35176 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 48162 event pairs, 1360 based on Foata normal form. 198/6040 useless extension candidates. Maximal degree in co-relation 21890. Up to 1616 conditions per place. [2024-06-27 16:51:59,781 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 214 selfloop transitions, 21 changer transitions 197/499 dead transitions. [2024-06-27 16:51:59,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 499 transitions, 7340 flow [2024-06-27 16:51:59,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 16:51:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 16:51:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 226 transitions. [2024-06-27 16:51:59,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42803030303030304 [2024-06-27 16:51:59,782 INFO L175 Difference]: Start difference. First operand has 337 places, 327 transitions, 4072 flow. Second operand 11 states and 226 transitions. [2024-06-27 16:51:59,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 499 transitions, 7340 flow [2024-06-27 16:51:59,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 499 transitions, 6970 flow, removed 16 selfloop flow, removed 15 redundant places. [2024-06-27 16:51:59,860 INFO L231 Difference]: Finished difference. Result has 337 places, 301 transitions, 3545 flow [2024-06-27 16:51:59,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3814, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3545, PETRI_PLACES=337, PETRI_TRANSITIONS=301} [2024-06-27 16:51:59,861 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 291 predicate places. [2024-06-27 16:51:59,861 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 301 transitions, 3545 flow [2024-06-27 16:51:59,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 18.130434782608695) internal successors, (417), 23 states have internal predecessors, (417), 0 states have call successors, (0), 0 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:51:59,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:51:59,861 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:51:59,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-06-27 16:52:00,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-06-27 16:52:00,062 INFO L420 AbstractCegarLoop]: === Iteration 27 === 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:52:00,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:52:00,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1095406484, now seen corresponding path program 12 times [2024-06-27 16:52:00,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:52:00,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136618187] [2024-06-27 16:52:00,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:52:00,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:52:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:52:03,771 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:52:03,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:52:03,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136618187] [2024-06-27 16:52:03,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136618187] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:52:03,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493859106] [2024-06-27 16:52:03,771 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 16:52:03,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:52:03,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:52:03,772 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 16:52:03,773 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 16:52:03,964 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-06-27 16:52:03,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:52:03,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 89 conjunts are in the unsatisfiable core [2024-06-27 16:52:03,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:52:14,968 INFO L349 Elim1Store]: treesize reduction 691, result has 20.1 percent of original size [2024-06-27 16:52:14,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 159 treesize of output 214 [2024-06-27 16:52:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 16:52:14,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:52:20,919 INFO L349 Elim1Store]: treesize reduction 115, result has 90.8 percent of original size [2024-06-27 16:52:20,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 169 treesize of output 1177 [2024-06-27 16:54:44,052 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 16:54:44,060 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 16:54:44,061 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-06-27 16:54:44,075 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 16:54:44,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-06-27 16:54:44,269 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.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:287) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:519) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:609) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) 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) ... 69 more [2024-06-27 16:54:44,277 INFO L158 Benchmark]: Toolchain (without parser) took 422392.01ms. Allocated memory was 180.4MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 122.8MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 4.4GB. Max. memory is 16.1GB. [2024-06-27 16:54:44,277 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 16:54:44,277 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.48ms. Allocated memory is still 180.4MB. Free memory was 122.8MB in the beginning and 109.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-06-27 16:54:44,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.79ms. Allocated memory is still 180.4MB. Free memory was 109.0MB in the beginning and 106.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 16:54:44,278 INFO L158 Benchmark]: Boogie Preprocessor took 61.10ms. Allocated memory is still 180.4MB. Free memory was 106.4MB in the beginning and 103.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 16:54:44,278 INFO L158 Benchmark]: RCFGBuilder took 718.60ms. Allocated memory was 180.4MB in the beginning and 274.7MB in the end (delta: 94.4MB). Free memory was 103.2MB in the beginning and 195.0MB in the end (delta: -91.7MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. [2024-06-27 16:54:44,278 INFO L158 Benchmark]: TraceAbstraction took 421306.88ms. Allocated memory was 274.7MB in the beginning and 5.6GB in the end (delta: 5.3GB). Free memory was 193.9MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 4.3GB. Max. memory is 16.1GB. [2024-06-27 16:54:44,280 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.11ms. Allocated memory is still 180.4MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.48ms. Allocated memory is still 180.4MB. Free memory was 122.8MB in the beginning and 109.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.79ms. Allocated memory is still 180.4MB. Free memory was 109.0MB in the beginning and 106.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.10ms. Allocated memory is still 180.4MB. Free memory was 106.4MB in the beginning and 103.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 718.60ms. Allocated memory was 180.4MB in the beginning and 274.7MB in the end (delta: 94.4MB). Free memory was 103.2MB in the beginning and 195.0MB in the end (delta: -91.7MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. * TraceAbstraction took 421306.88ms. Allocated memory was 274.7MB in the beginning and 5.6GB in the end (delta: 5.3GB). Free memory was 193.9MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 4.3GB. 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-bad-ring.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 be394a9cdc866c1e1426a3fe296e99873bcf37ee5e7e1c9e487b239a3e0a8fbe --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:54:46,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:54:46,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-06-27 16:54:46,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:54:46,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:54:46,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:54:46,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:54:46,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:54:46,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:54:46,353 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:54:46,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:54:46,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:54:46,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:54:46,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:54:46,354 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:54:46,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:54:46,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:54:46,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:54:46,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:54:46,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:54:46,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:54:46,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:54:46,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:54:46,360 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-06-27 16:54:46,361 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-06-27 16:54:46,361 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:54:46,361 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-06-27 16:54:46,361 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:54:46,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:54:46,361 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:54:46,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:54:46,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:54:46,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:54:46,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:54:46,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:54:46,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:54:46,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:54:46,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:54:46,364 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-06-27 16:54:46,364 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-06-27 16:54:46,364 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:54:46,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:54:46,365 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:54:46,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:54:46,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:54:46,365 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-06-27 16:54:46,365 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 -> be394a9cdc866c1e1426a3fe296e99873bcf37ee5e7e1c9e487b239a3e0a8fbe [2024-06-27 16:54:46,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:54:46,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:54:46,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:54:46,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:54:46,655 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:54:46,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2024-06-27 16:54:47,702 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:54:47,886 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:54:47,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2024-06-27 16:54:47,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd2674941/1ebd5dbd4e82496197a5d7665c43c318/FLAGa965031f9 [2024-06-27 16:54:47,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd2674941/1ebd5dbd4e82496197a5d7665c43c318 [2024-06-27 16:54:47,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:54:47,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:54:47,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:54:47,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:54:47,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:54:47,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:54:47" (1/1) ... [2024-06-27 16:54:47,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65aab01e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:47, skipping insertion in model container [2024-06-27 16:54:47,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:54:47" (1/1) ... [2024-06-27 16:54:47,942 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:54:48,111 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-bad-ring.wvr.c[3986,3999] [2024-06-27 16:54:48,126 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:54:48,136 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-06-27 16:54:48,142 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:54:48,170 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-bad-ring.wvr.c[3986,3999] [2024-06-27 16:54:48,176 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:54:48,182 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:54:48,210 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-bad-ring.wvr.c[3986,3999] [2024-06-27 16:54:48,215 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:54:48,235 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:54:48,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:48 WrapperNode [2024-06-27 16:54:48,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:54:48,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:54:48,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:54:48,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:54:48,241 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:54:48" (1/1) ... [2024-06-27 16:54:48,259 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:54:48" (1/1) ... [2024-06-27 16:54:48,296 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 302 [2024-06-27 16:54:48,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:54:48,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:54:48,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:54:48,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:54:48,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:48" (1/1) ... [2024-06-27 16:54:48,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:48" (1/1) ... [2024-06-27 16:54:48,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:48" (1/1) ... [2024-06-27 16:54:48,337 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-06-27 16:54:48,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:48" (1/1) ... [2024-06-27 16:54:48,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:48" (1/1) ... [2024-06-27 16:54:48,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:48" (1/1) ... [2024-06-27 16:54:48,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:48" (1/1) ... [2024-06-27 16:54:48,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:48" (1/1) ... [2024-06-27 16:54:48,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:48" (1/1) ... [2024-06-27 16:54:48,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:54:48,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:54:48,381 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:54:48,381 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:54:48,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:48" (1/1) ... [2024-06-27 16:54:48,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:54:48,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:54:48,405 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:54:48,428 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:54:48,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:54:48,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-06-27 16:54:48,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-06-27 16:54:48,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-06-27 16:54:48,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-06-27 16:54:48,453 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:54:48,453 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:54:48,453 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:54:48,453 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:54:48,453 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 16:54:48,453 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 16:54:48,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 16:54:48,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 16:54:48,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 16:54:48,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:54:48,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:54:48,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-06-27 16:54:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-06-27 16:54:48,456 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:54:48,566 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:54:48,568 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:54:48,996 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:54:48,996 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:54:49,309 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:54:49,309 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-06-27 16:54:49,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:54:49 BoogieIcfgContainer [2024-06-27 16:54:49,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:54:49,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:54:49,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:54:49,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:54:49,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:54:47" (1/3) ... [2024-06-27 16:54:49,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3882f9c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:54:49, skipping insertion in model container [2024-06-27 16:54:49,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:48" (2/3) ... [2024-06-27 16:54:49,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3882f9c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:54:49, skipping insertion in model container [2024-06-27 16:54:49,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:54:49" (3/3) ... [2024-06-27 16:54:49,316 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2024-06-27 16:54:49,323 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:54:49,329 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:54:49,329 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:54:49,330 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:54:49,375 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-06-27 16:54:49,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 48 transitions, 117 flow [2024-06-27 16:54:49,433 INFO L124 PetriNetUnfolderBase]: 8/45 cut-off events. [2024-06-27 16:54:49,433 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:54:49,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 8/45 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-06-27 16:54:49,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 48 transitions, 117 flow [2024-06-27 16:54:49,440 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 44 transitions, 106 flow [2024-06-27 16:54:49,466 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:54:49,472 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;@493ced4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:54:49,472 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 16:54:49,488 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:54:49,488 INFO L124 PetriNetUnfolderBase]: 8/43 cut-off events. [2024-06-27 16:54:49,488 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:54:49,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:49,489 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 16:54:49,489 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:54:49,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:49,493 INFO L85 PathProgramCache]: Analyzing trace with hash 845796756, now seen corresponding path program 1 times [2024-06-27 16:54:49,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:54:49,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031098262] [2024-06-27 16:54:49,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:49,506 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 16:54:49,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:54:49,508 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 16:54:49,543 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 16:54:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:49,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 1 conjunts are in the unsatisfiable core [2024-06-27 16:54:49,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:54:49,668 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:54:49,668 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:54:49,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:54:49,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031098262] [2024-06-27 16:54:49,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031098262] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:49,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:54:49,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:54:49,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606795424] [2024-06-27 16:54:49,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:49,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-06-27 16:54:49,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:54:49,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-06-27 16:54:49,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-06-27 16:54:49,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:54:49,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 106 flow. Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 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:54:49,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:49,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:54:49,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:50,007 INFO L124 PetriNetUnfolderBase]: 1049/1803 cut-off events. [2024-06-27 16:54:50,007 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2024-06-27 16:54:50,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3318 conditions, 1803 events. 1049/1803 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9522 event pairs, 858 based on Foata normal form. 165/1789 useless extension candidates. Maximal degree in co-relation 3111. Up to 1394 conditions per place. [2024-06-27 16:54:50,033 INFO L140 encePairwiseOnDemand]: 46/48 looper letters, 32 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2024-06-27 16:54:50,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 42 transitions, 166 flow [2024-06-27 16:54:50,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-06-27 16:54:50,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-06-27 16:54:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2024-06-27 16:54:50,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-06-27 16:54:50,043 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 106 flow. Second operand 2 states and 60 transitions. [2024-06-27 16:54:50,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 42 transitions, 166 flow [2024-06-27 16:54:50,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 154 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 16:54:50,049 INFO L231 Difference]: Finished difference. Result has 41 places, 42 transitions, 90 flow [2024-06-27 16:54:50,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=41, PETRI_TRANSITIONS=42} [2024-06-27 16:54:50,052 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2024-06-27 16:54:50,052 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 90 flow [2024-06-27 16:54:50,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 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:54:50,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:50,053 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:50,058 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 (2)] Ended with exit code 0 [2024-06-27 16:54:50,256 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 16:54:50,256 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:54:50,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:50,257 INFO L85 PathProgramCache]: Analyzing trace with hash 79711932, now seen corresponding path program 1 times [2024-06-27 16:54:50,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:54:50,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398074529] [2024-06-27 16:54:50,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:50,257 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 16:54:50,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:54:50,258 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 16:54:50,262 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 16:54:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:50,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2024-06-27 16:54:50,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:54:50,408 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:54:50,409 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:54:50,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:54:50,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398074529] [2024-06-27 16:54:50,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398074529] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:50,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:54:50,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:54:50,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269876274] [2024-06-27 16:54:50,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:50,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:54:50,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:54:50,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:54:50,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:54:50,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:54:50,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:54:50,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:50,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:54:50,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:50,683 INFO L124 PetriNetUnfolderBase]: 1040/1735 cut-off events. [2024-06-27 16:54:50,684 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-06-27 16:54:50,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3226 conditions, 1735 events. 1040/1735 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8715 event pairs, 266 based on Foata normal form. 33/1665 useless extension candidates. Maximal degree in co-relation 3223. Up to 1251 conditions per place. [2024-06-27 16:54:50,695 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 42 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2024-06-27 16:54:50,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 208 flow [2024-06-27 16:54:50,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:54:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:54:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-06-27 16:54:50,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2024-06-27 16:54:50,698 INFO L175 Difference]: Start difference. First operand has 41 places, 42 transitions, 90 flow. Second operand 3 states and 85 transitions. [2024-06-27 16:54:50,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 208 flow [2024-06-27 16:54:50,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 208 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:54:50,709 INFO L231 Difference]: Finished difference. Result has 44 places, 44 transitions, 109 flow [2024-06-27 16:54:50,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=44, PETRI_TRANSITIONS=44} [2024-06-27 16:54:50,710 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2024-06-27 16:54:50,710 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 109 flow [2024-06-27 16:54:50,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:54:50,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:50,710 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:50,717 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 16:54:50,914 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 16:54:50,915 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:54:50,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:50,915 INFO L85 PathProgramCache]: Analyzing trace with hash 205175586, now seen corresponding path program 2 times [2024-06-27 16:54:50,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:54:50,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684506286] [2024-06-27 16:54:50,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:54:50,916 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 16:54:50,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:54:50,917 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 16:54:50,928 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 16:54:51,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-06-27 16:54:51,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:54:51,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2024-06-27 16:54:51,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:54:51,042 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:54:51,043 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:54:51,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:54:51,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684506286] [2024-06-27 16:54:51,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684506286] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:51,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:54:51,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:54:51,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433700764] [2024-06-27 16:54:51,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:51,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:54:51,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:54:51,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:54:51,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:54:51,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:54:51,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:54:51,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:51,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:54:51,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:51,272 INFO L124 PetriNetUnfolderBase]: 871/1558 cut-off events. [2024-06-27 16:54:51,272 INFO L125 PetriNetUnfolderBase]: For 240/243 co-relation queries the response was YES. [2024-06-27 16:54:51,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3141 conditions, 1558 events. 871/1558 cut-off events. For 240/243 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7993 event pairs, 315 based on Foata normal form. 32/1481 useless extension candidates. Maximal degree in co-relation 3136. Up to 794 conditions per place. [2024-06-27 16:54:51,279 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 45 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2024-06-27 16:54:51,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 237 flow [2024-06-27 16:54:51,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:54:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:54:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-06-27 16:54:51,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2024-06-27 16:54:51,282 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 109 flow. Second operand 3 states and 85 transitions. [2024-06-27 16:54:51,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 237 flow [2024-06-27 16:54:51,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:54:51,284 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 118 flow [2024-06-27 16:54:51,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2024-06-27 16:54:51,285 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2024-06-27 16:54:51,286 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 118 flow [2024-06-27 16:54:51,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:54:51,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:51,286 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:51,292 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 (4)] Forceful destruction successful, exit code 0 [2024-06-27 16:54:51,489 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 16:54:51,490 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:54:51,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:51,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1734693040, now seen corresponding path program 3 times [2024-06-27 16:54:51,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:54:51,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31118081] [2024-06-27 16:54:51,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:54:51,491 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 16:54:51,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:54:51,492 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 16:54:51,493 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 16:54:51,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-06-27 16:54:51,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:54:51,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2024-06-27 16:54:51,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:54:51,679 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:54:51,679 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:54:51,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:54:51,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31118081] [2024-06-27 16:54:51,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31118081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:51,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:54:51,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:54:51,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786368552] [2024-06-27 16:54:51,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:51,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:54:51,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:54:51,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:54:51,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:54:51,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:54:51,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:54:51,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:51,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:54:51,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:51,939 INFO L124 PetriNetUnfolderBase]: 1319/2213 cut-off events. [2024-06-27 16:54:51,939 INFO L125 PetriNetUnfolderBase]: For 472/501 co-relation queries the response was YES. [2024-06-27 16:54:51,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4914 conditions, 2213 events. 1319/2213 cut-off events. For 472/501 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 12422 event pairs, 426 based on Foata normal form. 1/2113 useless extension candidates. Maximal degree in co-relation 4908. Up to 1175 conditions per place. [2024-06-27 16:54:51,949 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 48 selfloop transitions, 2 changer transitions 6/66 dead transitions. [2024-06-27 16:54:51,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 286 flow [2024-06-27 16:54:51,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:54:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:54:51,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-06-27 16:54:51,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2024-06-27 16:54:51,952 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 118 flow. Second operand 3 states and 94 transitions. [2024-06-27 16:54:51,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 286 flow [2024-06-27 16:54:51,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:54:51,956 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 124 flow [2024-06-27 16:54:51,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2024-06-27 16:54:51,957 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2024-06-27 16:54:51,957 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 124 flow [2024-06-27 16:54:51,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:54:51,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:51,957 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:51,967 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 16:54:52,160 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 16:54:52,161 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:54:52,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:52,161 INFO L85 PathProgramCache]: Analyzing trace with hash 778495292, now seen corresponding path program 1 times [2024-06-27 16:54:52,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:54:52,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780882915] [2024-06-27 16:54:52,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:52,164 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 16:54:52,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:54:52,165 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 16:54:52,168 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 16:54:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:52,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2024-06-27 16:54:52,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:54:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:54:52,301 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:54:52,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:54:52,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780882915] [2024-06-27 16:54:52,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780882915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:52,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:54:52,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:54:52,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498461917] [2024-06-27 16:54:52,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:52,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:54:52,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:54:52,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:54:52,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:54:52,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:54:52,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:54:52,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:52,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:54:52,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:52,443 INFO L124 PetriNetUnfolderBase]: 496/830 cut-off events. [2024-06-27 16:54:52,444 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2024-06-27 16:54:52,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1894 conditions, 830 events. 496/830 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3813 event pairs, 190 based on Foata normal form. 44/829 useless extension candidates. Maximal degree in co-relation 1887. Up to 546 conditions per place. [2024-06-27 16:54:52,448 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 39 selfloop transitions, 2 changer transitions 1/52 dead transitions. [2024-06-27 16:54:52,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 228 flow [2024-06-27 16:54:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:54:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:54:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-06-27 16:54:52,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-27 16:54:52,449 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 124 flow. Second operand 3 states and 80 transitions. [2024-06-27 16:54:52,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 228 flow [2024-06-27 16:54:52,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 224 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 16:54:52,450 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 132 flow [2024-06-27 16:54:52,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-06-27 16:54:52,451 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2024-06-27 16:54:52,451 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 132 flow [2024-06-27 16:54:52,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:54:52,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:52,459 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 (6)] Forceful destruction successful, exit code 0 [2024-06-27 16:54:52,654 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 16:54:52,655 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:54:52,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:52,655 INFO L85 PathProgramCache]: Analyzing trace with hash -207191138, now seen corresponding path program 2 times [2024-06-27 16:54:52,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:54:52,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524595852] [2024-06-27 16:54:52,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:54:52,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 16:54:52,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:54:52,657 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 16:54:52,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 (7)] Waiting until timeout for monitored process [2024-06-27 16:54:52,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-06-27 16:54:52,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:54:52,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 16:54:52,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:54:52,850 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:54:52,850 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:54:52,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:54:52,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524595852] [2024-06-27 16:54:52,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524595852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:52,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:54:52,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:54:52,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179653177] [2024-06-27 16:54:52,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:52,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:54:52,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:54:52,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:54:52,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:54:52,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:54:52,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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:54:52,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:52,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:54:52,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:53,041 INFO L124 PetriNetUnfolderBase]: 545/939 cut-off events. [2024-06-27 16:54:53,041 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2024-06-27 16:54:53,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2191 conditions, 939 events. 545/939 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4448 event pairs, 411 based on Foata normal form. 13/906 useless extension candidates. Maximal degree in co-relation 2183. Up to 745 conditions per place. [2024-06-27 16:54:53,045 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 35 selfloop transitions, 2 changer transitions 15/62 dead transitions. [2024-06-27 16:54:53,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 271 flow [2024-06-27 16:54:53,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:54:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:54:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-06-27 16:54:53,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5260416666666666 [2024-06-27 16:54:53,046 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 132 flow. Second operand 4 states and 101 transitions. [2024-06-27 16:54:53,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 271 flow [2024-06-27 16:54:53,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 269 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:54:53,048 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 144 flow [2024-06-27 16:54:53,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2024-06-27 16:54:53,051 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2024-06-27 16:54:53,051 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 144 flow [2024-06-27 16:54:53,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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:54:53,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:53,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:53,058 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 (7)] Forceful destruction successful, exit code 0 [2024-06-27 16:54:53,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 16:54:53,256 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:54:53,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash -962851582, now seen corresponding path program 1 times [2024-06-27 16:54:53,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:54:53,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521819250] [2024-06-27 16:54:53,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:53,257 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 16:54:53,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:54:53,258 INFO L229 MonitoredProcess]: Starting monitored process 8 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 16:54:53,259 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 (8)] Waiting until timeout for monitored process [2024-06-27 16:54:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:53,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 14 conjunts are in the unsatisfiable core [2024-06-27 16:54:53,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:54:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:54:53,588 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:54:53,768 INFO L349 Elim1Store]: treesize reduction 210, result has 3.2 percent of original size [2024-06-27 16:54:53,769 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 91 treesize of output 28 [2024-06-27 16:54:53,859 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:54:53,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:54:53,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521819250] [2024-06-27 16:54:53,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521819250] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 16:54:53,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:54:53,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-06-27 16:54:53,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575951111] [2024-06-27 16:54:53,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:53,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:54:53,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:54:53,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:54:53,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 16:54:53,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 16:54:53,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:54:53,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:53,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 16:54:53,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:54,218 INFO L124 PetriNetUnfolderBase]: 907/1447 cut-off events. [2024-06-27 16:54:54,218 INFO L125 PetriNetUnfolderBase]: For 448/460 co-relation queries the response was YES. [2024-06-27 16:54:54,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3423 conditions, 1447 events. 907/1447 cut-off events. For 448/460 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7134 event pairs, 160 based on Foata normal form. 0/1364 useless extension candidates. Maximal degree in co-relation 3413. Up to 793 conditions per place. [2024-06-27 16:54:54,226 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 63 selfloop transitions, 5 changer transitions 1/77 dead transitions. [2024-06-27 16:54:54,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 77 transitions, 365 flow [2024-06-27 16:54:54,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:54:54,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:54:54,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-06-27 16:54:54,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 16:54:54,227 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 144 flow. Second operand 5 states and 120 transitions. [2024-06-27 16:54:54,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 77 transitions, 365 flow [2024-06-27 16:54:54,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 77 transitions, 359 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 16:54:54,229 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 164 flow [2024-06-27 16:54:54,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2024-06-27 16:54:54,230 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2024-06-27 16:54:54,230 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 164 flow [2024-06-27 16:54:54,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:54:54,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:54,230 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:54,236 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 (8)] Forceful destruction successful, exit code 0 [2024-06-27 16:54:54,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 16:54:54,439 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:54:54,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:54,440 INFO L85 PathProgramCache]: Analyzing trace with hash -563332786, now seen corresponding path program 1 times [2024-06-27 16:54:54,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:54:54,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253487164] [2024-06-27 16:54:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:54,440 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 16:54:54,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:54:54,441 INFO L229 MonitoredProcess]: Starting monitored process 9 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 16:54:54,444 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 (9)] Waiting until timeout for monitored process [2024-06-27 16:54:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:54,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 13 conjunts are in the unsatisfiable core [2024-06-27 16:54:54,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:54:54,790 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 16:54:54,790 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:54:54,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:54:54,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 10 [2024-06-27 16:54:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:54:55,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:54:55,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253487164] [2024-06-27 16:54:55,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253487164] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:54:55,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:54:55,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-06-27 16:54:55,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448510609] [2024-06-27 16:54:55,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:54:55,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-27 16:54:55,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:54:55,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-27 16:54:55,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-06-27 16:54:55,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:54:55,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 164 flow. Second operand has 14 states, 14 states have (on average 17.0) internal successors, (238), 14 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 16:54:55,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:55,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:54:55,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:55,729 INFO L124 PetriNetUnfolderBase]: 747/1308 cut-off events. [2024-06-27 16:54:55,729 INFO L125 PetriNetUnfolderBase]: For 1129/1204 co-relation queries the response was YES. [2024-06-27 16:54:55,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3362 conditions, 1308 events. 747/1308 cut-off events. For 1129/1204 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6418 event pairs, 387 based on Foata normal form. 42/1295 useless extension candidates. Maximal degree in co-relation 3352. Up to 839 conditions per place. [2024-06-27 16:54:55,736 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 42 selfloop transitions, 4 changer transitions 37/94 dead transitions. [2024-06-27 16:54:55,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 94 transitions, 453 flow [2024-06-27 16:54:55,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 16:54:55,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 16:54:55,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2024-06-27 16:54:55,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-27 16:54:55,737 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 164 flow. Second operand 9 states and 198 transitions. [2024-06-27 16:54:55,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 94 transitions, 453 flow [2024-06-27 16:54:55,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 94 transitions, 446 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 16:54:55,740 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 188 flow [2024-06-27 16:54:55,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=188, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2024-06-27 16:54:55,744 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2024-06-27 16:54:55,745 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 188 flow [2024-06-27 16:54:55,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.0) internal successors, (238), 14 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 16:54:55,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:55,747 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:55,754 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 (9)] Forceful destruction successful, exit code 0 [2024-06-27 16:54:55,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 16:54:55,954 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:54:55,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:55,955 INFO L85 PathProgramCache]: Analyzing trace with hash -222789386, now seen corresponding path program 2 times [2024-06-27 16:54:55,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:54:55,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186346612] [2024-06-27 16:54:55,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:54:55,955 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 16:54:55,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:54:55,956 INFO L229 MonitoredProcess]: Starting monitored process 10 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 16:54:55,958 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 (10)] Waiting until timeout for monitored process [2024-06-27 16:54:56,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:54:56,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:54:56,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 16:54:56,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:54:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:54:56,176 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:54:56,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:54:56,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 10 [2024-06-27 16:54:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:54:56,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:54:56,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186346612] [2024-06-27 16:54:56,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186346612] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:54:56,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:54:56,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 9 [2024-06-27 16:54:56,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068976949] [2024-06-27 16:54:56,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:54:56,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 16:54:56,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:54:56,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 16:54:56,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-27 16:54:56,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:54:56,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 50 transitions, 188 flow. Second operand has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 0 states have call successors, (0), 0 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:54:56,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:56,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:54:56,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:56,881 INFO L124 PetriNetUnfolderBase]: 1153/2065 cut-off events. [2024-06-27 16:54:56,882 INFO L125 PetriNetUnfolderBase]: For 3053/3275 co-relation queries the response was YES. [2024-06-27 16:54:56,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5557 conditions, 2065 events. 1153/2065 cut-off events. For 3053/3275 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 12846 event pairs, 335 based on Foata normal form. 57/2091 useless extension candidates. Maximal degree in co-relation 5542. Up to 597 conditions per place. [2024-06-27 16:54:56,892 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 70 selfloop transitions, 8 changer transitions 0/89 dead transitions. [2024-06-27 16:54:56,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 89 transitions, 474 flow [2024-06-27 16:54:56,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:54:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:54:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-06-27 16:54:56,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5708333333333333 [2024-06-27 16:54:56,894 INFO L175 Difference]: Start difference. First operand has 68 places, 50 transitions, 188 flow. Second operand 5 states and 137 transitions. [2024-06-27 16:54:56,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 89 transitions, 474 flow [2024-06-27 16:54:56,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 89 transitions, 444 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-27 16:54:56,896 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 229 flow [2024-06-27 16:54:56,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-06-27 16:54:56,897 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2024-06-27 16:54:56,897 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 229 flow [2024-06-27 16:54:56,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 0 states have call successors, (0), 0 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:54:56,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:56,897 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:56,906 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 (10)] Forceful destruction successful, exit code 0 [2024-06-27 16:54:57,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 16:54:57,101 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:54:57,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:57,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2122888826, now seen corresponding path program 3 times [2024-06-27 16:54:57,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:54:57,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415031115] [2024-06-27 16:54:57,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:54:57,102 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 16:54:57,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:54:57,103 INFO L229 MonitoredProcess]: Starting monitored process 11 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 16:54:57,106 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 (11)] Waiting until timeout for monitored process [2024-06-27 16:54:57,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-06-27 16:54:57,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:54:57,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 16:54:57,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:54:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 16:54:57,302 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:54:57,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:54:57,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415031115] [2024-06-27 16:54:57,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415031115] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:57,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:54:57,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:54:57,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558612762] [2024-06-27 16:54:57,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:57,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:54:57,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:54:57,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:54:57,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:54:57,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:54:57,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 229 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:54:57,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:57,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:54:57,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:57,588 INFO L124 PetriNetUnfolderBase]: 1227/2401 cut-off events. [2024-06-27 16:54:57,589 INFO L125 PetriNetUnfolderBase]: For 3515/3593 co-relation queries the response was YES. [2024-06-27 16:54:57,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6540 conditions, 2401 events. 1227/2401 cut-off events. For 3515/3593 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 16034 event pairs, 907 based on Foata normal form. 6/2390 useless extension candidates. Maximal degree in co-relation 6526. Up to 1698 conditions per place. [2024-06-27 16:54:57,604 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 43 selfloop transitions, 2 changer transitions 15/71 dead transitions. [2024-06-27 16:54:57,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 71 transitions, 398 flow [2024-06-27 16:54:57,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:54:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:54:57,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-06-27 16:54:57,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5260416666666666 [2024-06-27 16:54:57,605 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 229 flow. Second operand 4 states and 101 transitions. [2024-06-27 16:54:57,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 71 transitions, 398 flow [2024-06-27 16:54:57,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 71 transitions, 391 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 16:54:57,608 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 236 flow [2024-06-27 16:54:57,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2024-06-27 16:54:57,609 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2024-06-27 16:54:57,609 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 236 flow [2024-06-27 16:54:57,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:54:57,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:57,610 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:57,618 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 (11)] Forceful destruction successful, exit code 0 [2024-06-27 16:54:57,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 16:54:57,813 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:54:57,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:57,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2021086142, now seen corresponding path program 1 times [2024-06-27 16:54:57,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:54:57,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318550632] [2024-06-27 16:54:57,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:57,814 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 16:54:57,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:54:57,815 INFO L229 MonitoredProcess]: Starting monitored process 12 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 16:54:57,815 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 (12)] Waiting until timeout for monitored process [2024-06-27 16:54:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:57,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 13 conjunts are in the unsatisfiable core [2024-06-27 16:54:57,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:54:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:54:58,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:54:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:54:58,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:54:58,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318550632] [2024-06-27 16:54:58,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318550632] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:54:58,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:54:58,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-06-27 16:54:58,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099457582] [2024-06-27 16:54:58,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:54:58,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-27 16:54:58,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:54:58,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-27 16:54:58,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-06-27 16:54:58,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:54:58,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 236 flow. Second operand has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 0 states have call successors, (0), 0 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:54:58,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:58,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:54:58,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:59,209 INFO L124 PetriNetUnfolderBase]: 1433/2808 cut-off events. [2024-06-27 16:54:59,209 INFO L125 PetriNetUnfolderBase]: For 4028/4158 co-relation queries the response was YES. [2024-06-27 16:54:59,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7614 conditions, 2808 events. 1433/2808 cut-off events. For 4028/4158 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 19067 event pairs, 797 based on Foata normal form. 147/2937 useless extension candidates. Maximal degree in co-relation 7598. Up to 1554 conditions per place. [2024-06-27 16:54:59,222 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 45 selfloop transitions, 5 changer transitions 39/100 dead transitions. [2024-06-27 16:54:59,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 100 transitions, 584 flow [2024-06-27 16:54:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 16:54:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 16:54:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions. [2024-06-27 16:54:59,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44675925925925924 [2024-06-27 16:54:59,224 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 236 flow. Second operand 9 states and 193 transitions. [2024-06-27 16:54:59,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 100 transitions, 584 flow [2024-06-27 16:54:59,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 100 transitions, 576 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 16:54:59,227 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 258 flow [2024-06-27 16:54:59,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=258, PETRI_PLACES=77, PETRI_TRANSITIONS=57} [2024-06-27 16:54:59,228 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 31 predicate places. [2024-06-27 16:54:59,228 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 258 flow [2024-06-27 16:54:59,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 0 states have call successors, (0), 0 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:54:59,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:59,229 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:59,235 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 (12)] Forceful destruction successful, exit code 0 [2024-06-27 16:54:59,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 16:54:59,433 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:54:59,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:59,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1446725820, now seen corresponding path program 2 times [2024-06-27 16:54:59,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:54:59,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481253897] [2024-06-27 16:54:59,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:54:59,434 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 16:54:59,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:54:59,435 INFO L229 MonitoredProcess]: Starting monitored process 13 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 16:54:59,440 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 (13)] Waiting until timeout for monitored process [2024-06-27 16:54:59,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:54:59,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:54:59,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:54:59,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:54:59,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-06-27 16:54:59,835 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:54:59,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:54:59,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481253897] [2024-06-27 16:54:59,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481253897] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:59,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:54:59,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 16:54:59,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769701256] [2024-06-27 16:54:59,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:59,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 16:54:59,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:54:59,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 16:54:59,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-06-27 16:54:59,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 16:54:59,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:54:59,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:59,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 16:54:59,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:00,662 INFO L124 PetriNetUnfolderBase]: 2345/4141 cut-off events. [2024-06-27 16:55:00,662 INFO L125 PetriNetUnfolderBase]: For 7587/7717 co-relation queries the response was YES. [2024-06-27 16:55:00,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11877 conditions, 4141 events. 2345/4141 cut-off events. For 7587/7717 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 26455 event pairs, 158 based on Foata normal form. 193/4328 useless extension candidates. Maximal degree in co-relation 11858. Up to 2780 conditions per place. [2024-06-27 16:55:00,684 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 79 selfloop transitions, 6 changer transitions 1/95 dead transitions. [2024-06-27 16:55:00,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 95 transitions, 580 flow [2024-06-27 16:55:00,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 16:55:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 16:55:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2024-06-27 16:55:00,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-27 16:55:00,686 INFO L175 Difference]: Start difference. First operand has 77 places, 57 transitions, 258 flow. Second operand 7 states and 148 transitions. [2024-06-27 16:55:00,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 95 transitions, 580 flow [2024-06-27 16:55:00,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 95 transitions, 552 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-27 16:55:00,720 INFO L231 Difference]: Finished difference. Result has 74 places, 59 transitions, 266 flow [2024-06-27 16:55:00,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=266, PETRI_PLACES=74, PETRI_TRANSITIONS=59} [2024-06-27 16:55:00,720 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 28 predicate places. [2024-06-27 16:55:00,720 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 59 transitions, 266 flow [2024-06-27 16:55:00,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:55:00,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:00,721 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:00,727 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 (13)] Forceful destruction successful, exit code 0 [2024-06-27 16:55:00,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 16:55:00,921 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 16:55:00,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:00,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1352960383, now seen corresponding path program 1 times [2024-06-27 16:55:00,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:55:00,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933055195] [2024-06-27 16:55:00,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:00,922 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 16:55:00,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:55:00,923 INFO L229 MonitoredProcess]: Starting monitored process 14 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 16:55:00,924 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 (14)] Waiting until timeout for monitored process [2024-06-27 16:55:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:01,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 16:55:01,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-27 16:55:01,237 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:55:01,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:55:01,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933055195] [2024-06-27 16:55:01,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933055195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:01,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:01,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:55:01,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425931728] [2024-06-27 16:55:01,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:01,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:55:01,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:55:01,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:55:01,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:55:01,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:55:01,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 59 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:01,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:01,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:55:01,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:01,580 INFO L124 PetriNetUnfolderBase]: 1589/3200 cut-off events. [2024-06-27 16:55:01,580 INFO L125 PetriNetUnfolderBase]: For 4990/5160 co-relation queries the response was YES. [2024-06-27 16:55:01,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9010 conditions, 3200 events. 1589/3200 cut-off events. For 4990/5160 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 22015 event pairs, 1216 based on Foata normal form. 2/3142 useless extension candidates. Maximal degree in co-relation 8993. Up to 2210 conditions per place. [2024-06-27 16:55:01,594 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 47 selfloop transitions, 2 changer transitions 15/75 dead transitions. [2024-06-27 16:55:01,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 75 transitions, 456 flow [2024-06-27 16:55:01,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:55:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:55:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-06-27 16:55:01,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5260416666666666 [2024-06-27 16:55:01,595 INFO L175 Difference]: Start difference. First operand has 74 places, 59 transitions, 266 flow. Second operand 4 states and 101 transitions. [2024-06-27 16:55:01,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 75 transitions, 456 flow [2024-06-27 16:55:01,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 75 transitions, 440 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 16:55:01,598 INFO L231 Difference]: Finished difference. Result has 76 places, 60 transitions, 270 flow [2024-06-27 16:55:01,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=270, PETRI_PLACES=76, PETRI_TRANSITIONS=60} [2024-06-27 16:55:01,598 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 30 predicate places. [2024-06-27 16:55:01,598 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 60 transitions, 270 flow [2024-06-27 16:55:01,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:01,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:01,599 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:01,619 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 (14)] Forceful destruction successful, exit code 0 [2024-06-27 16:55:01,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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 16:55:01,820 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 16:55:01,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:01,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1524422611, now seen corresponding path program 1 times [2024-06-27 16:55:01,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:55:01,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418330704] [2024-06-27 16:55:01,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:01,821 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 16:55:01,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:55:01,821 INFO L229 MonitoredProcess]: Starting monitored process 15 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 16:55:01,822 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 (15)] Waiting until timeout for monitored process [2024-06-27 16:55:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:01,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 16:55:01,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-27 16:55:02,039 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:55:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-27 16:55:02,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:55:02,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418330704] [2024-06-27 16:55:02,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418330704] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:55:02,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:55:02,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-06-27 16:55:02,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254766989] [2024-06-27 16:55:02,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:55:02,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 16:55:02,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:55:02,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 16:55:02,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-06-27 16:55:02,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:55:02,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 60 transitions, 270 flow. Second operand has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:55:02,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:02,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:55:02,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:03,123 INFO L124 PetriNetUnfolderBase]: 3124/6418 cut-off events. [2024-06-27 16:55:03,124 INFO L125 PetriNetUnfolderBase]: For 8181/8285 co-relation queries the response was YES. [2024-06-27 16:55:03,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16847 conditions, 6418 events. 3124/6418 cut-off events. For 8181/8285 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 50543 event pairs, 652 based on Foata normal form. 189/6598 useless extension candidates. Maximal degree in co-relation 16827. Up to 1755 conditions per place. [2024-06-27 16:55:03,153 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 90 selfloop transitions, 7 changer transitions 1/109 dead transitions. [2024-06-27 16:55:03,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 109 transitions, 684 flow [2024-06-27 16:55:03,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:55:03,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:55:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-06-27 16:55:03,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5791666666666667 [2024-06-27 16:55:03,155 INFO L175 Difference]: Start difference. First operand has 76 places, 60 transitions, 270 flow. Second operand 5 states and 139 transitions. [2024-06-27 16:55:03,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 109 transitions, 684 flow [2024-06-27 16:55:03,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 109 transitions, 678 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 16:55:03,161 INFO L231 Difference]: Finished difference. Result has 79 places, 64 transitions, 319 flow [2024-06-27 16:55:03,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=79, PETRI_TRANSITIONS=64} [2024-06-27 16:55:03,162 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 33 predicate places. [2024-06-27 16:55:03,162 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 64 transitions, 319 flow [2024-06-27 16:55:03,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:55:03,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:03,162 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:03,170 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 (15)] Forceful destruction successful, exit code 0 [2024-06-27 16:55:03,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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 16:55:03,366 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 16:55:03,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:03,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1869039237, now seen corresponding path program 2 times [2024-06-27 16:55:03,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:55:03,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649825772] [2024-06-27 16:55:03,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:55:03,367 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 16:55:03,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:55:03,368 INFO L229 MonitoredProcess]: Starting monitored process 16 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 16:55:03,369 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 (16)] Waiting until timeout for monitored process [2024-06-27 16:55:03,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:55:03,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:55:03,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 13 conjunts are in the unsatisfiable core [2024-06-27 16:55:03,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:03,873 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-06-27 16:55:03,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:55:04,191 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-06-27 16:55:04,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:55:04,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649825772] [2024-06-27 16:55:04,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649825772] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:55:04,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:55:04,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-06-27 16:55:04,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3869513] [2024-06-27 16:55:04,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:55:04,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 16:55:04,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:55:04,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 16:55:04,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-06-27 16:55:04,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 16:55:04,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 64 transitions, 319 flow. Second operand has 12 states, 12 states have (on average 18.416666666666668) internal successors, (221), 12 states have internal predecessors, (221), 0 states have call successors, (0), 0 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:55:04,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:04,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 16:55:04,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:05,394 INFO L124 PetriNetUnfolderBase]: 3249/6888 cut-off events. [2024-06-27 16:55:05,394 INFO L125 PetriNetUnfolderBase]: For 11948/11981 co-relation queries the response was YES. [2024-06-27 16:55:05,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19487 conditions, 6888 events. 3249/6888 cut-off events. For 11948/11981 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 54556 event pairs, 1807 based on Foata normal form. 27/6837 useless extension candidates. Maximal degree in co-relation 19466. Up to 4453 conditions per place. [2024-06-27 16:55:05,429 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 50 selfloop transitions, 5 changer transitions 31/97 dead transitions. [2024-06-27 16:55:05,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 97 transitions, 635 flow [2024-06-27 16:55:05,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 16:55:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 16:55:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-06-27 16:55:05,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4609375 [2024-06-27 16:55:05,431 INFO L175 Difference]: Start difference. First operand has 79 places, 64 transitions, 319 flow. Second operand 8 states and 177 transitions. [2024-06-27 16:55:05,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 97 transitions, 635 flow [2024-06-27 16:55:05,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 97 transitions, 620 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-27 16:55:05,439 INFO L231 Difference]: Finished difference. Result has 88 places, 65 transitions, 335 flow [2024-06-27 16:55:05,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=335, PETRI_PLACES=88, PETRI_TRANSITIONS=65} [2024-06-27 16:55:05,440 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 42 predicate places. [2024-06-27 16:55:05,440 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 65 transitions, 335 flow [2024-06-27 16:55:05,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.416666666666668) internal successors, (221), 12 states have internal predecessors, (221), 0 states have call successors, (0), 0 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:55:05,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:05,440 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:05,445 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 (16)] Ended with exit code 0 [2024-06-27 16:55:05,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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 16:55:05,645 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 16:55:05,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:05,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1133603715, now seen corresponding path program 3 times [2024-06-27 16:55:05,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:55:05,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131307844] [2024-06-27 16:55:05,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:55:05,646 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 16:55:05,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:55:05,647 INFO L229 MonitoredProcess]: Starting monitored process 17 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 16:55:05,648 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 (17)] Waiting until timeout for monitored process [2024-06-27 16:55:05,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 16:55:05,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:55:05,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 15 conjunts are in the unsatisfiable core [2024-06-27 16:55:05,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-06-27 16:55:06,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:55:28,091 WARN L293 SmtUtils]: Spent 20.60s on a formula simplification. DAG size of input: 917 DAG size of output: 751 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-27 16:55:28,092 INFO L349 Elim1Store]: treesize reduction 626, result has 85.9 percent of original size [2024-06-27 16:55:28,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 276 case distinctions, treesize of input 268 treesize of output 3872 Killed by 15