./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-poker-hand-symm.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-poker-hand-symm.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 6f8a234fc2a7dd634bd03f872a0d7e8707283ecf0f996c6ed729f53ab07d6660 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:41:03,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:41:03,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:41:03,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:41:03,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:41:03,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:41:03,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:41:03,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:41:03,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:41:03,665 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:41:03,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:41:03,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:41:03,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:41:03,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:41:03,667 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:41:03,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:41:03,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:41:03,668 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:41:03,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:41:03,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:41:03,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:41:03,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:41:03,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:41:03,670 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:41:03,670 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:41:03,670 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:41:03,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:41:03,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:41:03,671 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:41:03,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:41:03,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:41:03,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:41:03,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:41:03,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:41:03,672 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:41:03,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:41:03,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:41:03,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:41:03,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:41:03,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:41:03,673 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:41:03,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:41:03,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:41:03,674 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 -> 6f8a234fc2a7dd634bd03f872a0d7e8707283ecf0f996c6ed729f53ab07d6660 [2024-06-27 16:41:03,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:41:03,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:41:03,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:41:03,918 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:41:03,918 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:41:03,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c [2024-06-27 16:41:04,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:41:05,072 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:41:05,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c [2024-06-27 16:41:05,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ceb88437/f421053d16004ecf988f9bb87d24d712/FLAGb95e8ca58 [2024-06-27 16:41:05,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ceb88437/f421053d16004ecf988f9bb87d24d712 [2024-06-27 16:41:05,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:41:05,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:41:05,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:41:05,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:41:05,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:41:05,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:41:05" (1/1) ... [2024-06-27 16:41:05,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1203c300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:41:05, skipping insertion in model container [2024-06-27 16:41:05,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:41:05" (1/1) ... [2024-06-27 16:41:05,141 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:41:05,370 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-poker-hand-symm.wvr.c[12847,12860] [2024-06-27 16:41:05,377 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:41:05,384 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:41:05,439 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-poker-hand-symm.wvr.c[12847,12860] [2024-06-27 16:41:05,441 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:41:05,458 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:41:05,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:41:05 WrapperNode [2024-06-27 16:41:05,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:41:05,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:41:05,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:41:05,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:41:05,466 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:41:05" (1/1) ... [2024-06-27 16:41:05,491 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:41:05" (1/1) ... [2024-06-27 16:41:05,553 INFO L138 Inliner]: procedures = 24, calls = 297, calls flagged for inlining = 69, calls inlined = 97, statements flattened = 1559 [2024-06-27 16:41:05,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:41:05,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:41:05,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:41:05,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:41:05,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:41:05" (1/1) ... [2024-06-27 16:41:05,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:41:05" (1/1) ... [2024-06-27 16:41:05,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:41:05" (1/1) ... [2024-06-27 16:41:05,613 INFO L175 MemorySlicer]: Split 186 memory accesses to 2 slices as follows [2, 184]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2024-06-27 16:41:05,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:41:05" (1/1) ... [2024-06-27 16:41:05,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:41:05" (1/1) ... [2024-06-27 16:41:05,639 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:41:05" (1/1) ... [2024-06-27 16:41:05,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:41:05" (1/1) ... [2024-06-27 16:41:05,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:41:05" (1/1) ... [2024-06-27 16:41:05,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:41:05" (1/1) ... [2024-06-27 16:41:05,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:41:05,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:41:05,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:41:05,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:41:05,664 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:41:05" (1/1) ... [2024-06-27 16:41:05,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:41:05,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:41:05,706 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:41:05,723 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:41:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:41:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:41:05,747 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:41:05,748 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:41:05,748 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:41:05,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:41:05,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 16:41:05,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 16:41:05,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 16:41:05,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 16:41:05,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 16:41:05,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 16:41:05,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:41:05,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:41:05,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 16:41:05,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 16:41:05,754 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:41:05,967 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:41:05,969 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:41:07,112 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:41:07,113 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:41:08,274 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:41:08,275 INFO L320 CfgBuilder]: Removed 12 assume(true) statements. [2024-06-27 16:41:08,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:41:08 BoogieIcfgContainer [2024-06-27 16:41:08,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:41:08,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:41:08,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:41:08,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:41:08,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:41:05" (1/3) ... [2024-06-27 16:41:08,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc23ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:41:08, skipping insertion in model container [2024-06-27 16:41:08,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:41:05" (2/3) ... [2024-06-27 16:41:08,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc23ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:41:08, skipping insertion in model container [2024-06-27 16:41:08,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:41:08" (3/3) ... [2024-06-27 16:41:08,282 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-poker-hand-symm.wvr.c [2024-06-27 16:41:08,289 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:41:08,296 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:41:08,297 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:41:08,297 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:41:08,504 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 16:41:08,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 94 transitions, 202 flow [2024-06-27 16:41:08,606 INFO L124 PetriNetUnfolderBase]: 28/92 cut-off events. [2024-06-27 16:41:08,607 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:41:08,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 92 events. 28/92 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 242 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 71. Up to 7 conditions per place. [2024-06-27 16:41:08,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 94 transitions, 202 flow [2024-06-27 16:41:08,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 91 transitions, 194 flow [2024-06-27 16:41:08,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:41:08,626 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;@4efdadf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:41:08,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 16:41:08,651 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:41:08,652 INFO L124 PetriNetUnfolderBase]: 28/90 cut-off events. [2024-06-27 16:41:08,652 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:41:08,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:08,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:08,653 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:08,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:08,657 INFO L85 PathProgramCache]: Analyzing trace with hash -901911410, now seen corresponding path program 1 times [2024-06-27 16:41:08,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:08,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997869925] [2024-06-27 16:41:08,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:08,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:09,020 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:41:09,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:09,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997869925] [2024-06-27 16:41:09,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997869925] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:09,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:41:09,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:41:09,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876587458] [2024-06-27 16:41:09,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:09,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:41:09,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:09,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:41:09,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:41:09,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:09,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 91 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:41:09,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:09,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:09,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:10,026 INFO L124 PetriNetUnfolderBase]: 2502/3740 cut-off events. [2024-06-27 16:41:10,026 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2024-06-27 16:41:10,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7558 conditions, 3740 events. 2502/3740 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17695 event pairs, 1702 based on Foata normal form. 0/2940 useless extension candidates. Maximal degree in co-relation 7372. Up to 3738 conditions per place. [2024-06-27 16:41:10,043 INFO L140 encePairwiseOnDemand]: 85/94 looper letters, 84 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2024-06-27 16:41:10,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 89 transitions, 366 flow [2024-06-27 16:41:10,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:41:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:41:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-06-27 16:41:10,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36524822695035464 [2024-06-27 16:41:10,054 INFO L175 Difference]: Start difference. First operand has 70 places, 91 transitions, 194 flow. Second operand 3 states and 103 transitions. [2024-06-27 16:41:10,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 89 transitions, 366 flow [2024-06-27 16:41:10,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 89 transitions, 358 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 16:41:10,061 INFO L231 Difference]: Finished difference. Result has 69 places, 89 transitions, 200 flow [2024-06-27 16:41:10,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=69, PETRI_TRANSITIONS=89} [2024-06-27 16:41:10,065 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -1 predicate places. [2024-06-27 16:41:10,065 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 89 transitions, 200 flow [2024-06-27 16:41:10,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:41:10,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:10,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:10,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:41:10,066 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:10,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:10,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1016506388, now seen corresponding path program 1 times [2024-06-27 16:41:10,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:10,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581104585] [2024-06-27 16:41:10,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:10,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:41:10,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:10,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581104585] [2024-06-27 16:41:10,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581104585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:10,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:41:10,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:41:10,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699517563] [2024-06-27 16:41:10,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:10,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:41:10,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:10,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:41:10,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:41:10,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:10,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 89 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:41:10,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:10,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:10,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:10,928 INFO L124 PetriNetUnfolderBase]: 2502/3742 cut-off events. [2024-06-27 16:41:10,928 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-06-27 16:41:10,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7521 conditions, 3742 events. 2502/3742 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17721 event pairs, 1702 based on Foata normal form. 0/2944 useless extension candidates. Maximal degree in co-relation 7472. Up to 3738 conditions per place. [2024-06-27 16:41:10,942 INFO L140 encePairwiseOnDemand]: 85/94 looper letters, 82 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2024-06-27 16:41:10,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 91 transitions, 384 flow [2024-06-27 16:41:10,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:41:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:41:10,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-06-27 16:41:10,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35815602836879434 [2024-06-27 16:41:10,944 INFO L175 Difference]: Start difference. First operand has 69 places, 89 transitions, 200 flow. Second operand 3 states and 101 transitions. [2024-06-27 16:41:10,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 91 transitions, 384 flow [2024-06-27 16:41:10,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:41:10,946 INFO L231 Difference]: Finished difference. Result has 71 places, 91 transitions, 230 flow [2024-06-27 16:41:10,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=71, PETRI_TRANSITIONS=91} [2024-06-27 16:41:10,947 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 1 predicate places. [2024-06-27 16:41:10,947 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 91 transitions, 230 flow [2024-06-27 16:41:10,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:41:10,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:10,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:10,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:41:10,948 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:10,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:10,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1952730255, now seen corresponding path program 1 times [2024-06-27 16:41:10,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:10,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920532798] [2024-06-27 16:41:10,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:10,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:11,088 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:41:11,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:11,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920532798] [2024-06-27 16:41:11,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920532798] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:41:11,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716846881] [2024-06-27 16:41:11,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:11,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:41:11,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:41:11,105 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:41:11,134 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:41:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:11,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 16:41:11,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:41:11,510 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:41:11,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:41:11,537 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:41:11,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716846881] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:41:11,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:41:11,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2024-06-27 16:41:11,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125496792] [2024-06-27 16:41:11,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:41:11,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 16:41:11,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:11,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 16:41:11,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2024-06-27 16:41:11,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:11,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 91 transitions, 230 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:41:11,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:11,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:11,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:12,395 INFO L124 PetriNetUnfolderBase]: 2502/3762 cut-off events. [2024-06-27 16:41:12,395 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-06-27 16:41:12,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7587 conditions, 3762 events. 2502/3762 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17721 event pairs, 1702 based on Foata normal form. 8/2973 useless extension candidates. Maximal degree in co-relation 7481. Up to 3738 conditions per place. [2024-06-27 16:41:12,408 INFO L140 encePairwiseOnDemand]: 77/94 looper letters, 78 selfloop transitions, 32 changer transitions 0/111 dead transitions. [2024-06-27 16:41:12,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 111 transitions, 514 flow [2024-06-27 16:41:12,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 16:41:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 16:41:12,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-27 16:41:12,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2047872340425532 [2024-06-27 16:41:12,410 INFO L175 Difference]: Start difference. First operand has 71 places, 91 transitions, 230 flow. Second operand 8 states and 154 transitions. [2024-06-27 16:41:12,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 111 transitions, 514 flow [2024-06-27 16:41:12,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 111 transitions, 506 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:41:12,413 INFO L231 Difference]: Finished difference. Result has 80 places, 111 transitions, 408 flow [2024-06-27 16:41:12,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=408, PETRI_PLACES=80, PETRI_TRANSITIONS=111} [2024-06-27 16:41:12,414 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 10 predicate places. [2024-06-27 16:41:12,414 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 111 transitions, 408 flow [2024-06-27 16:41:12,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:41:12,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:12,414 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:12,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-27 16:41:12,628 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:41:12,629 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:12,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:12,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1433088952, now seen corresponding path program 1 times [2024-06-27 16:41:12,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:12,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364322865] [2024-06-27 16:41:12,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:12,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-06-27 16:41:12,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:12,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364322865] [2024-06-27 16:41:12,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364322865] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:41:12,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896234432] [2024-06-27 16:41:12,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:12,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:41:12,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:41:12,850 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:41:12,864 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:41:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:13,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 16:41:13,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:41:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-06-27 16:41:13,300 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:41:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-06-27 16:41:13,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896234432] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:41:13,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:41:13,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-06-27 16:41:13,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255734777] [2024-06-27 16:41:13,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:41:13,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 16:41:13,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:13,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 16:41:13,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2024-06-27 16:41:13,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:13,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 111 transitions, 408 flow. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:41:13,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:13,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:13,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:14,130 INFO L124 PetriNetUnfolderBase]: 2502/3774 cut-off events. [2024-06-27 16:41:14,131 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-06-27 16:41:14,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7687 conditions, 3774 events. 2502/3774 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17720 event pairs, 1702 based on Foata normal form. 11/2992 useless extension candidates. Maximal degree in co-relation 7495. Up to 3738 conditions per place. [2024-06-27 16:41:14,145 INFO L140 encePairwiseOnDemand]: 77/94 looper letters, 78 selfloop transitions, 44 changer transitions 0/123 dead transitions. [2024-06-27 16:41:14,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 123 transitions, 708 flow [2024-06-27 16:41:14,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 16:41:14,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 16:41:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 167 transitions. [2024-06-27 16:41:14,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.16150870406189555 [2024-06-27 16:41:14,148 INFO L175 Difference]: Start difference. First operand has 80 places, 111 transitions, 408 flow. Second operand 11 states and 167 transitions. [2024-06-27 16:41:14,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 123 transitions, 708 flow [2024-06-27 16:41:14,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 123 transitions, 654 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-27 16:41:14,152 INFO L231 Difference]: Finished difference. Result has 88 places, 123 transitions, 524 flow [2024-06-27 16:41:14,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=524, PETRI_PLACES=88, PETRI_TRANSITIONS=123} [2024-06-27 16:41:14,153 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 18 predicate places. [2024-06-27 16:41:14,153 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 123 transitions, 524 flow [2024-06-27 16:41:14,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:41:14,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:14,153 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 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, 1, 1, 1, 1] [2024-06-27 16:41:14,172 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:41:14,366 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:41:14,366 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:14,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:14,367 INFO L85 PathProgramCache]: Analyzing trace with hash 719978097, now seen corresponding path program 2 times [2024-06-27 16:41:14,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:14,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106092758] [2024-06-27 16:41:14,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:14,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:14,619 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-06-27 16:41:14,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:14,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106092758] [2024-06-27 16:41:14,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106092758] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:41:14,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473520981] [2024-06-27 16:41:14,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:41:14,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:41:14,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:41:14,621 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:41:14,623 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:41:14,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-06-27 16:41:14,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:41:14,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:41:14,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:41:15,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:41:15,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2024-06-27 16:41:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-06-27 16:41:15,031 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:41:15,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473520981] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:15,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:41:15,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-06-27 16:41:15,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248851184] [2024-06-27 16:41:15,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:15,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:41:15,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:15,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:41:15,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-06-27 16:41:15,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:15,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 123 transitions, 524 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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:41:15,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:15,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:15,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:16,366 INFO L124 PetriNetUnfolderBase]: 3916/5918 cut-off events. [2024-06-27 16:41:16,367 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-06-27 16:41:16,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12015 conditions, 5918 events. 3916/5918 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 30625 event pairs, 1413 based on Foata normal form. 1/4715 useless extension candidates. Maximal degree in co-relation 11775. Up to 3014 conditions per place. [2024-06-27 16:41:16,387 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 197 selfloop transitions, 22 changer transitions 9/229 dead transitions. [2024-06-27 16:41:16,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 229 transitions, 1198 flow [2024-06-27 16:41:16,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:41:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:41:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 209 transitions. [2024-06-27 16:41:16,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44468085106382976 [2024-06-27 16:41:16,388 INFO L175 Difference]: Start difference. First operand has 88 places, 123 transitions, 524 flow. Second operand 5 states and 209 transitions. [2024-06-27 16:41:16,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 229 transitions, 1198 flow [2024-06-27 16:41:16,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 229 transitions, 1122 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-27 16:41:16,393 INFO L231 Difference]: Finished difference. Result has 91 places, 141 transitions, 591 flow [2024-06-27 16:41:16,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=591, PETRI_PLACES=91, PETRI_TRANSITIONS=141} [2024-06-27 16:41:16,393 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 21 predicate places. [2024-06-27 16:41:16,394 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 141 transitions, 591 flow [2024-06-27 16:41:16,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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:41:16,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:16,394 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 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, 1, 1, 1, 1] [2024-06-27 16:41:16,406 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:41:16,606 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:41:16,607 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:16,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:16,607 INFO L85 PathProgramCache]: Analyzing trace with hash -489758041, now seen corresponding path program 3 times [2024-06-27 16:41:16,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:16,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753737862] [2024-06-27 16:41:16,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:16,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-06-27 16:41:16,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:16,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753737862] [2024-06-27 16:41:16,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753737862] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:41:16,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339085638] [2024-06-27 16:41:16,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:41:16,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:41:16,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:41:16,842 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:41:16,846 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:41:17,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-06-27 16:41:17,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:41:17,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:41:17,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:41:17,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:41:17,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2024-06-27 16:41:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-06-27 16:41:17,267 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:41:17,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339085638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:17,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:41:17,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-06-27 16:41:17,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428664360] [2024-06-27 16:41:17,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:17,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:41:17,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:17,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:41:17,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-06-27 16:41:17,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:17,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 141 transitions, 591 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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:41:17,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:17,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:17,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:18,583 INFO L124 PetriNetUnfolderBase]: 4031/6134 cut-off events. [2024-06-27 16:41:18,583 INFO L125 PetriNetUnfolderBase]: For 884/884 co-relation queries the response was YES. [2024-06-27 16:41:18,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14752 conditions, 6134 events. 4031/6134 cut-off events. For 884/884 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 32437 event pairs, 1419 based on Foata normal form. 1/4899 useless extension candidates. Maximal degree in co-relation 14718. Up to 3289 conditions per place. [2024-06-27 16:41:18,602 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 195 selfloop transitions, 22 changer transitions 9/227 dead transitions. [2024-06-27 16:41:18,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 227 transitions, 1242 flow [2024-06-27 16:41:18,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:41:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:41:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 207 transitions. [2024-06-27 16:41:18,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44042553191489364 [2024-06-27 16:41:18,604 INFO L175 Difference]: Start difference. First operand has 91 places, 141 transitions, 591 flow. Second operand 5 states and 207 transitions. [2024-06-27 16:41:18,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 227 transitions, 1242 flow [2024-06-27 16:41:18,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 227 transitions, 1234 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 16:41:18,613 INFO L231 Difference]: Finished difference. Result has 96 places, 141 transitions, 641 flow [2024-06-27 16:41:18,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=641, PETRI_PLACES=96, PETRI_TRANSITIONS=141} [2024-06-27 16:41:18,616 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 26 predicate places. [2024-06-27 16:41:18,616 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 141 transitions, 641 flow [2024-06-27 16:41:18,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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:41:18,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:18,616 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:18,629 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:41:18,828 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:41:18,829 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:18,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:18,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2113688169, now seen corresponding path program 1 times [2024-06-27 16:41:18,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:18,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719668465] [2024-06-27 16:41:18,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:18,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:19,123 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-06-27 16:41:19,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:19,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719668465] [2024-06-27 16:41:19,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719668465] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:41:19,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82542622] [2024-06-27 16:41:19,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:19,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:41:19,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:41:19,128 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:41:19,151 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:41:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:19,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:41:19,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:41:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-06-27 16:41:19,634 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:41:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-06-27 16:41:19,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82542622] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:41:19,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:41:19,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-06-27 16:41:19,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215391404] [2024-06-27 16:41:19,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:41:19,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-06-27 16:41:19,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:19,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-06-27 16:41:19,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2024-06-27 16:41:19,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:19,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 141 transitions, 641 flow. Second operand has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:41:19,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:19,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:19,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:21,143 INFO L124 PetriNetUnfolderBase]: 4018/6124 cut-off events. [2024-06-27 16:41:21,143 INFO L125 PetriNetUnfolderBase]: For 2584/2584 co-relation queries the response was YES. [2024-06-27 16:41:21,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15661 conditions, 6124 events. 4018/6124 cut-off events. For 2584/2584 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 31911 event pairs, 2847 based on Foata normal form. 14/4902 useless extension candidates. Maximal degree in co-relation 15624. Up to 6072 conditions per place. [2024-06-27 16:41:21,169 INFO L140 encePairwiseOnDemand]: 77/94 looper letters, 96 selfloop transitions, 58 changer transitions 0/155 dead transitions. [2024-06-27 16:41:21,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 155 transitions, 1061 flow [2024-06-27 16:41:21,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 16:41:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 16:41:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 192 transitions. [2024-06-27 16:41:21,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1458966565349544 [2024-06-27 16:41:21,171 INFO L175 Difference]: Start difference. First operand has 96 places, 141 transitions, 641 flow. Second operand 14 states and 192 transitions. [2024-06-27 16:41:21,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 155 transitions, 1061 flow [2024-06-27 16:41:21,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 155 transitions, 1036 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-27 16:41:21,183 INFO L231 Difference]: Finished difference. Result has 113 places, 155 transitions, 942 flow [2024-06-27 16:41:21,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=942, PETRI_PLACES=113, PETRI_TRANSITIONS=155} [2024-06-27 16:41:21,183 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 43 predicate places. [2024-06-27 16:41:21,184 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 155 transitions, 942 flow [2024-06-27 16:41:21,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:41:21,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:21,184 INFO L208 CegarLoopForPetriNet]: trace histogram [12, 12, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:21,198 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:41:21,398 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:41:21,398 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:21,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:21,399 INFO L85 PathProgramCache]: Analyzing trace with hash 642830997, now seen corresponding path program 2 times [2024-06-27 16:41:21,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:21,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432192596] [2024-06-27 16:41:21,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:21,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-06-27 16:41:21,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:21,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432192596] [2024-06-27 16:41:21,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432192596] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:41:21,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933587287] [2024-06-27 16:41:21,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:41:21,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:41:21,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:41:21,834 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:41:21,861 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:41:22,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-06-27 16:41:22,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:41:22,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-27 16:41:22,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:41:22,418 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-06-27 16:41:22,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 9 [2024-06-27 16:41:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-06-27 16:41:22,438 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:41:22,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933587287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:22,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:41:22,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-06-27 16:41:22,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906012670] [2024-06-27 16:41:22,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:22,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:41:22,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:22,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:41:22,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2024-06-27 16:41:22,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:22,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 155 transitions, 942 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:41:22,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:22,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:22,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:24,185 INFO L124 PetriNetUnfolderBase]: 4949/7803 cut-off events. [2024-06-27 16:41:24,185 INFO L125 PetriNetUnfolderBase]: For 1677/1677 co-relation queries the response was YES. [2024-06-27 16:41:24,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19341 conditions, 7803 events. 4949/7803 cut-off events. For 1677/1677 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 45898 event pairs, 919 based on Foata normal form. 64/6387 useless extension candidates. Maximal degree in co-relation 19005. Up to 2348 conditions per place. [2024-06-27 16:41:24,216 INFO L140 encePairwiseOnDemand]: 71/94 looper letters, 288 selfloop transitions, 65 changer transitions 11/365 dead transitions. [2024-06-27 16:41:24,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 365 transitions, 2247 flow [2024-06-27 16:41:24,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 16:41:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 16:41:24,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 322 transitions. [2024-06-27 16:41:24,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42819148936170215 [2024-06-27 16:41:24,218 INFO L175 Difference]: Start difference. First operand has 113 places, 155 transitions, 942 flow. Second operand 8 states and 322 transitions. [2024-06-27 16:41:24,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 365 transitions, 2247 flow [2024-06-27 16:41:24,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 365 transitions, 2175 flow, removed 32 selfloop flow, removed 2 redundant places. [2024-06-27 16:41:24,231 INFO L231 Difference]: Finished difference. Result has 122 places, 199 transitions, 1298 flow [2024-06-27 16:41:24,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1298, PETRI_PLACES=122, PETRI_TRANSITIONS=199} [2024-06-27 16:41:24,232 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 52 predicate places. [2024-06-27 16:41:24,232 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 199 transitions, 1298 flow [2024-06-27 16:41:24,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:41:24,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:24,232 INFO L208 CegarLoopForPetriNet]: trace histogram [12, 12, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:24,245 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:41:24,445 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:41:24,446 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:24,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:24,447 INFO L85 PathProgramCache]: Analyzing trace with hash 499129417, now seen corresponding path program 3 times [2024-06-27 16:41:24,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:24,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473904234] [2024-06-27 16:41:24,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:24,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-06-27 16:41:24,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:24,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473904234] [2024-06-27 16:41:24,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473904234] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:41:24,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79284724] [2024-06-27 16:41:24,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:41:24,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:41:24,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:41:24,862 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:41:24,865 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:41:25,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-06-27 16:41:25,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:41:25,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 16:41:25,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:41:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-06-27 16:41:25,342 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:41:25,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79284724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:25,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:41:25,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 16 [2024-06-27 16:41:25,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874418170] [2024-06-27 16:41:25,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:25,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:41:25,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:25,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:41:25,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2024-06-27 16:41:25,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:25,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 199 transitions, 1298 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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:41:25,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:25,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:25,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:26,914 INFO L124 PetriNetUnfolderBase]: 4849/7650 cut-off events. [2024-06-27 16:41:26,914 INFO L125 PetriNetUnfolderBase]: For 4720/4720 co-relation queries the response was YES. [2024-06-27 16:41:26,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21841 conditions, 7650 events. 4849/7650 cut-off events. For 4720/4720 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 44105 event pairs, 3416 based on Foata normal form. 45/6225 useless extension candidates. Maximal degree in co-relation 21517. Up to 7229 conditions per place. [2024-06-27 16:41:26,942 INFO L140 encePairwiseOnDemand]: 82/94 looper letters, 205 selfloop transitions, 1 changer transitions 31/238 dead transitions. [2024-06-27 16:41:26,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 238 transitions, 1850 flow [2024-06-27 16:41:26,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:41:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:41:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2024-06-27 16:41:26,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5283687943262412 [2024-06-27 16:41:26,943 INFO L175 Difference]: Start difference. First operand has 122 places, 199 transitions, 1298 flow. Second operand 3 states and 149 transitions. [2024-06-27 16:41:26,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 238 transitions, 1850 flow [2024-06-27 16:41:26,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 238 transitions, 1850 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:41:26,962 INFO L231 Difference]: Finished difference. Result has 125 places, 191 transitions, 1257 flow [2024-06-27 16:41:26,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1257, PETRI_PLACES=125, PETRI_TRANSITIONS=191} [2024-06-27 16:41:26,963 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 55 predicate places. [2024-06-27 16:41:26,963 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 191 transitions, 1257 flow [2024-06-27 16:41:26,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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:41:26,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:26,963 INFO L208 CegarLoopForPetriNet]: trace histogram [12, 12, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:26,976 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:41:27,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:41:27,176 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:27,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:27,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1456462089, now seen corresponding path program 1 times [2024-06-27 16:41:27,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:27,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223074857] [2024-06-27 16:41:27,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:27,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-06-27 16:41:27,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:27,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223074857] [2024-06-27 16:41:27,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223074857] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:41:27,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553261222] [2024-06-27 16:41:27,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:27,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:41:27,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:41:27,665 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:41:27,686 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:41:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:28,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 16 conjunts are in the unsatisfiable core [2024-06-27 16:41:28,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:41:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-06-27 16:41:28,402 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:41:28,668 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-06-27 16:41:28,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553261222] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:41:28,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:41:28,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 41 [2024-06-27 16:41:28,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579918943] [2024-06-27 16:41:28,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:41:28,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-06-27 16:41:28,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:28,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-06-27 16:41:28,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=586, Invalid=1054, Unknown=0, NotChecked=0, Total=1640 [2024-06-27 16:41:28,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:28,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 191 transitions, 1257 flow. Second operand has 41 states, 41 states have (on average 4.878048780487805) internal successors, (200), 41 states have internal predecessors, (200), 0 states have call successors, (0), 0 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:41:28,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:28,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:28,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:30,437 INFO L124 PetriNetUnfolderBase]: 4550/7149 cut-off events. [2024-06-27 16:41:30,438 INFO L125 PetriNetUnfolderBase]: For 4824/4824 co-relation queries the response was YES. [2024-06-27 16:41:30,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20630 conditions, 7149 events. 4550/7149 cut-off events. For 4824/4824 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 40324 event pairs, 3355 based on Foata normal form. 2/5829 useless extension candidates. Maximal degree in co-relation 20425. Up to 7093 conditions per place. [2024-06-27 16:41:30,469 INFO L140 encePairwiseOnDemand]: 77/94 looper letters, 132 selfloop transitions, 60 changer transitions 0/193 dead transitions. [2024-06-27 16:41:30,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 193 transitions, 1661 flow [2024-06-27 16:41:30,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-06-27 16:41:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-06-27 16:41:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 198 transitions. [2024-06-27 16:41:30,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.10531914893617021 [2024-06-27 16:41:30,471 INFO L175 Difference]: Start difference. First operand has 125 places, 191 transitions, 1257 flow. Second operand 20 states and 198 transitions. [2024-06-27 16:41:30,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 193 transitions, 1661 flow [2024-06-27 16:41:30,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 193 transitions, 1647 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 16:41:30,500 INFO L231 Difference]: Finished difference. Result has 140 places, 193 transitions, 1393 flow [2024-06-27 16:41:30,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1393, PETRI_PLACES=140, PETRI_TRANSITIONS=193} [2024-06-27 16:41:30,501 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 70 predicate places. [2024-06-27 16:41:30,501 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 193 transitions, 1393 flow [2024-06-27 16:41:30,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.878048780487805) internal successors, (200), 41 states have internal predecessors, (200), 0 states have call successors, (0), 0 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:41:30,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:30,502 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:30,515 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:41:30,715 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,SelfDestructingSolverStorable9 [2024-06-27 16:41:30,715 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:30,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:30,715 INFO L85 PathProgramCache]: Analyzing trace with hash -239019205, now seen corresponding path program 2 times [2024-06-27 16:41:30,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:30,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576100549] [2024-06-27 16:41:30,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:30,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:31,360 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-06-27 16:41:31,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:31,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576100549] [2024-06-27 16:41:31,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576100549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:31,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:41:31,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:41:31,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558538338] [2024-06-27 16:41:31,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:31,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:41:31,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:31,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:41:31,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:41:31,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:31,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 193 transitions, 1393 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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:41:31,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:31,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:31,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:32,958 INFO L124 PetriNetUnfolderBase]: 4716/7503 cut-off events. [2024-06-27 16:41:32,958 INFO L125 PetriNetUnfolderBase]: For 4401/4401 co-relation queries the response was YES. [2024-06-27 16:41:32,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21226 conditions, 7503 events. 4716/7503 cut-off events. For 4401/4401 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 44018 event pairs, 2005 based on Foata normal form. 63/6185 useless extension candidates. Maximal degree in co-relation 20841. Up to 4093 conditions per place. [2024-06-27 16:41:32,984 INFO L140 encePairwiseOnDemand]: 81/94 looper letters, 222 selfloop transitions, 34 changer transitions 3/260 dead transitions. [2024-06-27 16:41:32,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 260 transitions, 2187 flow [2024-06-27 16:41:32,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:41:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:41:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2024-06-27 16:41:32,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5283687943262412 [2024-06-27 16:41:32,985 INFO L175 Difference]: Start difference. First operand has 140 places, 193 transitions, 1393 flow. Second operand 3 states and 149 transitions. [2024-06-27 16:41:32,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 260 transitions, 2187 flow [2024-06-27 16:41:33,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 260 transitions, 2035 flow, removed 18 selfloop flow, removed 14 redundant places. [2024-06-27 16:41:33,005 INFO L231 Difference]: Finished difference. Result has 130 places, 211 transitions, 1547 flow [2024-06-27 16:41:33,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=1241, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1547, PETRI_PLACES=130, PETRI_TRANSITIONS=211} [2024-06-27 16:41:33,006 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 60 predicate places. [2024-06-27 16:41:33,006 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 211 transitions, 1547 flow [2024-06-27 16:41:33,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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:41:33,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:33,006 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:33,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 16:41:33,006 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:33,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:33,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1002001847, now seen corresponding path program 1 times [2024-06-27 16:41:33,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:33,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865579629] [2024-06-27 16:41:33,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:33,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-06-27 16:41:33,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:33,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865579629] [2024-06-27 16:41:33,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865579629] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:33,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:41:33,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:41:33,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153990132] [2024-06-27 16:41:33,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:33,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:41:33,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:33,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:41:33,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:41:33,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:33,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 211 transitions, 1547 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:41:33,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:33,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:33,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:34,711 INFO L124 PetriNetUnfolderBase]: 4456/7087 cut-off events. [2024-06-27 16:41:34,712 INFO L125 PetriNetUnfolderBase]: For 7922/7922 co-relation queries the response was YES. [2024-06-27 16:41:34,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21278 conditions, 7087 events. 4456/7087 cut-off events. For 7922/7922 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 40726 event pairs, 2964 based on Foata normal form. 78/5829 useless extension candidates. Maximal degree in co-relation 20952. Up to 5958 conditions per place. [2024-06-27 16:41:34,738 INFO L140 encePairwiseOnDemand]: 91/94 looper letters, 234 selfloop transitions, 4 changer transitions 1/240 dead transitions. [2024-06-27 16:41:34,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 240 transitions, 2074 flow [2024-06-27 16:41:34,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:41:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:41:34,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2024-06-27 16:41:34,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787234042553192 [2024-06-27 16:41:34,739 INFO L175 Difference]: Start difference. First operand has 130 places, 211 transitions, 1547 flow. Second operand 3 states and 135 transitions. [2024-06-27 16:41:34,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 240 transitions, 2074 flow [2024-06-27 16:41:34,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 240 transitions, 2026 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-27 16:41:34,767 INFO L231 Difference]: Finished difference. Result has 132 places, 204 transitions, 1456 flow [2024-06-27 16:41:34,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1456, PETRI_PLACES=132, PETRI_TRANSITIONS=204} [2024-06-27 16:41:34,767 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 62 predicate places. [2024-06-27 16:41:34,767 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 204 transitions, 1456 flow [2024-06-27 16:41:34,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:41:34,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:34,768 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:34,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 16:41:34,768 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:34,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:34,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1737112089, now seen corresponding path program 1 times [2024-06-27 16:41:34,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:34,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341400217] [2024-06-27 16:41:34,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:34,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:34,980 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-06-27 16:41:34,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:34,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341400217] [2024-06-27 16:41:34,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341400217] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:34,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:41:34,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:41:34,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368618965] [2024-06-27 16:41:34,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:34,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:41:34,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:34,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:41:34,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:41:34,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:34,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 204 transitions, 1456 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:41:34,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:34,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:34,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:36,485 INFO L124 PetriNetUnfolderBase]: 4498/7196 cut-off events. [2024-06-27 16:41:36,485 INFO L125 PetriNetUnfolderBase]: For 6049/6049 co-relation queries the response was YES. [2024-06-27 16:41:36,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21516 conditions, 7196 events. 4498/7196 cut-off events. For 6049/6049 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 41226 event pairs, 2936 based on Foata normal form. 73/5911 useless extension candidates. Maximal degree in co-relation 21188. Up to 5962 conditions per place. [2024-06-27 16:41:36,514 INFO L140 encePairwiseOnDemand]: 91/94 looper letters, 229 selfloop transitions, 5 changer transitions 1/236 dead transitions. [2024-06-27 16:41:36,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 236 transitions, 2008 flow [2024-06-27 16:41:36,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:41:36,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:41:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2024-06-27 16:41:36,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2024-06-27 16:41:36,516 INFO L175 Difference]: Start difference. First operand has 132 places, 204 transitions, 1456 flow. Second operand 3 states and 132 transitions. [2024-06-27 16:41:36,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 236 transitions, 2008 flow [2024-06-27 16:41:36,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 236 transitions, 1994 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 16:41:36,538 INFO L231 Difference]: Finished difference. Result has 133 places, 201 transitions, 1437 flow [2024-06-27 16:41:36,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=1410, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1437, PETRI_PLACES=133, PETRI_TRANSITIONS=201} [2024-06-27 16:41:36,538 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 63 predicate places. [2024-06-27 16:41:36,538 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 201 transitions, 1437 flow [2024-06-27 16:41:36,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:41:36,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:36,539 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:36,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 16:41:36,539 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:36,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:36,539 INFO L85 PathProgramCache]: Analyzing trace with hash -101330679, now seen corresponding path program 1 times [2024-06-27 16:41:36,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:36,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855845383] [2024-06-27 16:41:36,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:36,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-06-27 16:41:37,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:37,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855845383] [2024-06-27 16:41:37,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855845383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:37,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:41:37,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:41:37,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331369703] [2024-06-27 16:41:37,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:37,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:41:37,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:37,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:41:37,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:41:37,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:37,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 201 transitions, 1437 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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:41:37,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:37,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:37,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:38,767 INFO L124 PetriNetUnfolderBase]: 4675/7557 cut-off events. [2024-06-27 16:41:38,767 INFO L125 PetriNetUnfolderBase]: For 6614/6614 co-relation queries the response was YES. [2024-06-27 16:41:38,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22597 conditions, 7557 events. 4675/7557 cut-off events. For 6614/6614 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 44795 event pairs, 3512 based on Foata normal form. 6/6160 useless extension candidates. Maximal degree in co-relation 22268. Up to 7114 conditions per place. [2024-06-27 16:41:38,800 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 225 selfloop transitions, 6 changer transitions 10/242 dead transitions. [2024-06-27 16:41:38,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 242 transitions, 2066 flow [2024-06-27 16:41:38,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:41:38,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:41:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2024-06-27 16:41:38,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3670212765957447 [2024-06-27 16:41:38,802 INFO L175 Difference]: Start difference. First operand has 133 places, 201 transitions, 1437 flow. Second operand 4 states and 138 transitions. [2024-06-27 16:41:38,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 242 transitions, 2066 flow [2024-06-27 16:41:38,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 242 transitions, 2052 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-06-27 16:41:38,828 INFO L231 Difference]: Finished difference. Result has 137 places, 201 transitions, 1452 flow [2024-06-27 16:41:38,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1452, PETRI_PLACES=137, PETRI_TRANSITIONS=201} [2024-06-27 16:41:38,828 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 67 predicate places. [2024-06-27 16:41:38,828 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 201 transitions, 1452 flow [2024-06-27 16:41:38,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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:41:38,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:38,829 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:38,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 16:41:38,829 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:38,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:38,829 INFO L85 PathProgramCache]: Analyzing trace with hash -310640127, now seen corresponding path program 2 times [2024-06-27 16:41:38,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:38,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417979338] [2024-06-27 16:41:38,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:38,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-06-27 16:41:39,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:39,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417979338] [2024-06-27 16:41:39,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417979338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:39,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:41:39,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:41:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269766232] [2024-06-27 16:41:39,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:39,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:41:39,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:39,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:41:39,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:41:39,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:39,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 201 transitions, 1452 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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:41:39,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:39,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:39,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:40,976 INFO L124 PetriNetUnfolderBase]: 4829/7866 cut-off events. [2024-06-27 16:41:40,977 INFO L125 PetriNetUnfolderBase]: For 6981/6981 co-relation queries the response was YES. [2024-06-27 16:41:40,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23209 conditions, 7866 events. 4829/7866 cut-off events. For 6981/6981 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 47838 event pairs, 1633 based on Foata normal form. 1/6428 useless extension candidates. Maximal degree in co-relation 23115. Up to 5092 conditions per place. [2024-06-27 16:41:41,009 INFO L140 encePairwiseOnDemand]: 77/94 looper letters, 238 selfloop transitions, 38 changer transitions 10/287 dead transitions. [2024-06-27 16:41:41,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 287 transitions, 2282 flow [2024-06-27 16:41:41,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:41:41,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:41:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 197 transitions. [2024-06-27 16:41:41,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41914893617021276 [2024-06-27 16:41:41,011 INFO L175 Difference]: Start difference. First operand has 137 places, 201 transitions, 1452 flow. Second operand 5 states and 197 transitions. [2024-06-27 16:41:41,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 287 transitions, 2282 flow [2024-06-27 16:41:41,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 287 transitions, 2271 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 16:41:41,038 INFO L231 Difference]: Finished difference. Result has 140 places, 201 transitions, 1532 flow [2024-06-27 16:41:41,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1532, PETRI_PLACES=140, PETRI_TRANSITIONS=201} [2024-06-27 16:41:41,038 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 70 predicate places. [2024-06-27 16:41:41,038 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 201 transitions, 1532 flow [2024-06-27 16:41:41,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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:41:41,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:41,039 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:41,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 16:41:41,039 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:41,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:41,039 INFO L85 PathProgramCache]: Analyzing trace with hash -825460671, now seen corresponding path program 1 times [2024-06-27 16:41:41,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:41,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049404273] [2024-06-27 16:41:41,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:41,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:41,377 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2024-06-27 16:41:41,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:41,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049404273] [2024-06-27 16:41:41,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049404273] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:41,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:41:41,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:41:41,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715168516] [2024-06-27 16:41:41,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:41,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:41:41,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:41,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:41:41,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:41:41,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:41,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 201 transitions, 1532 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:41:41,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:41,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:41,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:43,024 INFO L124 PetriNetUnfolderBase]: 4782/7779 cut-off events. [2024-06-27 16:41:43,024 INFO L125 PetriNetUnfolderBase]: For 9118/9118 co-relation queries the response was YES. [2024-06-27 16:41:43,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23601 conditions, 7779 events. 4782/7779 cut-off events. For 9118/9118 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 47501 event pairs, 1400 based on Foata normal form. 13/6357 useless extension candidates. Maximal degree in co-relation 23495. Up to 6790 conditions per place. [2024-06-27 16:41:43,057 INFO L140 encePairwiseOnDemand]: 79/94 looper letters, 211 selfloop transitions, 14 changer transitions 2/228 dead transitions. [2024-06-27 16:41:43,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 228 transitions, 2031 flow [2024-06-27 16:41:43,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:41:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:41:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2024-06-27 16:41:43,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475177304964539 [2024-06-27 16:41:43,058 INFO L175 Difference]: Start difference. First operand has 140 places, 201 transitions, 1532 flow. Second operand 3 states and 134 transitions. [2024-06-27 16:41:43,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 228 transitions, 2031 flow [2024-06-27 16:41:43,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 228 transitions, 1989 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 16:41:43,088 INFO L231 Difference]: Finished difference. Result has 138 places, 199 transitions, 1504 flow [2024-06-27 16:41:43,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1504, PETRI_PLACES=138, PETRI_TRANSITIONS=199} [2024-06-27 16:41:43,089 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 68 predicate places. [2024-06-27 16:41:43,089 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 199 transitions, 1504 flow [2024-06-27 16:41:43,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:41:43,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:43,089 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:43,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 16:41:43,089 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:43,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:43,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1436507131, now seen corresponding path program 1 times [2024-06-27 16:41:43,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:43,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093755562] [2024-06-27 16:41:43,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:43,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-06-27 16:41:43,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:43,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093755562] [2024-06-27 16:41:43,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093755562] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:43,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:41:43,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:41:43,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916032139] [2024-06-27 16:41:43,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:43,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:41:43,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:43,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:41:43,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:41:43,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:43,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 199 transitions, 1504 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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:41:43,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:43,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:43,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:45,445 INFO L124 PetriNetUnfolderBase]: 4820/7997 cut-off events. [2024-06-27 16:41:45,446 INFO L125 PetriNetUnfolderBase]: For 8240/8240 co-relation queries the response was YES. [2024-06-27 16:41:45,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24006 conditions, 7997 events. 4820/7997 cut-off events. For 8240/8240 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 50243 event pairs, 2367 based on Foata normal form. 100/6695 useless extension candidates. Maximal degree in co-relation 23672. Up to 4019 conditions per place. [2024-06-27 16:41:45,479 INFO L140 encePairwiseOnDemand]: 84/94 looper letters, 213 selfloop transitions, 26 changer transitions 7/247 dead transitions. [2024-06-27 16:41:45,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 247 transitions, 2148 flow [2024-06-27 16:41:45,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:41:45,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:41:45,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2024-06-27 16:41:45,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070921985815603 [2024-06-27 16:41:45,482 INFO L175 Difference]: Start difference. First operand has 138 places, 199 transitions, 1504 flow. Second operand 3 states and 143 transitions. [2024-06-27 16:41:45,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 247 transitions, 2148 flow [2024-06-27 16:41:45,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 247 transitions, 2120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:41:45,514 INFO L231 Difference]: Finished difference. Result has 139 places, 201 transitions, 1609 flow [2024-06-27 16:41:45,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1609, PETRI_PLACES=139, PETRI_TRANSITIONS=201} [2024-06-27 16:41:45,514 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 69 predicate places. [2024-06-27 16:41:45,514 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 201 transitions, 1609 flow [2024-06-27 16:41:45,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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:41:45,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:45,515 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:45,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 16:41:45,515 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:45,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:45,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1883375367, now seen corresponding path program 2 times [2024-06-27 16:41:45,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:45,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062456956] [2024-06-27 16:41:45,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:45,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:46,154 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-06-27 16:41:46,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:46,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062456956] [2024-06-27 16:41:46,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062456956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:46,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:41:46,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:41:46,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010056872] [2024-06-27 16:41:46,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:46,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:41:46,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:46,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:41:46,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:41:46,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:46,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 201 transitions, 1609 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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:41:46,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:46,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:46,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:47,741 INFO L124 PetriNetUnfolderBase]: 4656/7709 cut-off events. [2024-06-27 16:41:47,741 INFO L125 PetriNetUnfolderBase]: For 9533/9533 co-relation queries the response was YES. [2024-06-27 16:41:47,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23530 conditions, 7709 events. 4656/7709 cut-off events. For 9533/9533 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 47692 event pairs, 3361 based on Foata normal form. 54/6379 useless extension candidates. Maximal degree in co-relation 23197. Up to 6591 conditions per place. [2024-06-27 16:41:47,778 INFO L140 encePairwiseOnDemand]: 84/94 looper letters, 210 selfloop transitions, 12 changer transitions 8/231 dead transitions. [2024-06-27 16:41:47,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 231 transitions, 2033 flow [2024-06-27 16:41:47,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:41:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:41:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2024-06-27 16:41:47,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070921985815603 [2024-06-27 16:41:47,779 INFO L175 Difference]: Start difference. First operand has 139 places, 201 transitions, 1609 flow. Second operand 3 states and 143 transitions. [2024-06-27 16:41:47,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 231 transitions, 2033 flow [2024-06-27 16:41:47,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 231 transitions, 2017 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:41:47,818 INFO L231 Difference]: Finished difference. Result has 140 places, 187 transitions, 1461 flow [2024-06-27 16:41:47,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1461, PETRI_PLACES=140, PETRI_TRANSITIONS=187} [2024-06-27 16:41:47,818 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 70 predicate places. [2024-06-27 16:41:47,818 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 187 transitions, 1461 flow [2024-06-27 16:41:47,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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:41:47,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:47,818 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:47,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 16:41:47,819 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:47,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:47,819 INFO L85 PathProgramCache]: Analyzing trace with hash -526379136, now seen corresponding path program 1 times [2024-06-27 16:41:47,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:47,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153686532] [2024-06-27 16:41:47,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:47,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-06-27 16:41:48,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:48,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153686532] [2024-06-27 16:41:48,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153686532] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:48,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:41:48,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:41:48,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151702154] [2024-06-27 16:41:48,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:48,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:41:48,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:48,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:41:48,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:41:48,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:48,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 187 transitions, 1461 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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:41:48,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:48,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:48,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:50,199 INFO L124 PetriNetUnfolderBase]: 4937/8300 cut-off events. [2024-06-27 16:41:50,199 INFO L125 PetriNetUnfolderBase]: For 8724/8724 co-relation queries the response was YES. [2024-06-27 16:41:50,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25034 conditions, 8300 events. 4937/8300 cut-off events. For 8724/8724 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 53496 event pairs, 3631 based on Foata normal form. 27/6867 useless extension candidates. Maximal degree in co-relation 24701. Up to 6985 conditions per place. [2024-06-27 16:41:50,229 INFO L140 encePairwiseOnDemand]: 84/94 looper letters, 213 selfloop transitions, 16 changer transitions 13/243 dead transitions. [2024-06-27 16:41:50,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 243 transitions, 2121 flow [2024-06-27 16:41:50,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:41:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:41:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2024-06-27 16:41:50,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5354609929078015 [2024-06-27 16:41:50,230 INFO L175 Difference]: Start difference. First operand has 140 places, 187 transitions, 1461 flow. Second operand 3 states and 151 transitions. [2024-06-27 16:41:50,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 243 transitions, 2121 flow [2024-06-27 16:41:50,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 243 transitions, 2109 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:41:50,261 INFO L231 Difference]: Finished difference. Result has 143 places, 185 transitions, 1497 flow [2024-06-27 16:41:50,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1497, PETRI_PLACES=143, PETRI_TRANSITIONS=185} [2024-06-27 16:41:50,261 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 73 predicate places. [2024-06-27 16:41:50,261 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 185 transitions, 1497 flow [2024-06-27 16:41:50,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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:41:50,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:50,262 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:50,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 16:41:50,262 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:50,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:50,262 INFO L85 PathProgramCache]: Analyzing trace with hash 609915800, now seen corresponding path program 2 times [2024-06-27 16:41:50,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:50,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538516461] [2024-06-27 16:41:50,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:50,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-06-27 16:41:50,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:50,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538516461] [2024-06-27 16:41:50,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538516461] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:50,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:41:50,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:41:50,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015439082] [2024-06-27 16:41:50,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:50,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:41:50,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:50,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:41:50,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:41:50,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:50,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 185 transitions, 1497 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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:41:50,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:50,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:50,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:52,714 INFO L124 PetriNetUnfolderBase]: 4629/7767 cut-off events. [2024-06-27 16:41:52,714 INFO L125 PetriNetUnfolderBase]: For 9230/9230 co-relation queries the response was YES. [2024-06-27 16:41:52,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23493 conditions, 7767 events. 4629/7767 cut-off events. For 9230/9230 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 49448 event pairs, 2173 based on Foata normal form. 59/6424 useless extension candidates. Maximal degree in co-relation 23159. Up to 4129 conditions per place. [2024-06-27 16:41:52,743 INFO L140 encePairwiseOnDemand]: 84/94 looper letters, 201 selfloop transitions, 15 changer transitions 8/225 dead transitions. [2024-06-27 16:41:52,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 225 transitions, 1998 flow [2024-06-27 16:41:52,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:41:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:41:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2024-06-27 16:41:52,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070921985815603 [2024-06-27 16:41:52,744 INFO L175 Difference]: Start difference. First operand has 143 places, 185 transitions, 1497 flow. Second operand 3 states and 143 transitions. [2024-06-27 16:41:52,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 225 transitions, 1998 flow [2024-06-27 16:41:52,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 225 transitions, 1980 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 16:41:52,781 INFO L231 Difference]: Finished difference. Result has 142 places, 178 transitions, 1401 flow [2024-06-27 16:41:52,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1401, PETRI_PLACES=142, PETRI_TRANSITIONS=178} [2024-06-27 16:41:52,782 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 72 predicate places. [2024-06-27 16:41:52,782 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 178 transitions, 1401 flow [2024-06-27 16:41:52,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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:41:52,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:52,782 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:52,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 16:41:52,783 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:52,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:52,783 INFO L85 PathProgramCache]: Analyzing trace with hash 495274041, now seen corresponding path program 1 times [2024-06-27 16:41:52,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:52,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880244310] [2024-06-27 16:41:52,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:52,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-06-27 16:41:52,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:52,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880244310] [2024-06-27 16:41:52,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880244310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:52,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:41:52,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:41:52,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932943653] [2024-06-27 16:41:52,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:52,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:41:52,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:52,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:41:52,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:41:52,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:52,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 178 transitions, 1401 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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:41:52,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:52,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:52,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:54,427 INFO L124 PetriNetUnfolderBase]: 4468/7504 cut-off events. [2024-06-27 16:41:54,427 INFO L125 PetriNetUnfolderBase]: For 8008/8008 co-relation queries the response was YES. [2024-06-27 16:41:54,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22587 conditions, 7504 events. 4468/7504 cut-off events. For 8008/8008 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 47294 event pairs, 2547 based on Foata normal form. 41/6173 useless extension candidates. Maximal degree in co-relation 22255. Up to 4515 conditions per place. [2024-06-27 16:41:54,452 INFO L140 encePairwiseOnDemand]: 88/94 looper letters, 197 selfloop transitions, 7 changer transitions 16/221 dead transitions. [2024-06-27 16:41:54,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 221 transitions, 1934 flow [2024-06-27 16:41:54,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:41:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:41:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-06-27 16:41:54,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48936170212765956 [2024-06-27 16:41:54,457 INFO L175 Difference]: Start difference. First operand has 142 places, 178 transitions, 1401 flow. Second operand 3 states and 138 transitions. [2024-06-27 16:41:54,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 221 transitions, 1934 flow [2024-06-27 16:41:54,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 221 transitions, 1906 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 16:41:54,483 INFO L231 Difference]: Finished difference. Result has 142 places, 175 transitions, 1346 flow [2024-06-27 16:41:54,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1346, PETRI_PLACES=142, PETRI_TRANSITIONS=175} [2024-06-27 16:41:54,483 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 72 predicate places. [2024-06-27 16:41:54,483 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 175 transitions, 1346 flow [2024-06-27 16:41:54,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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:41:54,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:54,483 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:54,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 16:41:54,484 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:54,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:54,484 INFO L85 PathProgramCache]: Analyzing trace with hash 455528441, now seen corresponding path program 2 times [2024-06-27 16:41:54,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:54,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324039824] [2024-06-27 16:41:54,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:54,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-06-27 16:41:54,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:54,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324039824] [2024-06-27 16:41:54,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324039824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:54,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:41:54,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:41:54,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189554650] [2024-06-27 16:41:54,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:54,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:41:54,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:54,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:41:54,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:41:54,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:54,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 175 transitions, 1346 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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:41:54,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:54,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:54,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:56,009 INFO L124 PetriNetUnfolderBase]: 4419/7410 cut-off events. [2024-06-27 16:41:56,010 INFO L125 PetriNetUnfolderBase]: For 6203/6203 co-relation queries the response was YES. [2024-06-27 16:41:56,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22505 conditions, 7410 events. 4419/7410 cut-off events. For 6203/6203 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 46189 event pairs, 3676 based on Foata normal form. 4/6050 useless extension candidates. Maximal degree in co-relation 22172. Up to 7043 conditions per place. [2024-06-27 16:41:56,049 INFO L140 encePairwiseOnDemand]: 91/94 looper letters, 186 selfloop transitions, 4 changer transitions 13/204 dead transitions. [2024-06-27 16:41:56,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 204 transitions, 1834 flow [2024-06-27 16:41:56,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:41:56,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:41:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-06-27 16:41:56,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425531914893617 [2024-06-27 16:41:56,049 INFO L175 Difference]: Start difference. First operand has 142 places, 175 transitions, 1346 flow. Second operand 3 states and 120 transitions. [2024-06-27 16:41:56,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 204 transitions, 1834 flow [2024-06-27 16:41:56,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 204 transitions, 1828 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:41:56,075 INFO L231 Difference]: Finished difference. Result has 143 places, 173 transitions, 1322 flow [2024-06-27 16:41:56,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=1331, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1322, PETRI_PLACES=143, PETRI_TRANSITIONS=173} [2024-06-27 16:41:56,076 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 73 predicate places. [2024-06-27 16:41:56,076 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 173 transitions, 1322 flow [2024-06-27 16:41:56,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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:41:56,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:56,076 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:56,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 16:41:56,076 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:56,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1624082221, now seen corresponding path program 1 times [2024-06-27 16:41:56,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:56,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323273797] [2024-06-27 16:41:56,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:56,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2024-06-27 16:41:56,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:56,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323273797] [2024-06-27 16:41:56,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323273797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:56,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:41:56,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:41:56,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245709741] [2024-06-27 16:41:56,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:56,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:41:56,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:56,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:41:56,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:41:56,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:56,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 173 transitions, 1322 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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:41:56,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:56,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:56,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:57,674 INFO L124 PetriNetUnfolderBase]: 3204/5377 cut-off events. [2024-06-27 16:41:57,674 INFO L125 PetriNetUnfolderBase]: For 5449/5449 co-relation queries the response was YES. [2024-06-27 16:41:57,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15318 conditions, 5377 events. 3204/5377 cut-off events. For 5449/5449 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 31728 event pairs, 1984 based on Foata normal form. 205/4453 useless extension candidates. Maximal degree in co-relation 15284. Up to 3432 conditions per place. [2024-06-27 16:41:57,695 INFO L140 encePairwiseOnDemand]: 82/94 looper letters, 156 selfloop transitions, 2 changer transitions 24/183 dead transitions. [2024-06-27 16:41:57,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 183 transitions, 1442 flow [2024-06-27 16:41:57,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:41:57,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:41:57,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2024-06-27 16:41:57,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645390070921986 [2024-06-27 16:41:57,696 INFO L175 Difference]: Start difference. First operand has 143 places, 173 transitions, 1322 flow. Second operand 3 states and 131 transitions. [2024-06-27 16:41:57,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 183 transitions, 1442 flow [2024-06-27 16:41:57,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 183 transitions, 1375 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 16:41:57,718 INFO L231 Difference]: Finished difference. Result has 135 places, 147 transitions, 940 flow [2024-06-27 16:41:57,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=940, PETRI_PLACES=135, PETRI_TRANSITIONS=147} [2024-06-27 16:41:57,718 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 65 predicate places. [2024-06-27 16:41:57,718 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 147 transitions, 940 flow [2024-06-27 16:41:57,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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:41:57,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:57,718 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:57,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 16:41:57,718 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:57,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:57,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1279691771, now seen corresponding path program 1 times [2024-06-27 16:41:57,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:57,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661627708] [2024-06-27 16:41:57,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:57,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-06-27 16:41:57,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:57,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661627708] [2024-06-27 16:41:57,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661627708] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:57,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:41:57,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:41:57,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766480694] [2024-06-27 16:41:57,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:57,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:41:57,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:57,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:41:57,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:41:57,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:57,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 147 transitions, 940 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:41:57,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:57,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:57,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:58,851 INFO L124 PetriNetUnfolderBase]: 2749/4633 cut-off events. [2024-06-27 16:41:58,852 INFO L125 PetriNetUnfolderBase]: For 2451/2451 co-relation queries the response was YES. [2024-06-27 16:41:58,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12198 conditions, 4633 events. 2749/4633 cut-off events. For 2451/2451 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 26188 event pairs, 2334 based on Foata normal form. 1/3869 useless extension candidates. Maximal degree in co-relation 12168. Up to 4453 conditions per place. [2024-06-27 16:41:58,866 INFO L140 encePairwiseOnDemand]: 91/94 looper letters, 149 selfloop transitions, 1 changer transitions 19/170 dead transitions. [2024-06-27 16:41:58,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 170 transitions, 1329 flow [2024-06-27 16:41:58,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:41:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:41:58,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-06-27 16:41:58,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29521276595744683 [2024-06-27 16:41:58,867 INFO L175 Difference]: Start difference. First operand has 135 places, 147 transitions, 940 flow. Second operand 4 states and 111 transitions. [2024-06-27 16:41:58,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 170 transitions, 1329 flow [2024-06-27 16:41:58,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 170 transitions, 1327 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:41:58,875 INFO L231 Difference]: Finished difference. Result has 134 places, 145 transitions, 920 flow [2024-06-27 16:41:58,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=920, PETRI_PLACES=134, PETRI_TRANSITIONS=145} [2024-06-27 16:41:58,876 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 64 predicate places. [2024-06-27 16:41:58,876 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 145 transitions, 920 flow [2024-06-27 16:41:58,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:41:58,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:58,876 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:58,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 16:41:58,877 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:58,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:58,877 INFO L85 PathProgramCache]: Analyzing trace with hash -253074113, now seen corresponding path program 2 times [2024-06-27 16:41:58,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:58,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693674643] [2024-06-27 16:41:58,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:58,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:41:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-06-27 16:41:59,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:41:59,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693674643] [2024-06-27 16:41:59,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693674643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:41:59,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:41:59,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:41:59,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385158806] [2024-06-27 16:41:59,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:41:59,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:41:59,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:41:59,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:41:59,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:41:59,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:41:59,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 145 transitions, 920 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:41:59,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:41:59,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:41:59,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:41:59,921 INFO L124 PetriNetUnfolderBase]: 2663/4475 cut-off events. [2024-06-27 16:41:59,921 INFO L125 PetriNetUnfolderBase]: For 2235/2235 co-relation queries the response was YES. [2024-06-27 16:41:59,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11701 conditions, 4475 events. 2663/4475 cut-off events. For 2235/2235 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 24982 event pairs, 2272 based on Foata normal form. 1/3726 useless extension candidates. Maximal degree in co-relation 11670. Up to 4347 conditions per place. [2024-06-27 16:41:59,939 INFO L140 encePairwiseOnDemand]: 91/94 looper letters, 139 selfloop transitions, 0 changer transitions 22/162 dead transitions. [2024-06-27 16:41:59,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 162 transitions, 1278 flow [2024-06-27 16:41:59,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:41:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:41:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-06-27 16:41:59,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2765957446808511 [2024-06-27 16:41:59,940 INFO L175 Difference]: Start difference. First operand has 134 places, 145 transitions, 920 flow. Second operand 4 states and 104 transitions. [2024-06-27 16:41:59,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 162 transitions, 1278 flow [2024-06-27 16:41:59,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 162 transitions, 1275 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 16:41:59,950 INFO L231 Difference]: Finished difference. Result has 135 places, 140 transitions, 890 flow [2024-06-27 16:41:59,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=890, PETRI_PLACES=135, PETRI_TRANSITIONS=140} [2024-06-27 16:41:59,950 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 65 predicate places. [2024-06-27 16:41:59,950 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 140 transitions, 890 flow [2024-06-27 16:41:59,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:41:59,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:41:59,951 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:41:59,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 16:41:59,951 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:41:59,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:41:59,951 INFO L85 PathProgramCache]: Analyzing trace with hash 954372552, now seen corresponding path program 1 times [2024-06-27 16:41:59,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:41:59,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851384900] [2024-06-27 16:41:59,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:41:59,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:41:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:42:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-06-27 16:42:00,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:42:00,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851384900] [2024-06-27 16:42:00,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851384900] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:42:00,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:42:00,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:42:00,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189949686] [2024-06-27 16:42:00,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:42:00,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:42:00,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:42:00,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:42:00,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:42:00,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:42:00,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 140 transitions, 890 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:42:00,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:42:00,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:42:00,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:42:00,939 INFO L124 PetriNetUnfolderBase]: 2287/3854 cut-off events. [2024-06-27 16:42:00,939 INFO L125 PetriNetUnfolderBase]: For 1952/1952 co-relation queries the response was YES. [2024-06-27 16:42:00,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10079 conditions, 3854 events. 2287/3854 cut-off events. For 1952/1952 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 20675 event pairs, 1901 based on Foata normal form. 1/3290 useless extension candidates. Maximal degree in co-relation 10048. Up to 3687 conditions per place. [2024-06-27 16:42:00,952 INFO L140 encePairwiseOnDemand]: 91/94 looper letters, 142 selfloop transitions, 1 changer transitions 18/162 dead transitions. [2024-06-27 16:42:00,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 162 transitions, 1263 flow [2024-06-27 16:42:00,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:42:00,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:42:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-06-27 16:42:00,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27925531914893614 [2024-06-27 16:42:00,953 INFO L175 Difference]: Start difference. First operand has 135 places, 140 transitions, 890 flow. Second operand 4 states and 105 transitions. [2024-06-27 16:42:00,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 162 transitions, 1263 flow [2024-06-27 16:42:00,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 162 transitions, 1255 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 16:42:00,961 INFO L231 Difference]: Finished difference. Result has 130 places, 138 transitions, 867 flow [2024-06-27 16:42:00,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=867, PETRI_PLACES=130, PETRI_TRANSITIONS=138} [2024-06-27 16:42:00,961 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 60 predicate places. [2024-06-27 16:42:00,961 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 138 transitions, 867 flow [2024-06-27 16:42:00,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:42:00,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:42:00,961 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:42:00,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 16:42:00,961 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:42:00,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:42:00,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1710011116, now seen corresponding path program 2 times [2024-06-27 16:42:00,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:42:00,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332513666] [2024-06-27 16:42:00,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:42:00,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:42:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:42:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-06-27 16:42:01,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:42:01,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332513666] [2024-06-27 16:42:01,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332513666] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:42:01,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:42:01,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:42:01,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184819987] [2024-06-27 16:42:01,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:42:01,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:42:01,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:42:01,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:42:01,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:42:01,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:42:01,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 138 transitions, 867 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:42:01,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:42:01,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:42:01,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:42:01,898 INFO L124 PetriNetUnfolderBase]: 2208/3708 cut-off events. [2024-06-27 16:42:01,898 INFO L125 PetriNetUnfolderBase]: For 1511/1511 co-relation queries the response was YES. [2024-06-27 16:42:01,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9581 conditions, 3708 events. 2208/3708 cut-off events. For 1511/1511 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 19568 event pairs, 1851 based on Foata normal form. 1/3154 useless extension candidates. Maximal degree in co-relation 9550. Up to 3601 conditions per place. [2024-06-27 16:42:01,913 INFO L140 encePairwiseOnDemand]: 91/94 looper letters, 128 selfloop transitions, 0 changer transitions 24/153 dead transitions. [2024-06-27 16:42:01,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 153 transitions, 1203 flow [2024-06-27 16:42:01,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:42:01,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:42:01,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-06-27 16:42:01,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2579787234042553 [2024-06-27 16:42:01,913 INFO L175 Difference]: Start difference. First operand has 130 places, 138 transitions, 867 flow. Second operand 4 states and 97 transitions. [2024-06-27 16:42:01,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 153 transitions, 1203 flow [2024-06-27 16:42:01,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 153 transitions, 1198 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 16:42:01,921 INFO L231 Difference]: Finished difference. Result has 131 places, 129 transitions, 828 flow [2024-06-27 16:42:01,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=828, PETRI_PLACES=131, PETRI_TRANSITIONS=129} [2024-06-27 16:42:01,922 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 61 predicate places. [2024-06-27 16:42:01,922 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 129 transitions, 828 flow [2024-06-27 16:42:01,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:42:01,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:42:01,922 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:42:01,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 16:42:01,922 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:42:01,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:42:01,922 INFO L85 PathProgramCache]: Analyzing trace with hash 698782065, now seen corresponding path program 1 times [2024-06-27 16:42:01,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:42:01,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372842103] [2024-06-27 16:42:01,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:42:01,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:42:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:42:02,106 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-06-27 16:42:02,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:42:02,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372842103] [2024-06-27 16:42:02,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372842103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:42:02,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:42:02,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:42:02,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932216071] [2024-06-27 16:42:02,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:42:02,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:42:02,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:42:02,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:42:02,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:42:02,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:42:02,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 129 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:42:02,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:42:02,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:42:02,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:42:02,634 INFO L124 PetriNetUnfolderBase]: 1491/2542 cut-off events. [2024-06-27 16:42:02,634 INFO L125 PetriNetUnfolderBase]: For 1085/1085 co-relation queries the response was YES. [2024-06-27 16:42:02,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6623 conditions, 2542 events. 1491/2542 cut-off events. For 1085/1085 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 12107 event pairs, 1072 based on Foata normal form. 34/2221 useless extension candidates. Maximal degree in co-relation 6592. Up to 2096 conditions per place. [2024-06-27 16:42:02,644 INFO L140 encePairwiseOnDemand]: 91/94 looper letters, 143 selfloop transitions, 3 changer transitions 2/149 dead transitions. [2024-06-27 16:42:02,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 149 transitions, 1167 flow [2024-06-27 16:42:02,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:42:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:42:02,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-06-27 16:42:02,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32978723404255317 [2024-06-27 16:42:02,645 INFO L175 Difference]: Start difference. First operand has 131 places, 129 transitions, 828 flow. Second operand 3 states and 93 transitions. [2024-06-27 16:42:02,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 149 transitions, 1167 flow [2024-06-27 16:42:02,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 149 transitions, 1155 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 16:42:02,651 INFO L231 Difference]: Finished difference. Result has 118 places, 127 transitions, 812 flow [2024-06-27 16:42:02,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=118, PETRI_TRANSITIONS=127} [2024-06-27 16:42:02,651 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 48 predicate places. [2024-06-27 16:42:02,652 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 127 transitions, 812 flow [2024-06-27 16:42:02,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:42:02,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:42:02,652 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:42:02,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 16:42:02,652 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:42:02,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:42:02,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1582672416, now seen corresponding path program 1 times [2024-06-27 16:42:02,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:42:02,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136771178] [2024-06-27 16:42:02,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:42:02,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:42:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:42:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 55 proven. 55 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-06-27 16:42:09,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:42:09,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136771178] [2024-06-27 16:42:09,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136771178] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:42:09,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018637747] [2024-06-27 16:42:09,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:42:09,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:42:09,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:42:09,593 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:42:09,594 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:42:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:42:10,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 29 conjunts are in the unsatisfiable core [2024-06-27 16:42:10,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:42:14,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:42:14,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 265 treesize of output 1810 [2024-06-27 16:52:54,377 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:52:54,380 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-06-27 16:52:54,396 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:52:54,580 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,SelfDestructingSolverStorable28 [2024-06-27 16:52:54,581 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)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:146) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.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.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.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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) 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: java.io.IOException: Broken pipe at java.base/java.io.FileOutputStream.writeBytes(Native Method) at java.base/java.io.FileOutputStream.write(FileOutputStream.java:354) at java.base/java.io.BufferedOutputStream.write(BufferedOutputStream.java:123) at java.base/sun.nio.cs.StreamEncoder.writeBytes(StreamEncoder.java:233) at java.base/sun.nio.cs.StreamEncoder.implWrite(StreamEncoder.java:303) at java.base/sun.nio.cs.StreamEncoder.implWrite(StreamEncoder.java:281) at java.base/sun.nio.cs.StreamEncoder.write(StreamEncoder.java:125) at java.base/java.io.OutputStreamWriter.write(OutputStreamWriter.java:208) at java.base/java.io.BufferedWriter.flushBuffer(BufferedWriter.java:120) at java.base/java.io.BufferedWriter.write(BufferedWriter.java:233) at java.base/java.io.Writer.write(Writer.java:249) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:174) ... 67 more [2024-06-27 16:52:54,584 INFO L158 Benchmark]: Toolchain (without parser) took 709481.92ms. Allocated memory was 138.4MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 61.6MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-06-27 16:52:54,584 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory was 109.1MB in the beginning and 109.0MB in the end (delta: 139.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 16:52:54,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.07ms. Allocated memory is still 138.4MB. Free memory was 61.4MB in the beginning and 98.2MB in the end (delta: -36.8MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-06-27 16:52:54,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.71ms. Allocated memory is still 138.4MB. Free memory was 98.2MB in the beginning and 89.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-06-27 16:52:54,585 INFO L158 Benchmark]: Boogie Preprocessor took 94.79ms. Allocated memory is still 138.4MB. Free memory was 89.8MB in the beginning and 79.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-06-27 16:52:54,586 INFO L158 Benchmark]: RCFGBuilder took 2611.62ms. Allocated memory was 138.4MB in the beginning and 318.8MB in the end (delta: 180.4MB). Free memory was 79.3MB in the beginning and 193.0MB in the end (delta: -113.7MB). Peak memory consumption was 115.6MB. Max. memory is 16.1GB. [2024-06-27 16:52:54,586 INFO L158 Benchmark]: TraceAbstraction took 706307.10ms. Allocated memory was 318.8MB in the beginning and 3.5GB in the end (delta: 3.2GB). Free memory was 192.0MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-06-27 16:52:54,588 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory was 109.1MB in the beginning and 109.0MB in the end (delta: 139.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.07ms. Allocated memory is still 138.4MB. Free memory was 61.4MB in the beginning and 98.2MB in the end (delta: -36.8MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.71ms. Allocated memory is still 138.4MB. Free memory was 98.2MB in the beginning and 89.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.79ms. Allocated memory is still 138.4MB. Free memory was 89.8MB in the beginning and 79.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 2611.62ms. Allocated memory was 138.4MB in the beginning and 318.8MB in the end (delta: 180.4MB). Free memory was 79.3MB in the beginning and 193.0MB in the end (delta: -113.7MB). Peak memory consumption was 115.6MB. Max. memory is 16.1GB. * TraceAbstraction took 706307.10ms. Allocated memory was 318.8MB in the beginning and 3.5GB in the end (delta: 3.2GB). Free memory was 192.0MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 2.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)) Connection to SMT solver broken 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)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) 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-poker-hand-symm.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 6f8a234fc2a7dd634bd03f872a0d7e8707283ecf0f996c6ed729f53ab07d6660 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:52:56,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:52:56,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-06-27 16:52:56,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:52:56,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:52:56,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:52:56,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:52:56,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:52:56,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:52:56,482 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:52:56,482 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:52:56,482 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:52:56,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:52:56,483 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:52:56,484 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:52:56,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:52:56,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:52:56,484 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:52:56,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:52:56,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:52:56,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:52:56,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:52:56,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:52:56,485 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-06-27 16:52:56,486 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-06-27 16:52:56,486 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:52:56,486 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-06-27 16:52:56,486 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:52:56,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:52:56,486 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:52:56,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:52:56,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:52:56,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:52:56,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:52:56,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:52:56,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:52:56,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:52:56,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:52:56,488 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-06-27 16:52:56,489 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-06-27 16:52:56,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:52:56,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:52:56,489 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:52:56,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:52:56,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:52:56,489 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-06-27 16:52:56,489 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 -> 6f8a234fc2a7dd634bd03f872a0d7e8707283ecf0f996c6ed729f53ab07d6660 [2024-06-27 16:52:56,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:52:56,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:52:56,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:52:56,758 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:52:56,759 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:52:56,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c [2024-06-27 16:52:57,731 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:52:57,907 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:52:57,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c [2024-06-27 16:52:57,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23cfbf42a/671dcb4dd1a6426fa429ace6bda56126/FLAG657d4e308 [2024-06-27 16:52:57,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23cfbf42a/671dcb4dd1a6426fa429ace6bda56126 [2024-06-27 16:52:57,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:52:57,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:52:57,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:52:57,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:52:57,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:52:57,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:52:57" (1/1) ... [2024-06-27 16:52:57,945 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@419bf34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:52:57, skipping insertion in model container [2024-06-27 16:52:57,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:52:57" (1/1) ... [2024-06-27 16:52:57,978 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:52:58,247 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-poker-hand-symm.wvr.c[12847,12860] [2024-06-27 16:52:58,259 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:52:58,268 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-06-27 16:52:58,274 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:52:58,323 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-poker-hand-symm.wvr.c[12847,12860] [2024-06-27 16:52:58,325 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:52:58,332 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:52:58,391 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-poker-hand-symm.wvr.c[12847,12860] [2024-06-27 16:52:58,403 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:52:58,415 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:52:58,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:52:58 WrapperNode [2024-06-27 16:52:58,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:52:58,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:52:58,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:52:58,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:52:58,429 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:52:58" (1/1) ... [2024-06-27 16:52:58,454 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:52:58" (1/1) ... [2024-06-27 16:52:58,511 INFO L138 Inliner]: procedures = 26, calls = 297, calls flagged for inlining = 69, calls inlined = 97, statements flattened = 1543 [2024-06-27 16:52:58,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:52:58,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:52:58,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:52:58,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:52:58,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:52:58" (1/1) ... [2024-06-27 16:52:58,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:52:58" (1/1) ... [2024-06-27 16:52:58,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:52:58" (1/1) ... [2024-06-27 16:52:58,551 INFO L175 MemorySlicer]: Split 186 memory accesses to 2 slices as follows [2, 184]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2024-06-27 16:52:58,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:52:58" (1/1) ... [2024-06-27 16:52:58,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:52:58" (1/1) ... [2024-06-27 16:52:58,594 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:52:58" (1/1) ... [2024-06-27 16:52:58,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:52:58" (1/1) ... [2024-06-27 16:52:58,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:52:58" (1/1) ... [2024-06-27 16:52:58,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:52:58" (1/1) ... [2024-06-27 16:52:58,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:52:58,635 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:52:58,635 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:52:58,635 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:52:58,636 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:52:58" (1/1) ... [2024-06-27 16:52:58,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:52:58,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:52:58,659 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:52:58,666 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:52:58,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:52:58,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-06-27 16:52:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-06-27 16:52:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-06-27 16:52:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-06-27 16:52:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:52:58,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:52:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:52:58,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:52:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 16:52:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 16:52:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 16:52:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:52:58,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:52:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-06-27 16:52:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-06-27 16:52:58,705 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:52:58,866 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:52:58,868 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:53:00,384 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:53:00,385 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:53:01,719 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:53:01,719 INFO L320 CfgBuilder]: Removed 12 assume(true) statements. [2024-06-27 16:53:01,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:53:01 BoogieIcfgContainer [2024-06-27 16:53:01,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:53:01,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:53:01,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:53:01,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:53:01,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:52:57" (1/3) ... [2024-06-27 16:53:01,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3ad39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:53:01, skipping insertion in model container [2024-06-27 16:53:01,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:52:58" (2/3) ... [2024-06-27 16:53:01,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3ad39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:53:01, skipping insertion in model container [2024-06-27 16:53:01,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:53:01" (3/3) ... [2024-06-27 16:53:01,726 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-poker-hand-symm.wvr.c [2024-06-27 16:53:01,732 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:53:01,739 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:53:01,739 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:53:01,739 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:53:01,989 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 16:53:02,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 94 transitions, 202 flow [2024-06-27 16:53:02,078 INFO L124 PetriNetUnfolderBase]: 28/92 cut-off events. [2024-06-27 16:53:02,078 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:53:02,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 92 events. 28/92 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 242 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 71. Up to 7 conditions per place. [2024-06-27 16:53:02,083 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 94 transitions, 202 flow [2024-06-27 16:53:02,086 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 91 transitions, 194 flow [2024-06-27 16:53:02,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:53:02,102 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;@58cc90e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:53:02,102 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 16:53:02,142 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:53:02,143 INFO L124 PetriNetUnfolderBase]: 28/90 cut-off events. [2024-06-27 16:53:02,143 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:53:02,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:53:02,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:53:02,144 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:53:02,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:53:02,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1946787950, now seen corresponding path program 1 times [2024-06-27 16:53:02,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:53:02,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536278411] [2024-06-27 16:53:02,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:53:02,159 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:53:02,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:53:02,161 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:53:02,180 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:53:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:53:02,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 16:53:02,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:53:02,628 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:53:02,628 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:53:02,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:53:02,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536278411] [2024-06-27 16:53:02,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536278411] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:53:02,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:53:02,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:53:02,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673024911] [2024-06-27 16:53:02,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:53:02,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:53:02,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:53:02,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:53:02,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:53:02,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:53:02,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 91 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:53:02,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:53:02,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:53:02,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:53:03,842 INFO L124 PetriNetUnfolderBase]: 2502/3740 cut-off events. [2024-06-27 16:53:03,843 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2024-06-27 16:53:03,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7558 conditions, 3740 events. 2502/3740 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17695 event pairs, 1702 based on Foata normal form. 0/2940 useless extension candidates. Maximal degree in co-relation 7372. Up to 3738 conditions per place. [2024-06-27 16:53:03,857 INFO L140 encePairwiseOnDemand]: 85/94 looper letters, 84 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2024-06-27 16:53:03,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 89 transitions, 366 flow [2024-06-27 16:53:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:53:03,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:53:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-06-27 16:53:03,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36524822695035464 [2024-06-27 16:53:03,867 INFO L175 Difference]: Start difference. First operand has 70 places, 91 transitions, 194 flow. Second operand 3 states and 103 transitions. [2024-06-27 16:53:03,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 89 transitions, 366 flow [2024-06-27 16:53:03,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 89 transitions, 358 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 16:53:03,873 INFO L231 Difference]: Finished difference. Result has 69 places, 89 transitions, 200 flow [2024-06-27 16:53:03,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=69, PETRI_TRANSITIONS=89} [2024-06-27 16:53:03,877 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -1 predicate places. [2024-06-27 16:53:03,877 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 89 transitions, 200 flow [2024-06-27 16:53:03,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:53:03,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:53:03,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:53:03,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-06-27 16:53:04,082 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:53:04,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:53:04,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:53:04,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1365305475, now seen corresponding path program 1 times [2024-06-27 16:53:04,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:53:04,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900659151] [2024-06-27 16:53:04,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:53:04,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:53:04,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:53:04,086 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:53:04,130 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:53:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:53:04,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 16:53:04,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:53:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:53:04,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:53:04,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:53:04,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:53:04,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900659151] [2024-06-27 16:53:04,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900659151] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:53:04,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:53:04,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-06-27 16:53:04,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710447760] [2024-06-27 16:53:04,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:53:04,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:53:04,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:53:04,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:53:04,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:53:04,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:53:04,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 89 transitions, 200 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:53:04,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:53:04,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:53:04,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:53:05,706 INFO L124 PetriNetUnfolderBase]: 2502/3758 cut-off events. [2024-06-27 16:53:05,706 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-06-27 16:53:05,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7559 conditions, 3758 events. 2502/3758 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17721 event pairs, 1702 based on Foata normal form. 3/2962 useless extension candidates. Maximal degree in co-relation 7529. Up to 3738 conditions per place. [2024-06-27 16:53:05,719 INFO L140 encePairwiseOnDemand]: 77/94 looper letters, 78 selfloop transitions, 28 changer transitions 0/107 dead transitions. [2024-06-27 16:53:05,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 107 transitions, 460 flow [2024-06-27 16:53:05,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:53:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:53:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-06-27 16:53:05,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25177304964539005 [2024-06-27 16:53:05,721 INFO L175 Difference]: Start difference. First operand has 69 places, 89 transitions, 200 flow. Second operand 6 states and 142 transitions. [2024-06-27 16:53:05,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 107 transitions, 460 flow [2024-06-27 16:53:05,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 107 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:53:05,724 INFO L231 Difference]: Finished difference. Result has 75 places, 107 transitions, 352 flow [2024-06-27 16:53:05,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=352, PETRI_PLACES=75, PETRI_TRANSITIONS=107} [2024-06-27 16:53:05,724 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 5 predicate places. [2024-06-27 16:53:05,724 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 107 transitions, 352 flow [2024-06-27 16:53:05,725 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:53:05,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:53:05,725 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:53:05,735 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:53:05,929 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:53:05,929 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:53:05,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:53:05,930 INFO L85 PathProgramCache]: Analyzing trace with hash -245215272, now seen corresponding path program 1 times [2024-06-27 16:53:05,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:53:05,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552542890] [2024-06-27 16:53:05,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:53:05,931 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:53:05,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:53:05,932 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:53:05,949 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:53:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:53:06,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:53:06,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:53:06,443 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-06-27 16:53:06,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:53:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-06-27 16:53:06,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:53:06,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552542890] [2024-06-27 16:53:06,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552542890] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:53:06,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:53:06,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-06-27 16:53:06,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295103980] [2024-06-27 16:53:06,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:53:06,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 16:53:06,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:53:06,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 16:53:06,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-06-27 16:53:06,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 94 [2024-06-27 16:53:06,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 107 transitions, 352 flow. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:53:06,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:53:06,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 94 [2024-06-27 16:53:06,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:53:08,759 INFO L124 PetriNetUnfolderBase]: 2502/3774 cut-off events. [2024-06-27 16:53:08,760 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-06-27 16:53:08,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7663 conditions, 3774 events. 2502/3774 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17721 event pairs, 1702 based on Foata normal form. 15/2996 useless extension candidates. Maximal degree in co-relation 7593. Up to 3738 conditions per place. [2024-06-27 16:53:08,773 INFO L140 encePairwiseOnDemand]: 77/94 looper letters, 78 selfloop transitions, 44 changer transitions 0/123 dead transitions. [2024-06-27 16:53:08,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 123 transitions, 664 flow [2024-06-27 16:53:08,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 16:53:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 16:53:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 174 transitions. [2024-06-27 16:53:08,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.15425531914893617 [2024-06-27 16:53:08,778 INFO L175 Difference]: Start difference. First operand has 75 places, 107 transitions, 352 flow. Second operand 12 states and 174 transitions. [2024-06-27 16:53:08,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 123 transitions, 664 flow [2024-06-27 16:53:08,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 123 transitions, 634 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-27 16:53:08,786 INFO L231 Difference]: Finished difference. Result has 88 places, 123 transitions, 540 flow [2024-06-27 16:53:08,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=540, PETRI_PLACES=88, PETRI_TRANSITIONS=123} [2024-06-27 16:53:08,787 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 18 predicate places. [2024-06-27 16:53:08,788 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 123 transitions, 540 flow [2024-06-27 16:53:08,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:53:08,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:53:08,788 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 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, 1, 1, 1, 1] [2024-06-27 16:53:08,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-06-27 16:53:08,994 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:53:08,997 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:53:08,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:53:08,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2114323887, now seen corresponding path program 2 times [2024-06-27 16:53:08,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:53:08,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091461377] [2024-06-27 16:53:08,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:53:08,998 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:53:08,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:53:08,999 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:53:09,001 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 Killed by 15