./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-chromosome-subst.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/chl-chromosome-subst.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 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:32:02,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:32:02,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:32:02,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:32:02,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:32:02,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:32:02,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:32:02,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:32:02,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:32:02,946 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:32:02,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:32:02,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:32:02,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:32:02,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:32:02,949 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:32:02,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:32:02,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:32:02,949 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:32:02,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:32:02,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:32:02,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:32:02,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:32:02,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:32:02,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:32:02,951 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:32:02,951 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:32:02,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:32:02,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:32:02,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:32:02,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:32:02,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:32:02,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:32:02,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:32:02,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:32:02,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:32:02,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:32:02,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:32:02,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:32:02,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:32:02,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:32:02,954 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:32:02,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:32:02,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:32:02,955 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 -> 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c [2024-06-27 16:32:03,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:32:03,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:32:03,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:32:03,165 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:32:03,165 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:32:03,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-subst.wvr.c [2024-06-27 16:32:04,083 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:32:04,276 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:32:04,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-subst.wvr.c [2024-06-27 16:32:04,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a11fc3f6/c50e1e80909d4f8da2b8511d001b17b0/FLAG82ef37306 [2024-06-27 16:32:04,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a11fc3f6/c50e1e80909d4f8da2b8511d001b17b0 [2024-06-27 16:32:04,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:32:04,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:32:04,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:32:04,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:32:04,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:32:04,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:32:04" (1/1) ... [2024-06-27 16:32:04,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e8d1d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:32:04, skipping insertion in model container [2024-06-27 16:32:04,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:32:04" (1/1) ... [2024-06-27 16:32:04,331 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:32:04,499 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/chl-chromosome-subst.wvr.c[3136,3149] [2024-06-27 16:32:04,515 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:32:04,525 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:32:04,570 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/chl-chromosome-subst.wvr.c[3136,3149] [2024-06-27 16:32:04,573 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:32:04,588 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:32:04,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:32:04 WrapperNode [2024-06-27 16:32:04,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:32:04,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:32:04,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:32:04,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:32:04,614 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:32:04" (1/1) ... [2024-06-27 16:32:04,621 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:32:04" (1/1) ... [2024-06-27 16:32:04,643 INFO L138 Inliner]: procedures = 25, calls = 32, calls flagged for inlining = 17, calls inlined = 25, statements flattened = 271 [2024-06-27 16:32:04,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:32:04,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:32:04,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:32:04,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:32:04,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:32:04" (1/1) ... [2024-06-27 16:32:04,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:32:04" (1/1) ... [2024-06-27 16:32:04,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:32:04" (1/1) ... [2024-06-27 16:32:04,668 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 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:32:04,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:32:04" (1/1) ... [2024-06-27 16:32:04,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:32:04" (1/1) ... [2024-06-27 16:32:04,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:32:04" (1/1) ... [2024-06-27 16:32:04,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:32:04" (1/1) ... [2024-06-27 16:32:04,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:32:04" (1/1) ... [2024-06-27 16:32:04,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:32:04" (1/1) ... [2024-06-27 16:32:04,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:32:04,685 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:32:04,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:32:04,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:32:04,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:32:04" (1/1) ... [2024-06-27 16:32:04,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:32:04,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:32:04,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 16:32:04,731 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:32:04,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:32:04,763 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:32:04,764 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:32:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:32:04,764 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:32:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 16:32:04,764 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 16:32:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:32:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 16:32:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 16:32:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 16:32:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 16:32:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:32:04,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:32:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 16:32:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 16:32:04,766 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:32:04,850 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:32:04,851 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:32:05,147 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:32:05,147 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:32:05,394 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:32:05,395 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-06-27 16:32:05,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:32:05 BoogieIcfgContainer [2024-06-27 16:32:05,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:32:05,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:32:05,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:32:05,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:32:05,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:32:04" (1/3) ... [2024-06-27 16:32:05,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e20e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:32:05, skipping insertion in model container [2024-06-27 16:32:05,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:32:04" (2/3) ... [2024-06-27 16:32:05,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e20e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:32:05, skipping insertion in model container [2024-06-27 16:32:05,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:32:05" (3/3) ... [2024-06-27 16:32:05,403 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-subst.wvr.c [2024-06-27 16:32:05,410 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:32:05,417 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:32:05,417 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:32:05,418 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:32:05,453 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-06-27 16:32:05,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2024-06-27 16:32:05,507 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2024-06-27 16:32:05,507 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:32:05,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2024-06-27 16:32:05,511 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2024-06-27 16:32:05,514 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 72 flow [2024-06-27 16:32:05,526 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:32:05,532 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;@2a371591, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:32:05,533 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 16:32:05,543 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:32:05,544 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2024-06-27 16:32:05,544 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:32:05,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:05,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:32:05,546 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:32:05,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:05,550 INFO L85 PathProgramCache]: Analyzing trace with hash 931474529, now seen corresponding path program 1 times [2024-06-27 16:32:05,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:05,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953407388] [2024-06-27 16:32:05,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:05,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:05,967 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:32:05,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:05,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953407388] [2024-06-27 16:32:05,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953407388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:32:05,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:32:05,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:32:05,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571333315] [2024-06-27 16:32:05,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:32:05,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:32:05,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:06,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:32:06,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:32:06,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:06,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:32:06,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:06,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:06,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:06,133 INFO L124 PetriNetUnfolderBase]: 202/302 cut-off events. [2024-06-27 16:32:06,133 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-06-27 16:32:06,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 302 events. 202/302 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 695 event pairs, 124 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 534. Up to 299 conditions per place. [2024-06-27 16:32:06,138 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 23 selfloop transitions, 6 changer transitions 0/30 dead transitions. [2024-06-27 16:32:06,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 136 flow [2024-06-27 16:32:06,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:32:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:32:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2024-06-27 16:32:06,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2024-06-27 16:32:06,150 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 72 flow. Second operand 3 states and 44 transitions. [2024-06-27 16:32:06,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 136 flow [2024-06-27 16:32:06,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 16:32:06,155 INFO L231 Difference]: Finished difference. Result has 28 places, 30 transitions, 92 flow [2024-06-27 16:32:06,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=28, PETRI_TRANSITIONS=30} [2024-06-27 16:32:06,160 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2024-06-27 16:32:06,160 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 30 transitions, 92 flow [2024-06-27 16:32:06,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:32:06,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:06,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:32:06,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:32:06,161 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:32:06,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:06,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1048452415, now seen corresponding path program 1 times [2024-06-27 16:32:06,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:06,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870231691] [2024-06-27 16:32:06,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:06,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:32:06,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:06,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870231691] [2024-06-27 16:32:06,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870231691] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:32:06,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:32:06,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:32:06,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875048300] [2024-06-27 16:32:06,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:32:06,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:32:06,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:06,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:32:06,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:32:06,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:06,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 30 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:32:06,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:06,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:06,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:06,515 INFO L124 PetriNetUnfolderBase]: 341/506 cut-off events. [2024-06-27 16:32:06,515 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-27 16:32:06,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 506 events. 341/506 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1516 event pairs, 124 based on Foata normal form. 1/370 useless extension candidates. Maximal degree in co-relation 1018. Up to 302 conditions per place. [2024-06-27 16:32:06,520 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 39 selfloop transitions, 2 changer transitions 4/46 dead transitions. [2024-06-27 16:32:06,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 46 transitions, 219 flow [2024-06-27 16:32:06,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:32:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:32:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2024-06-27 16:32:06,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5913978494623656 [2024-06-27 16:32:06,523 INFO L175 Difference]: Start difference. First operand has 28 places, 30 transitions, 92 flow. Second operand 3 states and 55 transitions. [2024-06-27 16:32:06,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 46 transitions, 219 flow [2024-06-27 16:32:06,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 46 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:32:06,527 INFO L231 Difference]: Finished difference. Result has 30 places, 31 transitions, 98 flow [2024-06-27 16:32:06,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=30, PETRI_TRANSITIONS=31} [2024-06-27 16:32:06,528 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2024-06-27 16:32:06,528 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 31 transitions, 98 flow [2024-06-27 16:32:06,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:32:06,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:06,529 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:32:06,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:32:06,529 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:32:06,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:06,531 INFO L85 PathProgramCache]: Analyzing trace with hash 855025178, now seen corresponding path program 1 times [2024-06-27 16:32:06,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:06,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728252540] [2024-06-27 16:32:06,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:06,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:32:06,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:06,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728252540] [2024-06-27 16:32:06,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728252540] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:32:06,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047304256] [2024-06-27 16:32:06,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:06,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:32:06,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:32:06,656 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:32:06,680 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:32:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:06,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 16:32:06,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:32:06,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:32:06,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:32:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:32:06,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047304256] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:32:06,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:32:06,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2024-06-27 16:32:06,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986441780] [2024-06-27 16:32:06,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:32:06,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 16:32:06,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:06,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 16:32:06,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2024-06-27 16:32:06,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:06,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 98 flow. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:32:06,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:06,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:06,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:06,912 INFO L124 PetriNetUnfolderBase]: 341/515 cut-off events. [2024-06-27 16:32:06,913 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2024-06-27 16:32:06,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 515 events. 341/515 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1406 event pairs, 228 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 1117. Up to 503 conditions per place. [2024-06-27 16:32:06,915 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 24 selfloop transitions, 15 changer transitions 0/40 dead transitions. [2024-06-27 16:32:06,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 212 flow [2024-06-27 16:32:06,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:32:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:32:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2024-06-27 16:32:06,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269 [2024-06-27 16:32:06,916 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 98 flow. Second operand 6 states and 71 transitions. [2024-06-27 16:32:06,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 212 flow [2024-06-27 16:32:06,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:32:06,917 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 192 flow [2024-06-27 16:32:06,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2024-06-27 16:32:06,918 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2024-06-27 16:32:06,918 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 192 flow [2024-06-27 16:32:06,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:32:06,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:06,919 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:32:06,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-27 16:32:07,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:32:07,130 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:32:07,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:07,131 INFO L85 PathProgramCache]: Analyzing trace with hash -804320266, now seen corresponding path program 2 times [2024-06-27 16:32:07,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:07,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829378026] [2024-06-27 16:32:07,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:07,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-06-27 16:32:07,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:07,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829378026] [2024-06-27 16:32:07,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829378026] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:32:07,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150540509] [2024-06-27 16:32:07,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:32:07,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:32:07,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:32:07,320 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:32:07,321 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:32:07,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-06-27 16:32:07,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:32:07,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:32:07,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:32:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-06-27 16:32:07,500 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:32:07,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150540509] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:32:07,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:32:07,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-06-27 16:32:07,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493442421] [2024-06-27 16:32:07,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:32:07,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:32:07,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:07,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:32:07,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-06-27 16:32:07,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:07,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:32:07,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:07,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:07,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:07,717 INFO L124 PetriNetUnfolderBase]: 681/1011 cut-off events. [2024-06-27 16:32:07,718 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2024-06-27 16:32:07,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2260 conditions, 1011 events. 681/1011 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3588 event pairs, 228 based on Foata normal form. 1/804 useless extension candidates. Maximal degree in co-relation 2171. Up to 539 conditions per place. [2024-06-27 16:32:07,721 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 61 selfloop transitions, 5 changer transitions 1/68 dead transitions. [2024-06-27 16:32:07,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 68 transitions, 403 flow [2024-06-27 16:32:07,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:32:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:32:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2024-06-27 16:32:07,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5564516129032258 [2024-06-27 16:32:07,723 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 192 flow. Second operand 4 states and 69 transitions. [2024-06-27 16:32:07,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 68 transitions, 403 flow [2024-06-27 16:32:07,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 68 transitions, 379 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-06-27 16:32:07,728 INFO L231 Difference]: Finished difference. Result has 41 places, 44 transitions, 201 flow [2024-06-27 16:32:07,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=41, PETRI_TRANSITIONS=44} [2024-06-27 16:32:07,729 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2024-06-27 16:32:07,729 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 44 transitions, 201 flow [2024-06-27 16:32:07,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:32:07,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:07,730 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:32:07,743 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:32:07,941 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,SelfDestructingSolverStorable3 [2024-06-27 16:32:07,941 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:32:07,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:07,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1968055638, now seen corresponding path program 3 times [2024-06-27 16:32:07,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:07,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857533611] [2024-06-27 16:32:07,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:07,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-06-27 16:32:08,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:08,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857533611] [2024-06-27 16:32:08,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857533611] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:32:08,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168821701] [2024-06-27 16:32:08,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:32:08,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:32:08,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:32:08,101 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:32:08,103 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:32:08,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-06-27 16:32:08,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:32:08,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:32:08,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:32:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-06-27 16:32:08,244 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:32:08,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168821701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:32:08,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:32:08,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-06-27 16:32:08,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855843308] [2024-06-27 16:32:08,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:32:08,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:32:08,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:08,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:32:08,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-06-27 16:32:08,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:08,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 201 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:32:08,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:08,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:08,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:08,418 INFO L124 PetriNetUnfolderBase]: 979/1443 cut-off events. [2024-06-27 16:32:08,418 INFO L125 PetriNetUnfolderBase]: For 693/693 co-relation queries the response was YES. [2024-06-27 16:32:08,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3776 conditions, 1443 events. 979/1443 cut-off events. For 693/693 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5421 event pairs, 380 based on Foata normal form. 1/1442 useless extension candidates. Maximal degree in co-relation 3696. Up to 862 conditions per place. [2024-06-27 16:32:08,424 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 61 selfloop transitions, 7 changer transitions 1/70 dead transitions. [2024-06-27 16:32:08,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 70 transitions, 425 flow [2024-06-27 16:32:08,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:32:08,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:32:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2024-06-27 16:32:08,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2024-06-27 16:32:08,425 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 201 flow. Second operand 4 states and 67 transitions. [2024-06-27 16:32:08,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 70 transitions, 425 flow [2024-06-27 16:32:08,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 425 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:32:08,428 INFO L231 Difference]: Finished difference. Result has 46 places, 48 transitions, 250 flow [2024-06-27 16:32:08,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=46, PETRI_TRANSITIONS=48} [2024-06-27 16:32:08,428 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-27 16:32:08,429 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 48 transitions, 250 flow [2024-06-27 16:32:08,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:32:08,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:08,429 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:32:08,442 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:32:08,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:32:08,640 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:32:08,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:08,641 INFO L85 PathProgramCache]: Analyzing trace with hash 76006112, now seen corresponding path program 1 times [2024-06-27 16:32:08,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:08,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722076936] [2024-06-27 16:32:08,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:08,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:08,796 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-06-27 16:32:08,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:08,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722076936] [2024-06-27 16:32:08,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722076936] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:32:08,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218683906] [2024-06-27 16:32:08,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:08,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:32:08,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:32:08,805 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:32:08,830 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:32:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:08,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 16:32:08,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:32:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-06-27 16:32:08,991 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:32:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-06-27 16:32:09,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218683906] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:32:09,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:32:09,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-06-27 16:32:09,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828532627] [2024-06-27 16:32:09,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:32:09,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-27 16:32:09,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:09,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-27 16:32:09,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2024-06-27 16:32:09,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:09,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 48 transitions, 250 flow. Second operand has 17 states, 17 states have (on average 6.588235294117647) internal successors, (112), 17 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:32:09,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:09,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:09,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:09,274 INFO L124 PetriNetUnfolderBase]: 979/1446 cut-off events. [2024-06-27 16:32:09,275 INFO L125 PetriNetUnfolderBase]: For 1506/1506 co-relation queries the response was YES. [2024-06-27 16:32:09,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 1446 events. 979/1446 cut-off events. For 1506/1506 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5403 event pairs, 672 based on Foata normal form. 1/1445 useless extension candidates. Maximal degree in co-relation 4195. Up to 1429 conditions per place. [2024-06-27 16:32:09,282 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 32 selfloop transitions, 18 changer transitions 0/51 dead transitions. [2024-06-27 16:32:09,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 368 flow [2024-06-27 16:32:09,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 16:32:09,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 16:32:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2024-06-27 16:32:09,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3317972350230415 [2024-06-27 16:32:09,284 INFO L175 Difference]: Start difference. First operand has 46 places, 48 transitions, 250 flow. Second operand 7 states and 72 transitions. [2024-06-27 16:32:09,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 368 flow [2024-06-27 16:32:09,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 366 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-27 16:32:09,288 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 316 flow [2024-06-27 16:32:09,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=316, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2024-06-27 16:32:09,290 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2024-06-27 16:32:09,291 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 316 flow [2024-06-27 16:32:09,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.588235294117647) internal successors, (112), 17 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:32:09,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:09,291 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:32:09,304 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:32:09,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:32:09,505 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:32:09,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:09,505 INFO L85 PathProgramCache]: Analyzing trace with hash -292710812, now seen corresponding path program 2 times [2024-06-27 16:32:09,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:09,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765228681] [2024-06-27 16:32:09,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:09,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:09,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:09,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765228681] [2024-06-27 16:32:09,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765228681] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:32:09,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022743010] [2024-06-27 16:32:09,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:32:09,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:32:09,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:32:09,823 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:32:09,824 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:32:09,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:32:09,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:32:09,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-27 16:32:09,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:32:09,993 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:09,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:32:10,028 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:10,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022743010] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 16:32:10,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:32:10,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2024-06-27 16:32:10,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191471529] [2024-06-27 16:32:10,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:32:10,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:32:10,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:10,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:32:10,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 16:32:10,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:10,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:32:10,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:10,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:10,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:10,279 INFO L124 PetriNetUnfolderBase]: 1039/1532 cut-off events. [2024-06-27 16:32:10,279 INFO L125 PetriNetUnfolderBase]: For 1329/1329 co-relation queries the response was YES. [2024-06-27 16:32:10,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4565 conditions, 1532 events. 1039/1532 cut-off events. For 1329/1329 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6085 event pairs, 108 based on Foata normal form. 26/1558 useless extension candidates. Maximal degree in co-relation 4449. Up to 645 conditions per place. [2024-06-27 16:32:10,286 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 77 selfloop transitions, 9 changer transitions 0/87 dead transitions. [2024-06-27 16:32:10,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 617 flow [2024-06-27 16:32:10,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:32:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:32:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2024-06-27 16:32:10,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225806451612903 [2024-06-27 16:32:10,287 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 316 flow. Second operand 5 states and 81 transitions. [2024-06-27 16:32:10,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 617 flow [2024-06-27 16:32:10,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 87 transitions, 581 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 16:32:10,291 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 327 flow [2024-06-27 16:32:10,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=327, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2024-06-27 16:32:10,292 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2024-06-27 16:32:10,292 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 327 flow [2024-06-27 16:32:10,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:32:10,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:10,292 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:32:10,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-06-27 16:32:10,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:32:10,506 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:32:10,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:10,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1818608736, now seen corresponding path program 1 times [2024-06-27 16:32:10,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:10,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421788559] [2024-06-27 16:32:10,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:10,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:10,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:10,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421788559] [2024-06-27 16:32:10,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421788559] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:32:10,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296190272] [2024-06-27 16:32:10,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:10,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:32:10,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:32:10,714 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:32:10,728 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:32:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:10,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 18 conjunts are in the unsatisfiable core [2024-06-27 16:32:10,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:32:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-06-27 16:32:11,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:32:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:11,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296190272] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 16:32:11,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:32:11,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 15 [2024-06-27 16:32:11,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139316075] [2024-06-27 16:32:11,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:32:11,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:32:11,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:11,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:32:11,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-06-27 16:32:11,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:11,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 327 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:11,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:11,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:11,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:11,426 INFO L124 PetriNetUnfolderBase]: 1595/2380 cut-off events. [2024-06-27 16:32:11,427 INFO L125 PetriNetUnfolderBase]: For 4132/4132 co-relation queries the response was YES. [2024-06-27 16:32:11,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7781 conditions, 2380 events. 1595/2380 cut-off events. For 4132/4132 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 10789 event pairs, 318 based on Foata normal form. 1/2381 useless extension candidates. Maximal degree in co-relation 7679. Up to 1194 conditions per place. [2024-06-27 16:32:11,437 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 92 selfloop transitions, 25 changer transitions 3/121 dead transitions. [2024-06-27 16:32:11,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 121 transitions, 932 flow [2024-06-27 16:32:11,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:32:11,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:32:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-27 16:32:11,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.553763440860215 [2024-06-27 16:32:11,439 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 327 flow. Second operand 6 states and 103 transitions. [2024-06-27 16:32:11,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 121 transitions, 932 flow [2024-06-27 16:32:11,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 121 transitions, 892 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-27 16:32:11,447 INFO L231 Difference]: Finished difference. Result has 63 places, 75 transitions, 555 flow [2024-06-27 16:32:11,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=555, PETRI_PLACES=63, PETRI_TRANSITIONS=75} [2024-06-27 16:32:11,449 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 32 predicate places. [2024-06-27 16:32:11,449 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 75 transitions, 555 flow [2024-06-27 16:32:11,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:11,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:11,450 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:32:11,463 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:32:11,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:32:11,656 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:32:11,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:11,657 INFO L85 PathProgramCache]: Analyzing trace with hash 392700814, now seen corresponding path program 2 times [2024-06-27 16:32:11,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:11,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871701540] [2024-06-27 16:32:11,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:11,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-06-27 16:32:11,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:11,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871701540] [2024-06-27 16:32:11,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871701540] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:32:11,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:32:11,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 16:32:11,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205835498] [2024-06-27 16:32:11,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:32:11,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:32:11,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:11,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:32:11,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:32:11,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:11,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 75 transitions, 555 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:11,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:11,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:11,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:12,293 INFO L124 PetriNetUnfolderBase]: 1595/2374 cut-off events. [2024-06-27 16:32:12,294 INFO L125 PetriNetUnfolderBase]: For 6350/6350 co-relation queries the response was YES. [2024-06-27 16:32:12,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9368 conditions, 2374 events. 1595/2374 cut-off events. For 6350/6350 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10409 event pairs, 340 based on Foata normal form. 40/2414 useless extension candidates. Maximal degree in co-relation 9260. Up to 994 conditions per place. [2024-06-27 16:32:12,304 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 79 selfloop transitions, 20 changer transitions 4/104 dead transitions. [2024-06-27 16:32:12,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 104 transitions, 908 flow [2024-06-27 16:32:12,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 16:32:12,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 16:32:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-06-27 16:32:12,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391705069124424 [2024-06-27 16:32:12,306 INFO L175 Difference]: Start difference. First operand has 63 places, 75 transitions, 555 flow. Second operand 7 states and 85 transitions. [2024-06-27 16:32:12,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 104 transitions, 908 flow [2024-06-27 16:32:12,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 104 transitions, 870 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-06-27 16:32:12,318 INFO L231 Difference]: Finished difference. Result has 69 places, 73 transitions, 591 flow [2024-06-27 16:32:12,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=591, PETRI_PLACES=69, PETRI_TRANSITIONS=73} [2024-06-27 16:32:12,319 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 38 predicate places. [2024-06-27 16:32:12,320 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 73 transitions, 591 flow [2024-06-27 16:32:12,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:12,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:12,320 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:32:12,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 16:32:12,320 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:32:12,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:12,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1335172478, now seen corresponding path program 3 times [2024-06-27 16:32:12,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:12,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935090714] [2024-06-27 16:32:12,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:12,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-06-27 16:32:12,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:12,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935090714] [2024-06-27 16:32:12,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935090714] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:32:12,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024749804] [2024-06-27 16:32:12,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:32:12,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:32:12,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:32:12,530 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:32:12,532 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:32:12,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 16:32:12,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:32:12,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 16:32:12,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:32:12,756 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-06-27 16:32:12,756 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:32:12,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024749804] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:32:12,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:32:12,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-06-27 16:32:12,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956254575] [2024-06-27 16:32:12,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:32:12,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:32:12,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:12,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:32:12,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 16:32:12,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:12,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 73 transitions, 591 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:12,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:12,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:12,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:13,030 INFO L124 PetriNetUnfolderBase]: 1206/1790 cut-off events. [2024-06-27 16:32:13,030 INFO L125 PetriNetUnfolderBase]: For 6572/6572 co-relation queries the response was YES. [2024-06-27 16:32:13,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7360 conditions, 1790 events. 1206/1790 cut-off events. For 6572/6572 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7499 event pairs, 269 based on Foata normal form. 16/1806 useless extension candidates. Maximal degree in co-relation 7249. Up to 962 conditions per place. [2024-06-27 16:32:13,040 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 98 selfloop transitions, 11 changer transitions 16/126 dead transitions. [2024-06-27 16:32:13,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 126 transitions, 1150 flow [2024-06-27 16:32:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:32:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:32:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-06-27 16:32:13,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-06-27 16:32:13,042 INFO L175 Difference]: Start difference. First operand has 69 places, 73 transitions, 591 flow. Second operand 6 states and 84 transitions. [2024-06-27 16:32:13,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 126 transitions, 1150 flow [2024-06-27 16:32:13,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 126 transitions, 1100 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-27 16:32:13,054 INFO L231 Difference]: Finished difference. Result has 73 places, 74 transitions, 600 flow [2024-06-27 16:32:13,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=600, PETRI_PLACES=73, PETRI_TRANSITIONS=74} [2024-06-27 16:32:13,055 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 42 predicate places. [2024-06-27 16:32:13,055 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 600 flow [2024-06-27 16:32:13,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:13,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:13,055 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:32:13,070 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:32:13,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:32:13,267 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:32:13,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:13,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1831051926, now seen corresponding path program 4 times [2024-06-27 16:32:13,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:13,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439911144] [2024-06-27 16:32:13,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:13,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:13,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:13,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439911144] [2024-06-27 16:32:13,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439911144] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:32:13,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:32:13,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 16:32:13,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249055565] [2024-06-27 16:32:13,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:32:13,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:32:13,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:13,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:32:13,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:32:13,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:13,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 600 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:13,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:13,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:13,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:13,772 INFO L124 PetriNetUnfolderBase]: 1280/1896 cut-off events. [2024-06-27 16:32:13,772 INFO L125 PetriNetUnfolderBase]: For 6919/6919 co-relation queries the response was YES. [2024-06-27 16:32:13,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8169 conditions, 1896 events. 1280/1896 cut-off events. For 6919/6919 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 7808 event pairs, 346 based on Foata normal form. 28/1920 useless extension candidates. Maximal degree in co-relation 8055. Up to 990 conditions per place. [2024-06-27 16:32:13,791 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 102 selfloop transitions, 15 changer transitions 1/119 dead transitions. [2024-06-27 16:32:13,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 119 transitions, 1060 flow [2024-06-27 16:32:13,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:32:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:32:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-06-27 16:32:13,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2024-06-27 16:32:13,793 INFO L175 Difference]: Start difference. First operand has 73 places, 74 transitions, 600 flow. Second operand 6 states and 88 transitions. [2024-06-27 16:32:13,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 119 transitions, 1060 flow [2024-06-27 16:32:13,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 119 transitions, 1001 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-27 16:32:13,807 INFO L231 Difference]: Finished difference. Result has 74 places, 75 transitions, 612 flow [2024-06-27 16:32:13,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=612, PETRI_PLACES=74, PETRI_TRANSITIONS=75} [2024-06-27 16:32:13,807 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 43 predicate places. [2024-06-27 16:32:13,808 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 612 flow [2024-06-27 16:32:13,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:13,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:13,808 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:32:13,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 16:32:13,808 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:32:13,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:13,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1416161536, now seen corresponding path program 3 times [2024-06-27 16:32:13,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:13,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656100881] [2024-06-27 16:32:13,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:13,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:14,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:14,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656100881] [2024-06-27 16:32:14,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656100881] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:32:14,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359900200] [2024-06-27 16:32:14,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:32:14,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:32:14,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:32:14,038 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:32:14,052 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:32:14,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 16:32:14,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:32:14,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-27 16:32:14,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:32:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:14,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:32:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:14,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359900200] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 16:32:14,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:32:14,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2024-06-27 16:32:14,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672980286] [2024-06-27 16:32:14,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:32:14,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:32:14,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:14,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:32:14,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-27 16:32:14,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:14,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 612 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:32:14,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:14,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:14,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:14,597 INFO L124 PetriNetUnfolderBase]: 1460/2172 cut-off events. [2024-06-27 16:32:14,598 INFO L125 PetriNetUnfolderBase]: For 7092/7092 co-relation queries the response was YES. [2024-06-27 16:32:14,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9025 conditions, 2172 events. 1460/2172 cut-off events. For 7092/7092 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 9384 event pairs, 170 based on Foata normal form. 30/2028 useless extension candidates. Maximal degree in co-relation 8912. Up to 1486 conditions per place. [2024-06-27 16:32:14,613 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 102 selfloop transitions, 20 changer transitions 1/124 dead transitions. [2024-06-27 16:32:14,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 124 transitions, 1122 flow [2024-06-27 16:32:14,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:32:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:32:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2024-06-27 16:32:14,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5096774193548387 [2024-06-27 16:32:14,614 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 612 flow. Second operand 5 states and 79 transitions. [2024-06-27 16:32:14,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 124 transitions, 1122 flow [2024-06-27 16:32:14,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 124 transitions, 1090 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-27 16:32:14,629 INFO L231 Difference]: Finished difference. Result has 76 places, 80 transitions, 700 flow [2024-06-27 16:32:14,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=700, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2024-06-27 16:32:14,630 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 45 predicate places. [2024-06-27 16:32:14,630 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 700 flow [2024-06-27 16:32:14,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:32:14,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:14,631 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:32:14,648 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:32:14,842 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,SelfDestructingSolverStorable11 [2024-06-27 16:32:14,843 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:32:14,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:14,843 INFO L85 PathProgramCache]: Analyzing trace with hash -800982924, now seen corresponding path program 5 times [2024-06-27 16:32:14,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:14,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272412946] [2024-06-27 16:32:14,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:14,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:15,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:15,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272412946] [2024-06-27 16:32:15,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272412946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:32:15,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:32:15,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 16:32:15,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179578412] [2024-06-27 16:32:15,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:32:15,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:32:15,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:15,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:32:15,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:32:15,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:15,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 80 transitions, 700 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:15,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:15,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:15,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:15,385 INFO L124 PetriNetUnfolderBase]: 1400/2074 cut-off events. [2024-06-27 16:32:15,385 INFO L125 PetriNetUnfolderBase]: For 8330/8330 co-relation queries the response was YES. [2024-06-27 16:32:15,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9107 conditions, 2074 events. 1400/2074 cut-off events. For 8330/8330 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 8840 event pairs, 401 based on Foata normal form. 16/1924 useless extension candidates. Maximal degree in co-relation 8992. Up to 1264 conditions per place. [2024-06-27 16:32:15,398 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 98 selfloop transitions, 13 changer transitions 12/124 dead transitions. [2024-06-27 16:32:15,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 124 transitions, 1147 flow [2024-06-27 16:32:15,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:32:15,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:32:15,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2024-06-27 16:32:15,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44623655913978494 [2024-06-27 16:32:15,400 INFO L175 Difference]: Start difference. First operand has 76 places, 80 transitions, 700 flow. Second operand 6 states and 83 transitions. [2024-06-27 16:32:15,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 124 transitions, 1147 flow [2024-06-27 16:32:15,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 124 transitions, 1139 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 16:32:15,416 INFO L231 Difference]: Finished difference. Result has 82 places, 80 transitions, 728 flow [2024-06-27 16:32:15,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=728, PETRI_PLACES=82, PETRI_TRANSITIONS=80} [2024-06-27 16:32:15,417 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2024-06-27 16:32:15,417 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 80 transitions, 728 flow [2024-06-27 16:32:15,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:15,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:15,418 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:32:15,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 16:32:15,418 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:32:15,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:15,418 INFO L85 PathProgramCache]: Analyzing trace with hash 955310886, now seen corresponding path program 4 times [2024-06-27 16:32:15,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:15,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084463551] [2024-06-27 16:32:15,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:15,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:15,613 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:15,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:15,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084463551] [2024-06-27 16:32:15,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084463551] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:32:15,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569935353] [2024-06-27 16:32:15,614 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 16:32:15,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:32:15,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:32:15,615 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:32:15,636 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:32:15,779 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 16:32:15,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:32:15,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 15 conjunts are in the unsatisfiable core [2024-06-27 16:32:15,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:32:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:15,888 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:32:15,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569935353] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:32:15,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:32:15,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-06-27 16:32:15,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390628732] [2024-06-27 16:32:15,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:32:15,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:32:15,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:15,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:32:15,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 16:32:15,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:15,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 80 transitions, 728 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:15,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:15,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:15,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:16,220 INFO L124 PetriNetUnfolderBase]: 1290/1894 cut-off events. [2024-06-27 16:32:16,221 INFO L125 PetriNetUnfolderBase]: For 8215/8215 co-relation queries the response was YES. [2024-06-27 16:32:16,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8753 conditions, 1894 events. 1290/1894 cut-off events. For 8215/8215 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7822 event pairs, 343 based on Foata normal form. 14/1758 useless extension candidates. Maximal degree in co-relation 8635. Up to 1176 conditions per place. [2024-06-27 16:32:16,235 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 105 selfloop transitions, 16 changer transitions 12/134 dead transitions. [2024-06-27 16:32:16,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 134 transitions, 1242 flow [2024-06-27 16:32:16,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 16:32:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 16:32:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-27 16:32:16,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.423963133640553 [2024-06-27 16:32:16,236 INFO L175 Difference]: Start difference. First operand has 82 places, 80 transitions, 728 flow. Second operand 7 states and 92 transitions. [2024-06-27 16:32:16,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 134 transitions, 1242 flow [2024-06-27 16:32:16,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 134 transitions, 1195 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-27 16:32:16,255 INFO L231 Difference]: Finished difference. Result has 82 places, 80 transitions, 722 flow [2024-06-27 16:32:16,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=722, PETRI_PLACES=82, PETRI_TRANSITIONS=80} [2024-06-27 16:32:16,255 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2024-06-27 16:32:16,255 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 80 transitions, 722 flow [2024-06-27 16:32:16,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:16,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:16,256 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:32:16,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-06-27 16:32:16,460 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,SelfDestructingSolverStorable13 [2024-06-27 16:32:16,461 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:32:16,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:16,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1843374610, now seen corresponding path program 6 times [2024-06-27 16:32:16,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:16,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067157327] [2024-06-27 16:32:16,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:16,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:16,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:16,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067157327] [2024-06-27 16:32:16,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067157327] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:32:16,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682642367] [2024-06-27 16:32:16,649 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 16:32:16,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:32:16,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:32:16,650 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:32:16,676 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:32:16,794 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-06-27 16:32:16,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:32:16,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-27 16:32:16,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:32:16,828 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:16,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:32:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:16,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682642367] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 16:32:16,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:32:16,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2024-06-27 16:32:16,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743156463] [2024-06-27 16:32:16,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:32:16,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:32:16,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:16,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:32:16,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-27 16:32:16,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:16,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 80 transitions, 722 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:32:16,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:16,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:16,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:17,149 INFO L124 PetriNetUnfolderBase]: 1310/1928 cut-off events. [2024-06-27 16:32:17,149 INFO L125 PetriNetUnfolderBase]: For 9078/9078 co-relation queries the response was YES. [2024-06-27 16:32:17,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9058 conditions, 1928 events. 1310/1928 cut-off events. For 9078/9078 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7835 event pairs, 225 based on Foata normal form. 28/1802 useless extension candidates. Maximal degree in co-relation 8941. Up to 1158 conditions per place. [2024-06-27 16:32:17,161 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 97 selfloop transitions, 20 changer transitions 2/120 dead transitions. [2024-06-27 16:32:17,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 120 transitions, 1173 flow [2024-06-27 16:32:17,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:32:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:32:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2024-06-27 16:32:17,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5032258064516129 [2024-06-27 16:32:17,163 INFO L175 Difference]: Start difference. First operand has 82 places, 80 transitions, 722 flow. Second operand 5 states and 78 transitions. [2024-06-27 16:32:17,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 120 transitions, 1173 flow [2024-06-27 16:32:17,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 120 transitions, 1122 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 16:32:17,180 INFO L231 Difference]: Finished difference. Result has 82 places, 84 transitions, 787 flow [2024-06-27 16:32:17,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=787, PETRI_PLACES=82, PETRI_TRANSITIONS=84} [2024-06-27 16:32:17,180 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2024-06-27 16:32:17,181 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 84 transitions, 787 flow [2024-06-27 16:32:17,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:32:17,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:17,181 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:32:17,192 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:32:17,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-06-27 16:32:17,383 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:32:17,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:17,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2076939690, now seen corresponding path program 5 times [2024-06-27 16:32:17,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:17,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717351855] [2024-06-27 16:32:17,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:17,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:17,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:17,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717351855] [2024-06-27 16:32:17,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717351855] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:32:17,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:32:17,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 16:32:17,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523475886] [2024-06-27 16:32:17,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:32:17,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:32:17,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:17,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:32:17,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:32:17,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:17,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 84 transitions, 787 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:17,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:17,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:17,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:17,827 INFO L124 PetriNetUnfolderBase]: 1336/1986 cut-off events. [2024-06-27 16:32:17,827 INFO L125 PetriNetUnfolderBase]: For 9913/9913 co-relation queries the response was YES. [2024-06-27 16:32:17,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9469 conditions, 1986 events. 1336/1986 cut-off events. For 9913/9913 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8393 event pairs, 364 based on Foata normal form. 14/1838 useless extension candidates. Maximal degree in co-relation 9351. Up to 1213 conditions per place. [2024-06-27 16:32:17,839 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 86 selfloop transitions, 20 changer transitions 14/121 dead transitions. [2024-06-27 16:32:17,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 121 transitions, 1221 flow [2024-06-27 16:32:17,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:32:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:32:17,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2024-06-27 16:32:17,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2024-06-27 16:32:17,840 INFO L175 Difference]: Start difference. First operand has 82 places, 84 transitions, 787 flow. Second operand 6 states and 81 transitions. [2024-06-27 16:32:17,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 121 transitions, 1221 flow [2024-06-27 16:32:17,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 121 transitions, 1213 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:32:17,857 INFO L231 Difference]: Finished difference. Result has 89 places, 85 transitions, 853 flow [2024-06-27 16:32:17,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=853, PETRI_PLACES=89, PETRI_TRANSITIONS=85} [2024-06-27 16:32:17,858 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 58 predicate places. [2024-06-27 16:32:17,858 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 85 transitions, 853 flow [2024-06-27 16:32:17,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:17,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:17,859 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:32:17,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 16:32:17,859 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:32:17,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:17,860 INFO L85 PathProgramCache]: Analyzing trace with hash 467777006, now seen corresponding path program 6 times [2024-06-27 16:32:17,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:17,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321296737] [2024-06-27 16:32:17,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:17,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:18,045 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:18,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:18,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321296737] [2024-06-27 16:32:18,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321296737] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:32:18,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:32:18,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 16:32:18,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159492912] [2024-06-27 16:32:18,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:32:18,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:32:18,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:18,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:32:18,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:32:18,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:18,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 85 transitions, 853 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:18,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:18,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:18,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:18,306 INFO L124 PetriNetUnfolderBase]: 1266/1884 cut-off events. [2024-06-27 16:32:18,306 INFO L125 PetriNetUnfolderBase]: For 11418/11418 co-relation queries the response was YES. [2024-06-27 16:32:18,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9617 conditions, 1884 events. 1266/1884 cut-off events. For 11418/11418 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 7807 event pairs, 365 based on Foata normal form. 30/1760 useless extension candidates. Maximal degree in co-relation 9495. Up to 1213 conditions per place. [2024-06-27 16:32:18,318 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 93 selfloop transitions, 23 changer transitions 3/120 dead transitions. [2024-06-27 16:32:18,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 120 transitions, 1274 flow [2024-06-27 16:32:18,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:32:18,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:32:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-06-27 16:32:18,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-06-27 16:32:18,319 INFO L175 Difference]: Start difference. First operand has 89 places, 85 transitions, 853 flow. Second operand 6 states and 84 transitions. [2024-06-27 16:32:18,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 120 transitions, 1274 flow [2024-06-27 16:32:18,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 120 transitions, 1232 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-27 16:32:18,342 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 900 flow [2024-06-27 16:32:18,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=900, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2024-06-27 16:32:18,343 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 60 predicate places. [2024-06-27 16:32:18,343 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 900 flow [2024-06-27 16:32:18,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:18,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:18,343 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:32:18,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 16:32:18,344 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:32:18,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:18,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1203199010, now seen corresponding path program 7 times [2024-06-27 16:32:18,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:18,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419520275] [2024-06-27 16:32:18,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:18,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:18,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:18,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419520275] [2024-06-27 16:32:18,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419520275] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:32:18,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:32:18,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 16:32:18,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134100977] [2024-06-27 16:32:18,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:32:18,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:32:18,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:18,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:32:18,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:32:18,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:18,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 900 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:18,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:18,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:18,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:18,812 INFO L124 PetriNetUnfolderBase]: 1212/1794 cut-off events. [2024-06-27 16:32:18,813 INFO L125 PetriNetUnfolderBase]: For 10969/10969 co-relation queries the response was YES. [2024-06-27 16:32:18,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8954 conditions, 1794 events. 1212/1794 cut-off events. For 10969/10969 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7300 event pairs, 349 based on Foata normal form. 14/1662 useless extension candidates. Maximal degree in co-relation 8832. Up to 1213 conditions per place. [2024-06-27 16:32:18,824 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 82 selfloop transitions, 22 changer transitions 14/119 dead transitions. [2024-06-27 16:32:18,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 119 transitions, 1288 flow [2024-06-27 16:32:18,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:32:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:32:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2024-06-27 16:32:18,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2024-06-27 16:32:18,825 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 900 flow. Second operand 6 states and 80 transitions. [2024-06-27 16:32:18,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 119 transitions, 1288 flow [2024-06-27 16:32:18,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 119 transitions, 1230 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 16:32:18,847 INFO L231 Difference]: Finished difference. Result has 93 places, 86 transitions, 874 flow [2024-06-27 16:32:18,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=874, PETRI_PLACES=93, PETRI_TRANSITIONS=86} [2024-06-27 16:32:18,848 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 62 predicate places. [2024-06-27 16:32:18,848 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 86 transitions, 874 flow [2024-06-27 16:32:18,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:18,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:18,849 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:32:18,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 16:32:18,849 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:32:18,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:18,849 INFO L85 PathProgramCache]: Analyzing trace with hash -930086294, now seen corresponding path program 7 times [2024-06-27 16:32:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:18,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803487116] [2024-06-27 16:32:18,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:18,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:19,012 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:32:19,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:19,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803487116] [2024-06-27 16:32:19,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803487116] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:32:19,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:32:19,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 16:32:19,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340374834] [2024-06-27 16:32:19,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:32:19,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:32:19,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:19,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:32:19,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:32:19,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:32:19,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 86 transitions, 874 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:19,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:19,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:32:19,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:19,258 INFO L124 PetriNetUnfolderBase]: 1076/1574 cut-off events. [2024-06-27 16:32:19,258 INFO L125 PetriNetUnfolderBase]: For 9185/9185 co-relation queries the response was YES. [2024-06-27 16:32:19,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7829 conditions, 1574 events. 1076/1574 cut-off events. For 9185/9185 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6041 event pairs, 333 based on Foata normal form. 16/1464 useless extension candidates. Maximal degree in co-relation 7706. Up to 1117 conditions per place. [2024-06-27 16:32:19,268 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 77 selfloop transitions, 23 changer transitions 11/112 dead transitions. [2024-06-27 16:32:19,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 112 transitions, 1206 flow [2024-06-27 16:32:19,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:32:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:32:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2024-06-27 16:32:19,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-27 16:32:19,271 INFO L175 Difference]: Start difference. First operand has 93 places, 86 transitions, 874 flow. Second operand 6 states and 75 transitions. [2024-06-27 16:32:19,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 112 transitions, 1206 flow [2024-06-27 16:32:19,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 112 transitions, 1126 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-27 16:32:19,286 INFO L231 Difference]: Finished difference. Result has 87 places, 85 transitions, 828 flow [2024-06-27 16:32:19,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=828, PETRI_PLACES=87, PETRI_TRANSITIONS=85} [2024-06-27 16:32:19,287 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2024-06-27 16:32:19,287 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 85 transitions, 828 flow [2024-06-27 16:32:19,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:32:19,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:32:19,287 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:32:19,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 16:32:19,287 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:32:19,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:32:19,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1431746618, now seen corresponding path program 1 times [2024-06-27 16:32:19,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:32:19,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520315385] [2024-06-27 16:32:19,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:19,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:32:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-06-27 16:32:19,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:32:19,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520315385] [2024-06-27 16:32:19,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520315385] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:32:19,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119002645] [2024-06-27 16:32:19,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:32:19,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:32:19,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:32:19,466 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:32:19,493 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:32:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:32:19,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 32 conjunts are in the unsatisfiable core [2024-06-27 16:32:19,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:32:19,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:32:19,800 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 40 treesize of output 52 [2024-06-27 16:32:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-06-27 16:32:19,847 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:32:45,820 INFO L349 Elim1Store]: treesize reduction 28, result has 94.9 percent of original size [2024-06-27 16:32:45,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 210 treesize of output 583 [2024-06-27 16:36:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-06-27 16:36:58,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119002645] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:36:58,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:36:58,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 21 [2024-06-27 16:36:58,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125334694] [2024-06-27 16:36:58,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:36:58,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-06-27 16:36:58,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:36:58,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-06-27 16:36:58,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=347, Unknown=6, NotChecked=0, Total=420 [2024-06-27 16:36:58,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:36:58,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 85 transitions, 828 flow. Second operand has 21 states, 21 states have (on average 6.666666666666667) internal successors, (140), 21 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:36:58,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:36:58,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:36:58,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:03,389 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:37:07,401 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 [1] [2024-06-27 16:37:20,316 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:37:24,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:37:28,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:37:29,200 INFO L124 PetriNetUnfolderBase]: 3445/4985 cut-off events. [2024-06-27 16:37:29,200 INFO L125 PetriNetUnfolderBase]: For 23644/23644 co-relation queries the response was YES. [2024-06-27 16:37:29,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23786 conditions, 4985 events. 3445/4985 cut-off events. For 23644/23644 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 24760 event pairs, 227 based on Foata normal form. 7/4472 useless extension candidates. Maximal degree in co-relation 23667. Up to 1375 conditions per place. [2024-06-27 16:37:29,231 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 247 selfloop transitions, 85 changer transitions 105/438 dead transitions. [2024-06-27 16:37:29,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 438 transitions, 5052 flow [2024-06-27 16:37:29,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-06-27 16:37:29,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-06-27 16:37:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 288 transitions. [2024-06-27 16:37:29,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423963133640553 [2024-06-27 16:37:29,233 INFO L175 Difference]: Start difference. First operand has 87 places, 85 transitions, 828 flow. Second operand 21 states and 288 transitions. [2024-06-27 16:37:29,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 438 transitions, 5052 flow [2024-06-27 16:37:29,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 438 transitions, 4683 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 16:37:29,300 INFO L231 Difference]: Finished difference. Result has 115 places, 164 transitions, 1967 flow [2024-06-27 16:37:29,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1967, PETRI_PLACES=115, PETRI_TRANSITIONS=164} [2024-06-27 16:37:29,301 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-06-27 16:37:29,301 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 164 transitions, 1967 flow [2024-06-27 16:37:29,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.666666666666667) internal successors, (140), 21 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:37:29,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:29,301 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:37:29,315 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:37:29,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:37:29,512 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:37:29,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:29,513 INFO L85 PathProgramCache]: Analyzing trace with hash -703857803, now seen corresponding path program 2 times [2024-06-27 16:37:29,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:37:29,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430641347] [2024-06-27 16:37:29,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:29,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:37:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-06-27 16:37:29,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:37:29,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430641347] [2024-06-27 16:37:29,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430641347] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:37:29,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193795601] [2024-06-27 16:37:29,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:37:29,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:37:29,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:37:29,707 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:37:29,707 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:37:29,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:37:29,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:37:29,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 48 conjunts are in the unsatisfiable core [2024-06-27 16:37:29,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:37:30,366 INFO L349 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2024-06-27 16:37:30,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 59 treesize of output 47 [2024-06-27 16:37:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-06-27 16:37:30,445 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:37:36,953 WARN L293 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 810 DAG size of output: 594 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-27 16:37:36,954 INFO L349 Elim1Store]: treesize reduction 792, result has 69.5 percent of original size [2024-06-27 16:37:36,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 22 select indices, 22 select index equivalence classes, 0 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 231 case distinctions, treesize of input 518 treesize of output 1946 [2024-06-27 16:37:48,347 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:37:48,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-06-27 16:37:48,348 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-06-27 16:37:48,362 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:37:48,549 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,SelfDestructingSolverStorable20 [2024-06-27 16:37:48,549 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:140) 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:37:48,553 INFO L158 Benchmark]: Toolchain (without parser) took 344254.96ms. Allocated memory was 174.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 105.9MB in the beginning and 773.1MB in the end (delta: -667.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-06-27 16:37:48,554 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 16:37:48,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.84ms. Allocated memory is still 174.1MB. Free memory was 105.7MB in the beginning and 146.9MB in the end (delta: -41.2MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-06-27 16:37:48,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.82ms. Allocated memory is still 174.1MB. Free memory was 146.9MB in the beginning and 144.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 16:37:48,554 INFO L158 Benchmark]: Boogie Preprocessor took 40.76ms. Allocated memory is still 174.1MB. Free memory was 144.4MB in the beginning and 140.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 16:37:48,554 INFO L158 Benchmark]: RCFGBuilder took 710.78ms. Allocated memory is still 174.1MB. Free memory was 140.9MB in the beginning and 140.8MB in the end (delta: 89.0kB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2024-06-27 16:37:48,555 INFO L158 Benchmark]: TraceAbstraction took 343155.19ms. Allocated memory was 174.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 139.8MB in the beginning and 773.1MB in the end (delta: -633.3MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-06-27 16:37:48,556 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.13ms. Allocated memory is still 104.9MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.84ms. Allocated memory is still 174.1MB. Free memory was 105.7MB in the beginning and 146.9MB in the end (delta: -41.2MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.82ms. Allocated memory is still 174.1MB. Free memory was 146.9MB in the beginning and 144.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.76ms. Allocated memory is still 174.1MB. Free memory was 144.4MB in the beginning and 140.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 710.78ms. Allocated memory is still 174.1MB. Free memory was 140.9MB in the beginning and 140.8MB in the end (delta: 89.0kB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * TraceAbstraction took 343155.19ms. Allocated memory was 174.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 139.8MB in the beginning and 773.1MB in the end (delta: -633.3MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/chl-chromosome-subst.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 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:37:50,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:37:50,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-06-27 16:37:50,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:37:50,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:37:50,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:37:50,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:37:50,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:37:50,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:37:50,334 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:37:50,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:37:50,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:37:50,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:37:50,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:37:50,337 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:37:50,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:37:50,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:37:50,338 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:37:50,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:37:50,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:37:50,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:37:50,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:37:50,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:37:50,339 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-06-27 16:37:50,339 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-06-27 16:37:50,340 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:37:50,340 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-06-27 16:37:50,340 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:37:50,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:37:50,340 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:37:50,341 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:37:50,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:37:50,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:37:50,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:37:50,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:37:50,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:37:50,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:37:50,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:37:50,343 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-06-27 16:37:50,343 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-06-27 16:37:50,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:37:50,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:37:50,344 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:37:50,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:37:50,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:37:50,345 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-06-27 16:37:50,345 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 -> 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c [2024-06-27 16:37:50,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:37:50,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:37:50,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:37:50,616 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:37:50,617 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:37:50,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-subst.wvr.c [2024-06-27 16:37:51,602 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:37:51,765 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:37:51,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-subst.wvr.c [2024-06-27 16:37:51,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4acd484ea/c780243c42a042969ee4f6243ab36e63/FLAG99b74f8e4 [2024-06-27 16:37:51,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4acd484ea/c780243c42a042969ee4f6243ab36e63 [2024-06-27 16:37:51,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:37:51,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:37:51,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:37:51,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:37:51,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:37:51,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:37:51" (1/1) ... [2024-06-27 16:37:51,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d0b644a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:51, skipping insertion in model container [2024-06-27 16:37:51,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:37:51" (1/1) ... [2024-06-27 16:37:51,821 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:37:51,986 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/chl-chromosome-subst.wvr.c[3136,3149] [2024-06-27 16:37:52,006 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:37:52,016 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-06-27 16:37:52,023 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:37:52,041 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/chl-chromosome-subst.wvr.c[3136,3149] [2024-06-27 16:37:52,046 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:37:52,052 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:37:52,081 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/chl-chromosome-subst.wvr.c[3136,3149] [2024-06-27 16:37:52,086 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:37:52,100 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:37:52,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:52 WrapperNode [2024-06-27 16:37:52,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:37:52,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:37:52,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:37:52,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:37:52,107 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:37:52" (1/1) ... [2024-06-27 16:37:52,125 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:37:52" (1/1) ... [2024-06-27 16:37:52,147 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 17, calls inlined = 25, statements flattened = 265 [2024-06-27 16:37:52,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:37:52,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:37:52,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:37:52,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:37:52,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:52" (1/1) ... [2024-06-27 16:37:52,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:52" (1/1) ... [2024-06-27 16:37:52,177 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:52" (1/1) ... [2024-06-27 16:37:52,195 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 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:37:52,200 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:52" (1/1) ... [2024-06-27 16:37:52,200 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:52" (1/1) ... [2024-06-27 16:37:52,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:52" (1/1) ... [2024-06-27 16:37:52,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:52" (1/1) ... [2024-06-27 16:37:52,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:52" (1/1) ... [2024-06-27 16:37:52,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:52" (1/1) ... [2024-06-27 16:37:52,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:37:52,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:37:52,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:37:52,219 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:37:52,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:52" (1/1) ... [2024-06-27 16:37:52,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:37:52,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:37:52,250 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:37:52,272 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:37:52,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:37:52,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-06-27 16:37:52,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-06-27 16:37:52,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-06-27 16:37:52,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-06-27 16:37:52,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:37:52,296 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:37:52,296 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:37:52,296 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:37:52,296 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 16:37:52,296 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 16:37:52,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 16:37:52,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:37:52,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:37:52,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-06-27 16:37:52,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-06-27 16:37:52,298 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:37:52,379 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:37:52,381 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:37:52,721 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:37:52,721 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:37:53,035 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:37:53,035 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-06-27 16:37:53,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:37:53 BoogieIcfgContainer [2024-06-27 16:37:53,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:37:53,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:37:53,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:37:53,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:37:53,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:37:51" (1/3) ... [2024-06-27 16:37:53,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce8a724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:37:53, skipping insertion in model container [2024-06-27 16:37:53,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:52" (2/3) ... [2024-06-27 16:37:53,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce8a724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:37:53, skipping insertion in model container [2024-06-27 16:37:53,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:37:53" (3/3) ... [2024-06-27 16:37:53,042 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-subst.wvr.c [2024-06-27 16:37:53,049 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:37:53,056 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:37:53,056 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:37:53,057 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:37:53,134 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-06-27 16:37:53,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2024-06-27 16:37:53,189 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2024-06-27 16:37:53,190 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:37:53,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2024-06-27 16:37:53,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2024-06-27 16:37:53,196 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 72 flow [2024-06-27 16:37:53,206 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:37:53,210 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;@190a4cac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:37:53,210 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 16:37:53,222 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:37:53,224 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2024-06-27 16:37:53,224 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:37:53,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:53,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:37:53,226 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:37:53,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:53,229 INFO L85 PathProgramCache]: Analyzing trace with hash -853670699, now seen corresponding path program 1 times [2024-06-27 16:37:53,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:37:53,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404063796] [2024-06-27 16:37:53,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:53,241 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:37:53,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:37:53,243 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:37:53,244 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:37:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:53,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 16:37:53,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:37:53,435 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:37:53,436 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:37:53,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:37:53,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404063796] [2024-06-27 16:37:53,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404063796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:53,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:53,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:37:53,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367834773] [2024-06-27 16:37:53,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:53,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:37:53,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:37:53,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:37:53,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:37:53,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:53,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:37:53,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:53,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:53,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:53,650 INFO L124 PetriNetUnfolderBase]: 202/302 cut-off events. [2024-06-27 16:37:53,650 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-06-27 16:37:53,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 302 events. 202/302 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 693 event pairs, 124 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 534. Up to 299 conditions per place. [2024-06-27 16:37:53,655 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 23 selfloop transitions, 6 changer transitions 0/30 dead transitions. [2024-06-27 16:37:53,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 136 flow [2024-06-27 16:37:53,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:37:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:37:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2024-06-27 16:37:53,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2024-06-27 16:37:53,666 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 72 flow. Second operand 3 states and 44 transitions. [2024-06-27 16:37:53,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 136 flow [2024-06-27 16:37:53,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 16:37:53,671 INFO L231 Difference]: Finished difference. Result has 28 places, 30 transitions, 92 flow [2024-06-27 16:37:53,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=28, PETRI_TRANSITIONS=30} [2024-06-27 16:37:53,675 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2024-06-27 16:37:53,675 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 30 transitions, 92 flow [2024-06-27 16:37:53,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:37:53,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:53,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:37:53,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-06-27 16:37:53,876 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:37:53,877 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:37:53,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:53,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1165032837, now seen corresponding path program 1 times [2024-06-27 16:37:53,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:37:53,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480030985] [2024-06-27 16:37:53,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:53,878 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:37:53,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:37:53,880 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:37:53,908 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:37:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:54,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 16:37:54,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:37:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:37:54,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:37:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:37:54,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:37:54,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480030985] [2024-06-27 16:37:54,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480030985] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:37:54,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:37:54,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-06-27 16:37:54,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388924151] [2024-06-27 16:37:54,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:37:54,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:37:54,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:37:54,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:37:54,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:37:54,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:54,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 30 transitions, 92 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 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:37:54,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:54,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:54,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:54,306 INFO L124 PetriNetUnfolderBase]: 202/311 cut-off events. [2024-06-27 16:37:54,306 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-27 16:37:54,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 311 events. 202/311 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 695 event pairs, 124 based on Foata normal form. 6/241 useless extension candidates. Maximal degree in co-relation 611. Up to 299 conditions per place. [2024-06-27 16:37:54,308 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 23 selfloop transitions, 15 changer transitions 0/39 dead transitions. [2024-06-27 16:37:54,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 204 flow [2024-06-27 16:37:54,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:37:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:37:54,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2024-06-27 16:37:54,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269 [2024-06-27 16:37:54,310 INFO L175 Difference]: Start difference. First operand has 28 places, 30 transitions, 92 flow. Second operand 6 states and 71 transitions. [2024-06-27 16:37:54,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 204 flow [2024-06-27 16:37:54,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:37:54,312 INFO L231 Difference]: Finished difference. Result has 35 places, 39 transitions, 182 flow [2024-06-27 16:37:54,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=35, PETRI_TRANSITIONS=39} [2024-06-27 16:37:54,312 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-27 16:37:54,313 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 39 transitions, 182 flow [2024-06-27 16:37:54,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 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:37:54,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:54,313 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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:37:54,321 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:37:54,516 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:37:54,516 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:37:54,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2028471641, now seen corresponding path program 2 times [2024-06-27 16:37:54,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:37:54,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453601658] [2024-06-27 16:37:54,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:37:54,517 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:37:54,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:37:54,518 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:37:54,520 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:37:54,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-06-27 16:37:54,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:37:54,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 16:37:54,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:37:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-06-27 16:37:54,678 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:37:54,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:37:54,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453601658] [2024-06-27 16:37:54,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453601658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:54,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:54,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:37:54,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477931200] [2024-06-27 16:37:54,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:54,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:37:54,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:37:54,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:37:54,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:37:54,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:54,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 39 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:37:54,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:54,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:54,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:54,911 INFO L124 PetriNetUnfolderBase]: 331/507 cut-off events. [2024-06-27 16:37:54,911 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-06-27 16:37:54,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 507 events. 331/507 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1506 event pairs, 124 based on Foata normal form. 10/379 useless extension candidates. Maximal degree in co-relation 1001. Up to 311 conditions per place. [2024-06-27 16:37:54,916 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 58 selfloop transitions, 3 changer transitions 4/66 dead transitions. [2024-06-27 16:37:54,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 66 transitions, 373 flow [2024-06-27 16:37:54,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:37:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:37:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2024-06-27 16:37:54,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5645161290322581 [2024-06-27 16:37:54,919 INFO L175 Difference]: Start difference. First operand has 35 places, 39 transitions, 182 flow. Second operand 4 states and 70 transitions. [2024-06-27 16:37:54,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 66 transitions, 373 flow [2024-06-27 16:37:54,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 66 transitions, 349 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-06-27 16:37:54,924 INFO L231 Difference]: Finished difference. Result has 39 places, 41 transitions, 178 flow [2024-06-27 16:37:54,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=39, PETRI_TRANSITIONS=41} [2024-06-27 16:37:54,926 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2024-06-27 16:37:54,926 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 41 transitions, 178 flow [2024-06-27 16:37:54,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:37:54,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:54,926 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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:37:54,946 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:37:55,129 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:37:55,129 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:37:55,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:55,130 INFO L85 PathProgramCache]: Analyzing trace with hash -916943749, now seen corresponding path program 3 times [2024-06-27 16:37:55,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:37:55,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485950063] [2024-06-27 16:37:55,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:37:55,131 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:37:55,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:37:55,132 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:37:55,135 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:37:55,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-06-27 16:37:55,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:37:55,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 16:37:55,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:37:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-06-27 16:37:55,248 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:37:55,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:37:55,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485950063] [2024-06-27 16:37:55,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485950063] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:55,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:55,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:37:55,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275332109] [2024-06-27 16:37:55,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:55,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:37:55,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:37:55,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:37:55,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:37:55,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:55,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 41 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:37:55,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:55,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:55,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:55,453 INFO L124 PetriNetUnfolderBase]: 361/549 cut-off events. [2024-06-27 16:37:55,453 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2024-06-27 16:37:55,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 549 events. 361/549 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1566 event pairs, 96 based on Foata normal form. 12/439 useless extension candidates. Maximal degree in co-relation 1319. Up to 304 conditions per place. [2024-06-27 16:37:55,456 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 52 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2024-06-27 16:37:55,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 349 flow [2024-06-27 16:37:55,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:37:55,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:37:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2024-06-27 16:37:55,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47580645161290325 [2024-06-27 16:37:55,457 INFO L175 Difference]: Start difference. First operand has 39 places, 41 transitions, 178 flow. Second operand 4 states and 59 transitions. [2024-06-27 16:37:55,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 349 flow [2024-06-27 16:37:55,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 59 transitions, 338 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 16:37:55,459 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 203 flow [2024-06-27 16:37:55,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2024-06-27 16:37:55,459 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2024-06-27 16:37:55,460 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 203 flow [2024-06-27 16:37:55,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:37:55,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:55,460 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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:37:55,465 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:37:55,662 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:37:55,663 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:37:55,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:55,663 INFO L85 PathProgramCache]: Analyzing trace with hash -916755949, now seen corresponding path program 4 times [2024-06-27 16:37:55,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:37:55,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490710342] [2024-06-27 16:37:55,664 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 16:37:55,664 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:37:55,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:37:55,665 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:37:55,669 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:37:55,779 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 16:37:55,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:37:55,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:37:55,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:37:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-06-27 16:37:55,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:37:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-06-27 16:37:55,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:37:55,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490710342] [2024-06-27 16:37:55,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490710342] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:37:55,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:37:55,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-06-27 16:37:55,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145627002] [2024-06-27 16:37:55,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:37:55,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 16:37:55,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:37:55,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 16:37:55,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-06-27 16:37:55,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:55,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 203 flow. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 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:37:55,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:55,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:55,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:56,244 INFO L124 PetriNetUnfolderBase]: 361/552 cut-off events. [2024-06-27 16:37:56,245 INFO L125 PetriNetUnfolderBase]: For 422/422 co-relation queries the response was YES. [2024-06-27 16:37:56,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1481 conditions, 552 events. 361/552 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1567 event pairs, 226 based on Foata normal form. 1/431 useless extension candidates. Maximal degree in co-relation 1387. Up to 536 conditions per place. [2024-06-27 16:37:56,247 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 27 selfloop transitions, 18 changer transitions 0/46 dead transitions. [2024-06-27 16:37:56,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 311 flow [2024-06-27 16:37:56,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 16:37:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 16:37:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2024-06-27 16:37:56,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3317972350230415 [2024-06-27 16:37:56,248 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 203 flow. Second operand 7 states and 72 transitions. [2024-06-27 16:37:56,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 311 flow [2024-06-27 16:37:56,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:37:56,250 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 268 flow [2024-06-27 16:37:56,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=268, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2024-06-27 16:37:56,251 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2024-06-27 16:37:56,251 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 268 flow [2024-06-27 16:37:56,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 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:37:56,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:56,251 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:37:56,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-06-27 16:37:56,454 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:37:56,456 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:37:56,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:56,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1313552583, now seen corresponding path program 5 times [2024-06-27 16:37:56,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:37:56,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291146547] [2024-06-27 16:37:56,457 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 16:37:56,457 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:37:56,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:37:56,458 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:37:56,461 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:37:56,698 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-06-27 16:37:56,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:37:56,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 16:37:56,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:37:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-06-27 16:37:56,752 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:37:56,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:37:56,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291146547] [2024-06-27 16:37:56,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291146547] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:56,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:56,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:37:56,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775726047] [2024-06-27 16:37:56,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:56,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:37:56,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:37:56,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:37:56,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:37:56,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:56,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 268 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:37:56,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:56,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:56,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:56,959 INFO L124 PetriNetUnfolderBase]: 317/485 cut-off events. [2024-06-27 16:37:56,959 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2024-06-27 16:37:56,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 485 events. 317/485 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1372 event pairs, 112 based on Foata normal form. 12/393 useless extension candidates. Maximal degree in co-relation 1223. Up to 326 conditions per place. [2024-06-27 16:37:56,962 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 56 selfloop transitions, 6 changer transitions 3/66 dead transitions. [2024-06-27 16:37:56,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 66 transitions, 448 flow [2024-06-27 16:37:56,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:37:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:37:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-06-27 16:37:56,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5241935483870968 [2024-06-27 16:37:56,964 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 268 flow. Second operand 4 states and 65 transitions. [2024-06-27 16:37:56,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 66 transitions, 448 flow [2024-06-27 16:37:56,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 412 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 16:37:56,966 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 253 flow [2024-06-27 16:37:56,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2024-06-27 16:37:56,969 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2024-06-27 16:37:56,970 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 253 flow [2024-06-27 16:37:56,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:37:56,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:56,970 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:37:56,991 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:37:57,176 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:37:57,176 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:37:57,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:57,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1476689002, now seen corresponding path program 1 times [2024-06-27 16:37:57,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:37:57,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380803835] [2024-06-27 16:37:57,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:57,177 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:37:57,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:37:57,179 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:37:57,192 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:37:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:57,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 16:37:57,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:37:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-06-27 16:37:57,484 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:37:57,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:37:57,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380803835] [2024-06-27 16:37:57,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380803835] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:57,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:57,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 16:37:57,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665711779] [2024-06-27 16:37:57,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:57,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 16:37:57,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:37:57,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 16:37:57,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 16:37:57,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:57,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 253 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:37:57,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:57,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:57,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:57,887 INFO L124 PetriNetUnfolderBase]: 578/860 cut-off events. [2024-06-27 16:37:57,887 INFO L125 PetriNetUnfolderBase]: For 1072/1072 co-relation queries the response was YES. [2024-06-27 16:37:57,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2473 conditions, 860 events. 578/860 cut-off events. For 1072/1072 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2920 event pairs, 167 based on Foata normal form. 1/642 useless extension candidates. Maximal degree in co-relation 2375. Up to 451 conditions per place. [2024-06-27 16:37:57,891 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 84 selfloop transitions, 12 changer transitions 16/113 dead transitions. [2024-06-27 16:37:57,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 113 transitions, 791 flow [2024-06-27 16:37:57,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 16:37:57,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 16:37:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2024-06-27 16:37:57,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4435483870967742 [2024-06-27 16:37:57,893 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 253 flow. Second operand 8 states and 110 transitions. [2024-06-27 16:37:57,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 113 transitions, 791 flow [2024-06-27 16:37:57,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 113 transitions, 719 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-27 16:37:57,896 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 333 flow [2024-06-27 16:37:57,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=333, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2024-06-27 16:37:57,897 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2024-06-27 16:37:57,897 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 333 flow [2024-06-27 16:37:57,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:37:57,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:57,897 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:37:57,918 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:37:58,107 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:37:58,108 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:37:58,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:58,108 INFO L85 PathProgramCache]: Analyzing trace with hash -908079256, now seen corresponding path program 2 times [2024-06-27 16:37:58,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:37:58,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59885536] [2024-06-27 16:37:58,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:37:58,109 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:37:58,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:37:58,110 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:37:58,122 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:37:58,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-06-27 16:37:58,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:37:58,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:37:58,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:37:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:37:58,260 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:37:58,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:37:58,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59885536] [2024-06-27 16:37:58,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59885536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:58,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:58,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 16:37:58,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776500793] [2024-06-27 16:37:58,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:58,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:37:58,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:37:58,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:37:58,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:37:58,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:58,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 333 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:37:58,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:58,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:58,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:58,549 INFO L124 PetriNetUnfolderBase]: 852/1253 cut-off events. [2024-06-27 16:37:58,549 INFO L125 PetriNetUnfolderBase]: For 2084/2084 co-relation queries the response was YES. [2024-06-27 16:37:58,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4452 conditions, 1253 events. 852/1253 cut-off events. For 2084/2084 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4486 event pairs, 277 based on Foata normal form. 1/1100 useless extension candidates. Maximal degree in co-relation 4349. Up to 744 conditions per place. [2024-06-27 16:37:58,555 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 75 selfloop transitions, 10 changer transitions 1/87 dead transitions. [2024-06-27 16:37:58,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 87 transitions, 646 flow [2024-06-27 16:37:58,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:37:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:37:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2024-06-27 16:37:58,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2024-06-27 16:37:58,556 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 333 flow. Second operand 4 states and 67 transitions. [2024-06-27 16:37:58,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 87 transitions, 646 flow [2024-06-27 16:37:58,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 87 transitions, 623 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-27 16:37:58,561 INFO L231 Difference]: Finished difference. Result has 59 places, 61 transitions, 380 flow [2024-06-27 16:37:58,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=380, PETRI_PLACES=59, PETRI_TRANSITIONS=61} [2024-06-27 16:37:58,562 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 28 predicate places. [2024-06-27 16:37:58,562 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 61 transitions, 380 flow [2024-06-27 16:37:58,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:37:58,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:58,562 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:37:58,567 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:37:58,764 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:37:58,765 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:37:58,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:58,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1889262168, now seen corresponding path program 3 times [2024-06-27 16:37:58,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:37:58,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574764439] [2024-06-27 16:37:58,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:37:58,766 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:37:58,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:37:58,767 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:37:58,797 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:37:58,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-06-27 16:37:58,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:37:58,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:37:58,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:37:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:37:58,950 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:37:58,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:37:58,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574764439] [2024-06-27 16:37:58,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574764439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:58,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:58,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 16:37:58,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105173535] [2024-06-27 16:37:58,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:58,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:37:58,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:37:58,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:37:58,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:37:58,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:58,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 61 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:37:58,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:58,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:58,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:59,335 INFO L124 PetriNetUnfolderBase]: 846/1258 cut-off events. [2024-06-27 16:37:59,335 INFO L125 PetriNetUnfolderBase]: For 2481/2481 co-relation queries the response was YES. [2024-06-27 16:37:59,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4668 conditions, 1258 events. 846/1258 cut-off events. For 2481/2481 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4691 event pairs, 338 based on Foata normal form. 13/1138 useless extension candidates. Maximal degree in co-relation 4564. Up to 908 conditions per place. [2024-06-27 16:37:59,341 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 76 selfloop transitions, 11 changer transitions 21/109 dead transitions. [2024-06-27 16:37:59,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 109 transitions, 812 flow [2024-06-27 16:37:59,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 16:37:59,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 16:37:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2024-06-27 16:37:59,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46543778801843316 [2024-06-27 16:37:59,342 INFO L175 Difference]: Start difference. First operand has 59 places, 61 transitions, 380 flow. Second operand 7 states and 101 transitions. [2024-06-27 16:37:59,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 109 transitions, 812 flow [2024-06-27 16:37:59,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 109 transitions, 812 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:37:59,347 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 394 flow [2024-06-27 16:37:59,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=394, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2024-06-27 16:37:59,348 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 36 predicate places. [2024-06-27 16:37:59,348 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 394 flow [2024-06-27 16:37:59,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:37:59,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:59,348 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:37:59,353 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:37:59,551 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:37:59,551 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:37:59,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:59,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1795649916, now seen corresponding path program 1 times [2024-06-27 16:37:59,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:37:59,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755356376] [2024-06-27 16:37:59,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:59,552 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:37:59,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:37:59,553 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:37:59,554 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:37:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:59,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 16:37:59,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:37:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:37:59,802 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:37:59,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:37:59,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755356376] [2024-06-27 16:37:59,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755356376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:59,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:59,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 16:37:59,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126740340] [2024-06-27 16:37:59,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:59,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:37:59,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:37:59,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:37:59,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:37:59,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:59,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 394 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:37:59,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:59,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:59,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:38:00,173 INFO L124 PetriNetUnfolderBase]: 851/1248 cut-off events. [2024-06-27 16:38:00,174 INFO L125 PetriNetUnfolderBase]: For 2948/2948 co-relation queries the response was YES. [2024-06-27 16:38:00,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4931 conditions, 1248 events. 851/1248 cut-off events. For 2948/2948 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4445 event pairs, 154 based on Foata normal form. 22/1139 useless extension candidates. Maximal degree in co-relation 4890. Up to 493 conditions per place. [2024-06-27 16:38:00,181 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 79 selfloop transitions, 12 changer transitions 1/93 dead transitions. [2024-06-27 16:38:00,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 93 transitions, 745 flow [2024-06-27 16:38:00,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:38:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:38:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2024-06-27 16:38:00,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4967741935483871 [2024-06-27 16:38:00,182 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 394 flow. Second operand 5 states and 77 transitions. [2024-06-27 16:38:00,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 93 transitions, 745 flow [2024-06-27 16:38:00,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 705 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 16:38:00,190 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 420 flow [2024-06-27 16:38:00,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=420, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2024-06-27 16:38:00,191 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 34 predicate places. [2024-06-27 16:38:00,191 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 420 flow [2024-06-27 16:38:00,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:38:00,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:38:00,191 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:38:00,197 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:38:00,396 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:38:00,397 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:38:00,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:38:00,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1032888172, now seen corresponding path program 1 times [2024-06-27 16:38:00,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:38:00,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907958400] [2024-06-27 16:38:00,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:38:00,398 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:38:00,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:38:00,399 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:38:00,399 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:38:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:38:00,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 16:38:00,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:38:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:38:00,652 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:38:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:38:00,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:38:00,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907958400] [2024-06-27 16:38:00,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907958400] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 16:38:00,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:38:00,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-06-27 16:38:00,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621457922] [2024-06-27 16:38:00,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:38:00,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:38:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:38:00,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:38:00,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 16:38:00,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:38:00,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 420 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:38:00,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:38:00,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:38:00,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:38:01,018 INFO L124 PetriNetUnfolderBase]: 906/1326 cut-off events. [2024-06-27 16:38:01,019 INFO L125 PetriNetUnfolderBase]: For 4000/4000 co-relation queries the response was YES. [2024-06-27 16:38:01,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5316 conditions, 1326 events. 906/1326 cut-off events. For 4000/4000 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4995 event pairs, 87 based on Foata normal form. 23/1203 useless extension candidates. Maximal degree in co-relation 5208. Up to 547 conditions per place. [2024-06-27 16:38:01,026 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 91 selfloop transitions, 12 changer transitions 0/104 dead transitions. [2024-06-27 16:38:01,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 104 transitions, 857 flow [2024-06-27 16:38:01,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:38:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:38:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2024-06-27 16:38:01,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225806451612903 [2024-06-27 16:38:01,028 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 420 flow. Second operand 5 states and 81 transitions. [2024-06-27 16:38:01,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 104 transitions, 857 flow [2024-06-27 16:38:01,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 104 transitions, 833 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 16:38:01,038 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 484 flow [2024-06-27 16:38:01,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=484, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-06-27 16:38:01,038 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 38 predicate places. [2024-06-27 16:38:01,038 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 484 flow [2024-06-27 16:38:01,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:38:01,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:38:01,039 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:38:01,053 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:38:01,244 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:38:01,245 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:38:01,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:38:01,245 INFO L85 PathProgramCache]: Analyzing trace with hash 414394544, now seen corresponding path program 2 times [2024-06-27 16:38:01,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:38:01,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794719676] [2024-06-27 16:38:01,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:38:01,246 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:38:01,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:38:01,247 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:38:01,247 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:38:01,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:38:01,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:38:01,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 16:38:01,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:38:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:38:01,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:38:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:38:01,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:38:01,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794719676] [2024-06-27 16:38:01,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794719676] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:38:01,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:38:01,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-06-27 16:38:01,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948663027] [2024-06-27 16:38:01,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:38:01,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 16:38:01,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:38:01,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 16:38:01,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 16:38:01,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:38:01,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 484 flow. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:38:01,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:38:01,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:38:01,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:38:02,335 INFO L124 PetriNetUnfolderBase]: 2172/3177 cut-off events. [2024-06-27 16:38:02,335 INFO L125 PetriNetUnfolderBase]: For 13397/13397 co-relation queries the response was YES. [2024-06-27 16:38:02,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13200 conditions, 3177 events. 2172/3177 cut-off events. For 13397/13397 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 14740 event pairs, 319 based on Foata normal form. 9/2716 useless extension candidates. Maximal degree in co-relation 13089. Up to 893 conditions per place. [2024-06-27 16:38:02,352 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 159 selfloop transitions, 8 changer transitions 90/258 dead transitions. [2024-06-27 16:38:02,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 258 transitions, 2551 flow [2024-06-27 16:38:02,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 16:38:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 16:38:02,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-27 16:38:02,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5663082437275986 [2024-06-27 16:38:02,353 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 484 flow. Second operand 9 states and 158 transitions. [2024-06-27 16:38:02,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 258 transitions, 2551 flow [2024-06-27 16:38:02,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 258 transitions, 2389 flow, removed 40 selfloop flow, removed 2 redundant places. [2024-06-27 16:38:02,375 INFO L231 Difference]: Finished difference. Result has 81 places, 67 transitions, 508 flow [2024-06-27 16:38:02,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=508, PETRI_PLACES=81, PETRI_TRANSITIONS=67} [2024-06-27 16:38:02,376 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 50 predicate places. [2024-06-27 16:38:02,376 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 67 transitions, 508 flow [2024-06-27 16:38:02,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:38:02,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:38:02,376 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 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:38:02,391 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:38:02,581 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:38:02,582 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:38:02,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:38:02,582 INFO L85 PathProgramCache]: Analyzing trace with hash -311882979, now seen corresponding path program 3 times [2024-06-27 16:38:02,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:38:02,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394607929] [2024-06-27 16:38:02,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:38:02,583 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:38:02,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:38:02,584 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:38:02,584 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:38:02,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 16:38:02,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:38:02,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 16:38:02,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:38:02,829 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-06-27 16:38:02,829 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:38:02,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:38:02,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394607929] [2024-06-27 16:38:02,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394607929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:38:02,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:38:02,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 16:38:02,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940510087] [2024-06-27 16:38:02,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:38:02,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:38:02,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:38:02,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:38:02,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:38:02,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:38:02,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 67 transitions, 508 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:38:02,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:38:02,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:38:02,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:38:03,337 INFO L124 PetriNetUnfolderBase]: 1567/2282 cut-off events. [2024-06-27 16:38:03,337 INFO L125 PetriNetUnfolderBase]: For 8972/8972 co-relation queries the response was YES. [2024-06-27 16:38:03,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10337 conditions, 2282 events. 1567/2282 cut-off events. For 8972/8972 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9206 event pairs, 490 based on Foata normal form. 34/2202 useless extension candidates. Maximal degree in co-relation 10278. Up to 1261 conditions per place. [2024-06-27 16:38:03,350 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 100 selfloop transitions, 12 changer transitions 0/113 dead transitions. [2024-06-27 16:38:03,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 113 transitions, 1040 flow [2024-06-27 16:38:03,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:38:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:38:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2024-06-27 16:38:03,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5290322580645161 [2024-06-27 16:38:03,352 INFO L175 Difference]: Start difference. First operand has 81 places, 67 transitions, 508 flow. Second operand 5 states and 82 transitions. [2024-06-27 16:38:03,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 113 transitions, 1040 flow [2024-06-27 16:38:03,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 113 transitions, 958 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-27 16:38:03,365 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 523 flow [2024-06-27 16:38:03,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=523, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2024-06-27 16:38:03,365 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 48 predicate places. [2024-06-27 16:38:03,365 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 523 flow [2024-06-27 16:38:03,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:38:03,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:38:03,365 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 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:38:03,370 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:38:03,570 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:38:03,571 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:38:03,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:38:03,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2011672885, now seen corresponding path program 2 times [2024-06-27 16:38:03,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:38:03,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214628506] [2024-06-27 16:38:03,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:38:03,572 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:38:03,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:38:03,573 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:38:03,574 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:38:03,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:38:03,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:38:03,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 16:38:03,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:38:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-06-27 16:38:03,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:38:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-06-27 16:38:03,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:38:03,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214628506] [2024-06-27 16:38:03,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214628506] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 16:38:03,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:38:03,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-06-27 16:38:03,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626414985] [2024-06-27 16:38:03,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:38:03,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:38:03,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:38:03,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:38:03,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 16:38:03,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:38:03,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 523 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:38:03,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:38:03,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:38:03,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:38:04,469 INFO L124 PetriNetUnfolderBase]: 1737/2522 cut-off events. [2024-06-27 16:38:04,470 INFO L125 PetriNetUnfolderBase]: For 9574/9574 co-relation queries the response was YES. [2024-06-27 16:38:04,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11244 conditions, 2522 events. 1737/2522 cut-off events. For 9574/9574 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10457 event pairs, 179 based on Foata normal form. 35/2409 useless extension candidates. Maximal degree in co-relation 11128. Up to 1869 conditions per place. [2024-06-27 16:38:04,482 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 96 selfloop transitions, 16 changer transitions 0/113 dead transitions. [2024-06-27 16:38:04,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 113 transitions, 1005 flow [2024-06-27 16:38:04,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:38:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:38:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2024-06-27 16:38:04,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2024-06-27 16:38:04,484 INFO L175 Difference]: Start difference. First operand has 79 places, 68 transitions, 523 flow. Second operand 5 states and 75 transitions. [2024-06-27 16:38:04,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 113 transitions, 1005 flow [2024-06-27 16:38:04,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 113 transitions, 990 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 16:38:04,503 INFO L231 Difference]: Finished difference. Result has 83 places, 71 transitions, 585 flow [2024-06-27 16:38:04,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=585, PETRI_PLACES=83, PETRI_TRANSITIONS=71} [2024-06-27 16:38:04,504 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 52 predicate places. [2024-06-27 16:38:04,504 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 585 flow [2024-06-27 16:38:04,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:38:04,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:38:04,504 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 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:38:04,512 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:38:04,712 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:38:04,713 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:38:04,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:38:04,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1706238639, now seen corresponding path program 4 times [2024-06-27 16:38:04,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:38:04,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145742229] [2024-06-27 16:38:04,713 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 16:38:04,713 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:38:04,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:38:04,714 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:38:04,715 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:38:05,007 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 16:38:05,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:38:05,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 16:38:05,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:38:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-06-27 16:38:05,050 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:38:05,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:38:05,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145742229] [2024-06-27 16:38:05,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145742229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:38:05,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:38:05,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 16:38:05,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697642917] [2024-06-27 16:38:05,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:38:05,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:38:05,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:38:05,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:38:05,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:38:05,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:38:05,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 585 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:38:05,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:38:05,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:38:05,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:38:05,537 INFO L124 PetriNetUnfolderBase]: 1667/2413 cut-off events. [2024-06-27 16:38:05,537 INFO L125 PetriNetUnfolderBase]: For 11254/11254 co-relation queries the response was YES. [2024-06-27 16:38:05,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11379 conditions, 2413 events. 1667/2413 cut-off events. For 11254/11254 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9857 event pairs, 581 based on Foata normal form. 18/2431 useless extension candidates. Maximal degree in co-relation 11260. Up to 1501 conditions per place. [2024-06-27 16:38:05,548 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 86 selfloop transitions, 11 changer transitions 12/110 dead transitions. [2024-06-27 16:38:05,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 110 transitions, 1005 flow [2024-06-27 16:38:05,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:38:05,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:38:05,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2024-06-27 16:38:05,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49032258064516127 [2024-06-27 16:38:05,551 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 585 flow. Second operand 5 states and 76 transitions. [2024-06-27 16:38:05,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 110 transitions, 1005 flow [2024-06-27 16:38:05,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 110 transitions, 992 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-06-27 16:38:05,572 INFO L231 Difference]: Finished difference. Result has 86 places, 69 transitions, 574 flow [2024-06-27 16:38:05,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=574, PETRI_PLACES=86, PETRI_TRANSITIONS=69} [2024-06-27 16:38:05,572 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 55 predicate places. [2024-06-27 16:38:05,573 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 69 transitions, 574 flow [2024-06-27 16:38:05,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:38:05,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:38:05,573 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 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:38:05,582 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:38:05,773 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:38:05,773 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:38:05,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:38:05,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1102485297, now seen corresponding path program 5 times [2024-06-27 16:38:05,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:38:05,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869144032] [2024-06-27 16:38:05,774 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 16:38:05,774 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:38:05,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:38:05,775 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:38:05,776 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:38:06,483 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-06-27 16:38:06,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:38:06,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 16:38:06,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:38:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-06-27 16:38:06,521 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:38:06,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:38:06,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869144032] [2024-06-27 16:38:06,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869144032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:38:06,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:38:06,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 16:38:06,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035237308] [2024-06-27 16:38:06,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:38:06,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:38:06,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:38:06,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:38:06,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:38:06,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:38:06,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 69 transitions, 574 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:38:06,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:38:06,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:38:06,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:38:06,972 INFO L124 PetriNetUnfolderBase]: 1624/2352 cut-off events. [2024-06-27 16:38:06,972 INFO L125 PetriNetUnfolderBase]: For 11799/11799 co-relation queries the response was YES. [2024-06-27 16:38:06,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11270 conditions, 2352 events. 1624/2352 cut-off events. For 11799/11799 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9308 event pairs, 576 based on Foata normal form. 18/2370 useless extension candidates. Maximal degree in co-relation 11151. Up to 1478 conditions per place. [2024-06-27 16:38:06,984 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 81 selfloop transitions, 14 changer transitions 14/110 dead transitions. [2024-06-27 16:38:06,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 110 transitions, 1023 flow [2024-06-27 16:38:06,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:38:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:38:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2024-06-27 16:38:06,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4967741935483871 [2024-06-27 16:38:06,986 INFO L175 Difference]: Start difference. First operand has 86 places, 69 transitions, 574 flow. Second operand 5 states and 77 transitions. [2024-06-27 16:38:06,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 110 transitions, 1023 flow [2024-06-27 16:38:07,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 110 transitions, 987 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 16:38:07,011 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 577 flow [2024-06-27 16:38:07,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=577, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2024-06-27 16:38:07,012 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 54 predicate places. [2024-06-27 16:38:07,013 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 577 flow [2024-06-27 16:38:07,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:38:07,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:38:07,013 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 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:38:07,024 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 (17)] Forceful destruction successful, exit code 0 [2024-06-27 16:38:07,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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:38:07,224 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:38:07,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:38:07,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1475119789, now seen corresponding path program 6 times [2024-06-27 16:38:07,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:38:07,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966255182] [2024-06-27 16:38:07,225 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 16:38:07,225 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:38:07,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:38:07,226 INFO L229 MonitoredProcess]: Starting monitored process 18 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:38:07,227 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 (18)] Waiting until timeout for monitored process [2024-06-27 16:38:07,442 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-06-27 16:38:07,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:38:07,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 16:38:07,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:38:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-06-27 16:38:07,472 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:38:07,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:38:07,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966255182] [2024-06-27 16:38:07,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966255182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:38:07,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:38:07,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 16:38:07,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988305835] [2024-06-27 16:38:07,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:38:07,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:38:07,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:38:07,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:38:07,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:38:07,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:38:07,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 577 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:38:07,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:38:07,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:38:07,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:38:07,927 INFO L124 PetriNetUnfolderBase]: 1470/2122 cut-off events. [2024-06-27 16:38:07,927 INFO L125 PetriNetUnfolderBase]: For 10230/10230 co-relation queries the response was YES. [2024-06-27 16:38:07,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9949 conditions, 2122 events. 1470/2122 cut-off events. For 10230/10230 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8120 event pairs, 490 based on Foata normal form. 34/2156 useless extension candidates. Maximal degree in co-relation 9830. Up to 1253 conditions per place. [2024-06-27 16:38:07,938 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 92 selfloop transitions, 15 changer transitions 1/109 dead transitions. [2024-06-27 16:38:07,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 109 transitions, 1018 flow [2024-06-27 16:38:07,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:38:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:38:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2024-06-27 16:38:07,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49032258064516127 [2024-06-27 16:38:07,939 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 577 flow. Second operand 5 states and 76 transitions. [2024-06-27 16:38:07,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 109 transitions, 1018 flow [2024-06-27 16:38:07,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 109 transitions, 986 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 16:38:07,960 INFO L231 Difference]: Finished difference. Result has 86 places, 69 transitions, 579 flow [2024-06-27 16:38:07,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=579, PETRI_PLACES=86, PETRI_TRANSITIONS=69} [2024-06-27 16:38:07,960 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 55 predicate places. [2024-06-27 16:38:07,961 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 69 transitions, 579 flow [2024-06-27 16:38:07,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:38:07,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:38:07,961 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 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:38:07,966 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 (18)] Forceful destruction successful, exit code 0 [2024-06-27 16:38:08,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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:38:08,166 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:38:08,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:38:08,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1312771891, now seen corresponding path program 3 times [2024-06-27 16:38:08,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:38:08,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720265385] [2024-06-27 16:38:08,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:38:08,167 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:38:08,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:38:08,168 INFO L229 MonitoredProcess]: Starting monitored process 19 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:38:08,169 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 (19)] Waiting until timeout for monitored process [2024-06-27 16:38:08,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 16:38:08,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:38:08,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 16:38:08,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:38:08,385 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-06-27 16:38:08,386 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:38:08,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:38:08,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720265385] [2024-06-27 16:38:08,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720265385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:38:08,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:38:08,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 16:38:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888200830] [2024-06-27 16:38:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:38:08,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:38:08,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:38:08,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:38:08,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:38:08,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:38:08,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 69 transitions, 579 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:38:08,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:38:08,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:38:08,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:38:08,775 INFO L124 PetriNetUnfolderBase]: 1428/2067 cut-off events. [2024-06-27 16:38:08,775 INFO L125 PetriNetUnfolderBase]: For 10055/10055 co-relation queries the response was YES. [2024-06-27 16:38:08,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9761 conditions, 2067 events. 1428/2067 cut-off events. For 10055/10055 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7991 event pairs, 439 based on Foata normal form. 17/2084 useless extension candidates. Maximal degree in co-relation 9641. Up to 1274 conditions per place. [2024-06-27 16:38:08,786 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 85 selfloop transitions, 13 changer transitions 11/110 dead transitions. [2024-06-27 16:38:08,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 110 transitions, 1028 flow [2024-06-27 16:38:08,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:38:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:38:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2024-06-27 16:38:08,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774193548387097 [2024-06-27 16:38:08,791 INFO L175 Difference]: Start difference. First operand has 86 places, 69 transitions, 579 flow. Second operand 5 states and 74 transitions. [2024-06-27 16:38:08,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 110 transitions, 1028 flow [2024-06-27 16:38:08,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 110 transitions, 968 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-27 16:38:08,830 INFO L231 Difference]: Finished difference. Result has 85 places, 70 transitions, 581 flow [2024-06-27 16:38:08,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=581, PETRI_PLACES=85, PETRI_TRANSITIONS=70} [2024-06-27 16:38:08,830 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 54 predicate places. [2024-06-27 16:38:08,830 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 70 transitions, 581 flow [2024-06-27 16:38:08,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:38:08,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:38:08,831 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 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:38:08,837 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 (19)] Forceful destruction successful, exit code 0 [2024-06-27 16:38:09,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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:38:09,035 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:38:09,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:38:09,036 INFO L85 PathProgramCache]: Analyzing trace with hash -437478709, now seen corresponding path program 4 times [2024-06-27 16:38:09,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:38:09,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436445560] [2024-06-27 16:38:09,036 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 16:38:09,036 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:38:09,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:38:09,037 INFO L229 MonitoredProcess]: Starting monitored process 20 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:38:09,040 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 (20)] Waiting until timeout for monitored process [2024-06-27 16:38:09,323 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 16:38:09,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:38:09,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 16:38:09,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:38:09,361 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-06-27 16:38:09,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:38:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-06-27 16:38:09,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:38:09,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436445560] [2024-06-27 16:38:09,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436445560] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 16:38:09,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:38:09,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-06-27 16:38:09,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546677251] [2024-06-27 16:38:09,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:38:09,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:38:09,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:38:09,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:38:09,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 16:38:09,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:38:09,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 70 transitions, 581 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:38:09,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:38:09,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:38:09,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:38:09,813 INFO L124 PetriNetUnfolderBase]: 1368/1990 cut-off events. [2024-06-27 16:38:09,813 INFO L125 PetriNetUnfolderBase]: For 9949/9949 co-relation queries the response was YES. [2024-06-27 16:38:09,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9446 conditions, 1990 events. 1368/1990 cut-off events. For 9949/9949 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7616 event pairs, 435 based on Foata normal form. 35/2025 useless extension candidates. Maximal degree in co-relation 9326. Up to 1274 conditions per place. [2024-06-27 16:38:09,822 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 93 selfloop transitions, 15 changer transitions 1/110 dead transitions. [2024-06-27 16:38:09,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 110 transitions, 1023 flow [2024-06-27 16:38:09,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:38:09,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:38:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2024-06-27 16:38:09,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4967741935483871 [2024-06-27 16:38:09,829 INFO L175 Difference]: Start difference. First operand has 85 places, 70 transitions, 581 flow. Second operand 5 states and 77 transitions. [2024-06-27 16:38:09,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 110 transitions, 1023 flow [2024-06-27 16:38:09,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 110 transitions, 998 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-27 16:38:09,846 INFO L231 Difference]: Finished difference. Result has 87 places, 71 transitions, 606 flow [2024-06-27 16:38:09,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=606, PETRI_PLACES=87, PETRI_TRANSITIONS=71} [2024-06-27 16:38:09,847 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2024-06-27 16:38:09,847 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 71 transitions, 606 flow [2024-06-27 16:38:09,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:38:09,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:38:09,847 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 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:38:09,858 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 (20)] Forceful destruction successful, exit code 0 [2024-06-27 16:38:10,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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:38:10,054 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:38:10,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:38:10,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2108454725, now seen corresponding path program 5 times [2024-06-27 16:38:10,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:38:10,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499060422] [2024-06-27 16:38:10,054 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 16:38:10,054 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:38:10,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:38:10,055 INFO L229 MonitoredProcess]: Starting monitored process 21 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:38:10,056 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 (21)] Waiting until timeout for monitored process [2024-06-27 16:38:10,762 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-06-27 16:38:10,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:38:10,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 16:38:10,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:38:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-06-27 16:38:10,799 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:38:10,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:38:10,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499060422] [2024-06-27 16:38:10,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499060422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:38:10,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:38:10,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 16:38:10,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420239704] [2024-06-27 16:38:10,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:38:10,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:38:10,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:38:10,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:38:10,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:38:10,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:38:10,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 71 transitions, 606 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:38:10,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:38:10,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:38:10,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:38:11,204 INFO L124 PetriNetUnfolderBase]: 1301/1885 cut-off events. [2024-06-27 16:38:11,204 INFO L125 PetriNetUnfolderBase]: For 9457/9457 co-relation queries the response was YES. [2024-06-27 16:38:11,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8905 conditions, 1885 events. 1301/1885 cut-off events. For 9457/9457 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7088 event pairs, 439 based on Foata normal form. 17/1902 useless extension candidates. Maximal degree in co-relation 8785. Up to 1274 conditions per place. [2024-06-27 16:38:11,211 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 77 selfloop transitions, 15 changer transitions 12/105 dead transitions. [2024-06-27 16:38:11,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 105 transitions, 1006 flow [2024-06-27 16:38:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:38:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:38:11,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2024-06-27 16:38:11,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45806451612903226 [2024-06-27 16:38:11,221 INFO L175 Difference]: Start difference. First operand has 87 places, 71 transitions, 606 flow. Second operand 5 states and 71 transitions. [2024-06-27 16:38:11,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 105 transitions, 1006 flow [2024-06-27 16:38:11,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 105 transitions, 970 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-27 16:38:11,237 INFO L231 Difference]: Finished difference. Result has 88 places, 70 transitions, 586 flow [2024-06-27 16:38:11,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=586, PETRI_PLACES=88, PETRI_TRANSITIONS=70} [2024-06-27 16:38:11,237 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 57 predicate places. [2024-06-27 16:38:11,238 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 70 transitions, 586 flow [2024-06-27 16:38:11,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:38:11,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:38:11,238 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 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:38:11,248 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 (21)] Forceful destruction successful, exit code 0 [2024-06-27 16:38:11,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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:38:11,449 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:38:11,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:38:11,449 INFO L85 PathProgramCache]: Analyzing trace with hash -738438977, now seen corresponding path program 1 times [2024-06-27 16:38:11,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:38:11,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788900869] [2024-06-27 16:38:11,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:38:11,450 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:38:11,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:38:11,451 INFO L229 MonitoredProcess]: Starting monitored process 22 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:38:11,452 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 (22)] Waiting until timeout for monitored process [2024-06-27 16:38:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:38:11,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:38:11,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:38:11,875 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:38:11,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:38:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-06-27 16:38:11,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:38:11,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788900869] [2024-06-27 16:38:11,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788900869] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:38:11,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:38:11,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-06-27 16:38:11,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306795132] [2024-06-27 16:38:11,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:38:11,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 16:38:11,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:38:11,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 16:38:11,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-27 16:38:11,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:38:11,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 70 transitions, 586 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:38:11,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:38:11,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:38:11,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:38:12,848 INFO L124 PetriNetUnfolderBase]: 1618/2331 cut-off events. [2024-06-27 16:38:12,848 INFO L125 PetriNetUnfolderBase]: For 12568/12568 co-relation queries the response was YES. [2024-06-27 16:38:12,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10922 conditions, 2331 events. 1618/2331 cut-off events. For 12568/12568 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9561 event pairs, 237 based on Foata normal form. 1/2332 useless extension candidates. Maximal degree in co-relation 10802. Up to 772 conditions per place. [2024-06-27 16:38:12,858 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 203 selfloop transitions, 9 changer transitions 33/246 dead transitions. [2024-06-27 16:38:12,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 246 transitions, 2760 flow [2024-06-27 16:38:12,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 16:38:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 16:38:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-27 16:38:12,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2024-06-27 16:38:12,859 INFO L175 Difference]: Start difference. First operand has 88 places, 70 transitions, 586 flow. Second operand 8 states and 134 transitions. [2024-06-27 16:38:12,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 246 transitions, 2760 flow [2024-06-27 16:38:12,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 246 transitions, 2480 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-27 16:38:12,873 INFO L231 Difference]: Finished difference. Result has 89 places, 71 transitions, 569 flow [2024-06-27 16:38:12,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=569, PETRI_PLACES=89, PETRI_TRANSITIONS=71} [2024-06-27 16:38:12,874 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 58 predicate places. [2024-06-27 16:38:12,874 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 71 transitions, 569 flow [2024-06-27 16:38:12,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:38:12,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:38:12,874 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:38:12,884 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 (22)] Forceful destruction successful, exit code 0 [2024-06-27 16:38:13,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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:38:13,083 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:38:13,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:38:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash -983951102, now seen corresponding path program 2 times [2024-06-27 16:38:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:38:13,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418792276] [2024-06-27 16:38:13,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:38:13,084 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:38:13,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:38:13,085 INFO L229 MonitoredProcess]: Starting monitored process 23 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:38:13,093 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 (23)] Waiting until timeout for monitored process [2024-06-27 16:38:13,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:38:13,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:38:13,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 28 conjunts are in the unsatisfiable core [2024-06-27 16:38:13,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:38:14,186 INFO L349 Elim1Store]: treesize reduction 88, result has 9.3 percent of original size [2024-06-27 16:38:14,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 6 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 151 treesize of output 63 [2024-06-27 16:38:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-06-27 16:38:14,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:38:30,939 WARN L293 SmtUtils]: Spent 13.87s on a formula simplification. DAG size of input: 805 DAG size of output: 677 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-27 16:38:30,940 INFO L349 Elim1Store]: treesize reduction 420, result has 86.6 percent of original size [2024-06-27 16:38:30,940 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 589 treesize of output 2871 Killed by 15