./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i --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/pthread-ext/11_fmaxsymopt.i -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 6d4b02aa42f7b4e354f6555c82b5caeb47836d867813f6f1b24237fc4ad268ae --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:19:44,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:19:44,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:19:44,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:19:44,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:19:44,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:19:44,722 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:19:44,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:19:44,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:19:44,726 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:19:44,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:19:44,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:19:44,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:19:44,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:19:44,728 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:19:44,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:19:44,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:19:44,729 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:19:44,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:19:44,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:19:44,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:19:44,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:19:44,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:19:44,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:19:44,731 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:19:44,731 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:19:44,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:19:44,732 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:19:44,732 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:19:44,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:19:44,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:19:44,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:19:44,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:19:44,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:19:44,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:19:44,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:19:44,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:19:44,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:19:44,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:19:44,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:19:44,735 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:19:44,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:19:44,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:19:44,737 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 -> 6d4b02aa42f7b4e354f6555c82b5caeb47836d867813f6f1b24237fc4ad268ae [2024-06-27 16:19:44,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:19:44,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:19:44,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:19:44,957 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:19:44,957 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:19:44,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i [2024-06-27 16:19:45,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:19:46,162 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:19:46,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i [2024-06-27 16:19:46,185 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb7d55210/76cd0becd80245329c0e16bc7fac91bc/FLAGacfb3d285 [2024-06-27 16:19:46,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb7d55210/76cd0becd80245329c0e16bc7fac91bc [2024-06-27 16:19:46,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:19:46,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:19:46,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:19:46,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:19:46,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:19:46,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:19:46" (1/1) ... [2024-06-27 16:19:46,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57ac0674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:19:46, skipping insertion in model container [2024-06-27 16:19:46,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:19:46" (1/1) ... [2024-06-27 16:19:46,244 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:19:46,472 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i[30570,30583] [2024-06-27 16:19:46,479 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:19:46,490 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:19:46,523 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i[30570,30583] [2024-06-27 16:19:46,531 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:19:46,571 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:19:46,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:19:46 WrapperNode [2024-06-27 16:19:46,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:19:46,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:19:46,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:19:46,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:19:46,579 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:19:46" (1/1) ... [2024-06-27 16:19:46,603 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:19:46" (1/1) ... [2024-06-27 16:19:46,631 INFO L138 Inliner]: procedures = 170, calls = 24, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 106 [2024-06-27 16:19:46,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:19:46,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:19:46,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:19:46,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:19:46,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:19:46" (1/1) ... [2024-06-27 16:19:46,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:19:46" (1/1) ... [2024-06-27 16:19:46,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:19:46" (1/1) ... [2024-06-27 16:19:46,668 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 1 writes are split as follows [0, 1]. [2024-06-27 16:19:46,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:19:46" (1/1) ... [2024-06-27 16:19:46,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:19:46" (1/1) ... [2024-06-27 16:19:46,679 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:19:46" (1/1) ... [2024-06-27 16:19:46,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:19:46" (1/1) ... [2024-06-27 16:19:46,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:19:46" (1/1) ... [2024-06-27 16:19:46,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:19:46" (1/1) ... [2024-06-27 16:19:46,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:19:46,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:19:46,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:19:46,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:19:46,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:19:46" (1/1) ... [2024-06-27 16:19:46,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:19:46,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:19:46,721 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:19:46,738 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:19:46,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 16:19:46,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 16:19:46,772 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-06-27 16:19:46,772 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-06-27 16:19:46,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 16:19:46,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 16:19:46,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:19:46,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:19:46,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 16:19:46,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:19:46,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:19:46,774 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:19:46,880 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:19:46,881 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:19:47,029 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:19:47,029 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:19:47,132 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:19:47,132 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-06-27 16:19:47,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:19:47 BoogieIcfgContainer [2024-06-27 16:19:47,133 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:19:47,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:19:47,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:19:47,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:19:47,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:19:46" (1/3) ... [2024-06-27 16:19:47,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f643163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:19:47, skipping insertion in model container [2024-06-27 16:19:47,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:19:46" (2/3) ... [2024-06-27 16:19:47,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f643163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:19:47, skipping insertion in model container [2024-06-27 16:19:47,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:19:47" (3/3) ... [2024-06-27 16:19:47,140 INFO L112 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2024-06-27 16:19:47,146 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:19:47,153 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:19:47,153 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:19:47,153 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:19:47,185 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:19:47,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 23 transitions, 50 flow [2024-06-27 16:19:47,228 INFO L124 PetriNetUnfolderBase]: 4/25 cut-off events. [2024-06-27 16:19:47,229 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 16:19:47,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 25 events. 4/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2024-06-27 16:19:47,230 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 23 transitions, 50 flow [2024-06-27 16:19:47,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 23 transitions, 50 flow [2024-06-27 16:19:47,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:19:47,247 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;@4f5c10d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:19:47,247 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 16:19:47,252 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:19:47,252 INFO L124 PetriNetUnfolderBase]: 2/13 cut-off events. [2024-06-27 16:19:47,252 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 16:19:47,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:19:47,253 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-06-27 16:19:47,258 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-06-27 16:19:47,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:19:47,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1300280328, now seen corresponding path program 1 times [2024-06-27 16:19:47,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:19:47,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146324137] [2024-06-27 16:19:47,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:47,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:19:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:19:47,493 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:19:47,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:19:47,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146324137] [2024-06-27 16:19:47,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146324137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:19:47,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:19:47,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:19:47,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398043684] [2024-06-27 16:19:47,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:19:47,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:19:47,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:19:47,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:19:47,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:19:47,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2024-06-27 16:19:47,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 23 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:19:47,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:19:47,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2024-06-27 16:19:47,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:19:47,588 INFO L124 PetriNetUnfolderBase]: 25/69 cut-off events. [2024-06-27 16:19:47,589 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 16:19:47,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 69 events. 25/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 144 event pairs, 18 based on Foata normal form. 3/65 useless extension candidates. Maximal degree in co-relation 112. Up to 56 conditions per place. [2024-06-27 16:19:47,592 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 15 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2024-06-27 16:19:47,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 22 transitions, 82 flow [2024-06-27 16:19:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:19:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:19:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2024-06-27 16:19:47,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2024-06-27 16:19:47,602 INFO L175 Difference]: Start difference. First operand has 22 places, 23 transitions, 50 flow. Second operand 3 states and 35 transitions. [2024-06-27 16:19:47,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 22 transitions, 82 flow [2024-06-27 16:19:47,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 22 transitions, 82 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:19:47,606 INFO L231 Difference]: Finished difference. Result has 24 places, 22 transitions, 58 flow [2024-06-27 16:19:47,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=24, PETRI_TRANSITIONS=22} [2024-06-27 16:19:47,610 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 2 predicate places. [2024-06-27 16:19:47,610 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 22 transitions, 58 flow [2024-06-27 16:19:47,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:19:47,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:19:47,611 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-06-27 16:19:47,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:19:47,611 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-06-27 16:19:47,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:19:47,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2062893396, now seen corresponding path program 1 times [2024-06-27 16:19:47,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:19:47,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511282247] [2024-06-27 16:19:47,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:47,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:19:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:19:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:19:47,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:19:47,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511282247] [2024-06-27 16:19:47,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511282247] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:19:47,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530350845] [2024-06-27 16:19:47,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:47,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:19:47,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:19:47,676 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:19:47,677 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:19:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:19:47,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-27 16:19:47,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:19:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:19:47,760 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:19:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:19:47,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530350845] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:19:47,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:19:47,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-06-27 16:19:47,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108864932] [2024-06-27 16:19:47,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:19:47,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 16:19:47,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:19:47,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 16:19:47,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-06-27 16:19:47,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2024-06-27 16:19:47,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 22 transitions, 58 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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:19:47,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:19:47,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2024-06-27 16:19:47,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:19:47,849 INFO L124 PetriNetUnfolderBase]: 25/72 cut-off events. [2024-06-27 16:19:47,849 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 16:19:47,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 72 events. 25/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 144 event pairs, 18 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 134. Up to 56 conditions per place. [2024-06-27 16:19:47,851 INFO L140 encePairwiseOnDemand]: 20/23 looper letters, 15 selfloop transitions, 5 changer transitions 0/25 dead transitions. [2024-06-27 16:19:47,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 25 transitions, 110 flow [2024-06-27 16:19:47,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:19:47,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:19:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2024-06-27 16:19:47,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38405797101449274 [2024-06-27 16:19:47,855 INFO L175 Difference]: Start difference. First operand has 24 places, 22 transitions, 58 flow. Second operand 6 states and 53 transitions. [2024-06-27 16:19:47,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 25 transitions, 110 flow [2024-06-27 16:19:47,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 106 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 16:19:47,856 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 90 flow [2024-06-27 16:19:47,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-06-27 16:19:47,858 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 9 predicate places. [2024-06-27 16:19:47,858 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 90 flow [2024-06-27 16:19:47,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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:19:47,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:19:47,861 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2024-06-27 16:19:47,876 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:19:48,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:19:48,074 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-06-27 16:19:48,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:19:48,074 INFO L85 PathProgramCache]: Analyzing trace with hash 452969208, now seen corresponding path program 2 times [2024-06-27 16:19:48,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:19:48,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247093889] [2024-06-27 16:19:48,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:48,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:19:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:19:48,174 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:19:48,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:19:48,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247093889] [2024-06-27 16:19:48,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247093889] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:19:48,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7704562] [2024-06-27 16:19:48,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:19:48,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:19:48,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:19:48,176 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:19:48,184 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:19:48,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:19:48,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:19:48,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 16:19:48,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:19:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:19:48,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:19:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:19:48,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7704562] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:19:48,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:19:48,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-06-27 16:19:48,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511714300] [2024-06-27 16:19:48,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:19:48,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 16:19:48,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:19:48,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 16:19:48,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-06-27 16:19:48,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2024-06-27 16:19:48,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 90 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:19:48,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:19:48,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2024-06-27 16:19:48,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:19:48,348 INFO L124 PetriNetUnfolderBase]: 25/74 cut-off events. [2024-06-27 16:19:48,348 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-06-27 16:19:48,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 74 events. 25/74 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 144 event pairs, 18 based on Foata normal form. 2/70 useless extension candidates. Maximal degree in co-relation 125. Up to 56 conditions per place. [2024-06-27 16:19:48,350 INFO L140 encePairwiseOnDemand]: 20/23 looper letters, 15 selfloop transitions, 7 changer transitions 0/27 dead transitions. [2024-06-27 16:19:48,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 146 flow [2024-06-27 16:19:48,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 16:19:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 16:19:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2024-06-27 16:19:48,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34782608695652173 [2024-06-27 16:19:48,354 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 90 flow. Second operand 8 states and 64 transitions. [2024-06-27 16:19:48,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 146 flow [2024-06-27 16:19:48,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 132 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-27 16:19:48,357 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 112 flow [2024-06-27 16:19:48,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=112, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2024-06-27 16:19:48,359 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 17 predicate places. [2024-06-27 16:19:48,359 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 112 flow [2024-06-27 16:19:48,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:19:48,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:19:48,359 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 2, 1, 1, 1, 1, 1] [2024-06-27 16:19:48,389 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:19:48,592 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,SelfDestructingSolverStorable2 [2024-06-27 16:19:48,592 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-06-27 16:19:48,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:19:48,593 INFO L85 PathProgramCache]: Analyzing trace with hash 192720504, now seen corresponding path program 3 times [2024-06-27 16:19:48,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:19:48,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953218710] [2024-06-27 16:19:48,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:48,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:19:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:19:48,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:19:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:19:48,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:19:48,662 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:19:48,662 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-06-27 16:19:48,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-06-27 16:19:48,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-06-27 16:19:48,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 16:19:48,665 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2024-06-27 16:19:48,667 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:19:48,667 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-06-27 16:19:48,687 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:19:48,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 39 transitions, 88 flow [2024-06-27 16:19:48,697 INFO L124 PetriNetUnfolderBase]: 7/44 cut-off events. [2024-06-27 16:19:48,697 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:19:48,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 44 events. 7/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 101 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 33. Up to 3 conditions per place. [2024-06-27 16:19:48,698 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 39 transitions, 88 flow [2024-06-27 16:19:48,699 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 39 transitions, 88 flow [2024-06-27 16:19:48,700 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:19:48,702 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;@4f5c10d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:19:48,702 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 16:19:48,707 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:19:48,707 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2024-06-27 16:19:48,707 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 16:19:48,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:19:48,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:19:48,708 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-06-27 16:19:48,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:19:48,708 INFO L85 PathProgramCache]: Analyzing trace with hash -982383914, now seen corresponding path program 1 times [2024-06-27 16:19:48,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:19:48,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145313782] [2024-06-27 16:19:48,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:48,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:19:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:19:48,733 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:19:48,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:19:48,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145313782] [2024-06-27 16:19:48,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145313782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:19:48,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:19:48,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:19:48,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711391904] [2024-06-27 16:19:48,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:19:48,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:19:48,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:19:48,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:19:48,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:19:48,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-06-27 16:19:48,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:19:48,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:19:48,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-06-27 16:19:48,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:19:48,832 INFO L124 PetriNetUnfolderBase]: 553/1026 cut-off events. [2024-06-27 16:19:48,833 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-06-27 16:19:48,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 1026 events. 553/1026 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4736 event pairs, 468 based on Foata normal form. 95/1006 useless extension candidates. Maximal degree in co-relation 1168. Up to 866 conditions per place. [2024-06-27 16:19:48,839 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 26 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2024-06-27 16:19:48,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 140 flow [2024-06-27 16:19:48,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:19:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:19:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-06-27 16:19:48,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042735042735043 [2024-06-27 16:19:48,841 INFO L175 Difference]: Start difference. First operand has 37 places, 39 transitions, 88 flow. Second operand 3 states and 59 transitions. [2024-06-27 16:19:48,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 140 flow [2024-06-27 16:19:48,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:19:48,842 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 94 flow [2024-06-27 16:19:48,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2024-06-27 16:19:48,843 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2024-06-27 16:19:48,843 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 94 flow [2024-06-27 16:19:48,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:19:48,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:19:48,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:19:48,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 16:19:48,844 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-06-27 16:19:48,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:19:48,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1574460895, now seen corresponding path program 1 times [2024-06-27 16:19:48,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:19:48,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273591052] [2024-06-27 16:19:48,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:48,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:19:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:19:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:19:48,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:19:48,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273591052] [2024-06-27 16:19:48,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273591052] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:19:48,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034300323] [2024-06-27 16:19:48,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:48,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:19:48,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:19:48,872 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:19:48,873 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:19:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:19:48,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-27 16:19:48,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:19:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:19:48,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:19:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:19:48,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034300323] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:19:48,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:19:48,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-06-27 16:19:48,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700722981] [2024-06-27 16:19:48,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:19:48,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 16:19:48,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:19:48,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 16:19:48,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-06-27 16:19:48,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-06-27 16:19:48,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 94 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:19:48,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:19:48,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-06-27 16:19:48,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:19:49,059 INFO L124 PetriNetUnfolderBase]: 553/1029 cut-off events. [2024-06-27 16:19:49,060 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-06-27 16:19:49,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1944 conditions, 1029 events. 553/1029 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4736 event pairs, 468 based on Foata normal form. 0/914 useless extension candidates. Maximal degree in co-relation 1931. Up to 866 conditions per place. [2024-06-27 16:19:49,065 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 26 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2024-06-27 16:19:49,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 168 flow [2024-06-27 16:19:49,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:19:49,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:19:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-06-27 16:19:49,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37606837606837606 [2024-06-27 16:19:49,068 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 94 flow. Second operand 6 states and 88 transitions. [2024-06-27 16:19:49,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 168 flow [2024-06-27 16:19:49,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 164 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 16:19:49,071 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 126 flow [2024-06-27 16:19:49,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2024-06-27 16:19:49,073 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2024-06-27 16:19:49,073 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 126 flow [2024-06-27 16:19:49,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:19:49,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:19:49,073 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:19:49,098 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:19:49,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:19:49,289 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-06-27 16:19:49,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:19:49,289 INFO L85 PathProgramCache]: Analyzing trace with hash 361037206, now seen corresponding path program 2 times [2024-06-27 16:19:49,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:19:49,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004641404] [2024-06-27 16:19:49,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:49,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:19:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:19:49,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:19:49,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:19:49,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004641404] [2024-06-27 16:19:49,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004641404] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:19:49,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586805893] [2024-06-27 16:19:49,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:19:49,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:19:49,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:19:49,346 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:19:49,347 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:19:49,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-06-27 16:19:49,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:19:49,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2024-06-27 16:19:49,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:19:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-06-27 16:19:49,420 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:19:49,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586805893] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:19:49,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:19:49,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-06-27 16:19:49,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362237787] [2024-06-27 16:19:49,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:19:49,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:19:49,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:19:49,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:19:49,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 16:19:49,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-06-27 16:19:49,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:19:49,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:19:49,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-06-27 16:19:49,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:19:49,600 INFO L124 PetriNetUnfolderBase]: 951/1747 cut-off events. [2024-06-27 16:19:49,600 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-06-27 16:19:49,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3331 conditions, 1747 events. 951/1747 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9291 event pairs, 418 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 3296. Up to 784 conditions per place. [2024-06-27 16:19:49,609 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 50 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-06-27 16:19:49,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 60 transitions, 275 flow [2024-06-27 16:19:49,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:19:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:19:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-06-27 16:19:49,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6239316239316239 [2024-06-27 16:19:49,611 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 126 flow. Second operand 3 states and 73 transitions. [2024-06-27 16:19:49,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 60 transitions, 275 flow [2024-06-27 16:19:49,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 261 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-27 16:19:49,614 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 126 flow [2024-06-27 16:19:49,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2024-06-27 16:19:49,619 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2024-06-27 16:19:49,620 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 126 flow [2024-06-27 16:19:49,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:19:49,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:19:49,622 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2024-06-27 16:19:49,638 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:19:49,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:19:49,836 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-06-27 16:19:49,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:19:49,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1858755249, now seen corresponding path program 1 times [2024-06-27 16:19:49,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:19:49,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369822855] [2024-06-27 16:19:49,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:49,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:19:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:19:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 16:19:49,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:19:49,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369822855] [2024-06-27 16:19:49,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369822855] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:19:49,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830666341] [2024-06-27 16:19:49,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:49,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:19:49,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:19:49,897 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:19:49,898 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:19:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:19:49,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 16:19:49,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:19:49,981 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 16:19:49,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:19:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 16:19:50,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830666341] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:19:50,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:19:50,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-06-27 16:19:50,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78357850] [2024-06-27 16:19:50,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:19:50,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 16:19:50,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:19:50,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 16:19:50,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-06-27 16:19:50,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-06-27 16:19:50,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 126 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:19:50,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:19:50,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-06-27 16:19:50,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:19:50,179 INFO L124 PetriNetUnfolderBase]: 966/1792 cut-off events. [2024-06-27 16:19:50,180 INFO L125 PetriNetUnfolderBase]: For 266/266 co-relation queries the response was YES. [2024-06-27 16:19:50,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3575 conditions, 1792 events. 966/1792 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9551 event pairs, 818 based on Foata normal form. 2/1650 useless extension candidates. Maximal degree in co-relation 3537. Up to 1501 conditions per place. [2024-06-27 16:19:50,188 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 28 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-27 16:19:50,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 208 flow [2024-06-27 16:19:50,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 16:19:50,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 16:19:50,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-27 16:19:50,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34294871794871795 [2024-06-27 16:19:50,189 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 126 flow. Second operand 8 states and 107 transitions. [2024-06-27 16:19:50,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 208 flow [2024-06-27 16:19:50,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:19:50,192 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 158 flow [2024-06-27 16:19:50,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=158, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2024-06-27 16:19:50,192 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2024-06-27 16:19:50,192 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 158 flow [2024-06-27 16:19:50,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:19:50,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:19:50,193 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1] [2024-06-27 16:19:50,208 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:19:50,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:19:50,409 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-06-27 16:19:50,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:19:50,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2012022447, now seen corresponding path program 2 times [2024-06-27 16:19:50,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:19:50,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046320891] [2024-06-27 16:19:50,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:50,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:19:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:19:50,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:19:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:19:50,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:19:50,443 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:19:50,443 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-27 16:19:50,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-06-27 16:19:50,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-06-27 16:19:50,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-06-27 16:19:50,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 16:19:50,444 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1] [2024-06-27 16:19:50,444 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:19:50,444 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-06-27 16:19:50,465 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:19:50,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 55 transitions, 128 flow [2024-06-27 16:19:50,472 INFO L124 PetriNetUnfolderBase]: 10/63 cut-off events. [2024-06-27 16:19:50,472 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-06-27 16:19:50,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 10/63 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 163 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2024-06-27 16:19:50,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 55 transitions, 128 flow [2024-06-27 16:19:50,474 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 55 transitions, 128 flow [2024-06-27 16:19:50,474 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:19:50,477 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;@4f5c10d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:19:50,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 16:19:50,479 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:19:50,479 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2024-06-27 16:19:50,479 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 16:19:50,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:19:50,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:19:50,480 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 16:19:50,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:19:50,481 INFO L85 PathProgramCache]: Analyzing trace with hash -703058203, now seen corresponding path program 1 times [2024-06-27 16:19:50,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:19:50,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107274630] [2024-06-27 16:19:50,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:50,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:19:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:19:50,519 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:19:50,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:19:50,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107274630] [2024-06-27 16:19:50,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107274630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:19:50,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:19:50,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:19:50,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906831884] [2024-06-27 16:19:50,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:19:50,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:19:50,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:19:50,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:19:50,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:19:50,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 55 [2024-06-27 16:19:50,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 128 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:19:50,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:19:50,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 55 [2024-06-27 16:19:50,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:19:51,398 INFO L124 PetriNetUnfolderBase]: 8815/13572 cut-off events. [2024-06-27 16:19:51,398 INFO L125 PetriNetUnfolderBase]: For 700/700 co-relation queries the response was YES. [2024-06-27 16:19:51,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25975 conditions, 13572 events. 8815/13572 cut-off events. For 700/700 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 81293 event pairs, 7668 based on Foata normal form. 1610/13657 useless extension candidates. Maximal degree in co-relation 5896. Up to 11966 conditions per place. [2024-06-27 16:19:51,472 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 37 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-06-27 16:19:51,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 200 flow [2024-06-27 16:19:51,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:19:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:19:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-06-27 16:19:51,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503030303030303 [2024-06-27 16:19:51,473 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 128 flow. Second operand 3 states and 83 transitions. [2024-06-27 16:19:51,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 200 flow [2024-06-27 16:19:51,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 198 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-27 16:19:51,477 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 130 flow [2024-06-27 16:19:51,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2024-06-27 16:19:51,478 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2024-06-27 16:19:51,478 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 130 flow [2024-06-27 16:19:51,478 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:19:51,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:19:51,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:19:51,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 16:19:51,479 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 16:19:51,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:19:51,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1920882841, now seen corresponding path program 1 times [2024-06-27 16:19:51,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:19:51,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187339257] [2024-06-27 16:19:51,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:51,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:19:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:19:51,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:19:51,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:19:51,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187339257] [2024-06-27 16:19:51,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187339257] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:19:51,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826719507] [2024-06-27 16:19:51,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:51,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:19:51,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:19:51,511 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:19:51,534 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:19:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:19:51,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-27 16:19:51,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:19:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:19:51,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:19:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:19:51,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826719507] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:19:51,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:19:51,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-06-27 16:19:51,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560300862] [2024-06-27 16:19:51,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:19:51,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 16:19:51,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:19:51,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 16:19:51,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-06-27 16:19:51,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 55 [2024-06-27 16:19:51,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 130 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:19:51,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:19:51,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 55 [2024-06-27 16:19:51,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:19:52,490 INFO L124 PetriNetUnfolderBase]: 8815/13575 cut-off events. [2024-06-27 16:19:52,490 INFO L125 PetriNetUnfolderBase]: For 404/404 co-relation queries the response was YES. [2024-06-27 16:19:52,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25891 conditions, 13575 events. 8815/13575 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 81322 event pairs, 7668 based on Foata normal form. 0/12050 useless extension candidates. Maximal degree in co-relation 25877. Up to 11966 conditions per place. [2024-06-27 16:19:52,559 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 37 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2024-06-27 16:19:52,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 226 flow [2024-06-27 16:19:52,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:19:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:19:52,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-06-27 16:19:52,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2024-06-27 16:19:52,561 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 130 flow. Second operand 6 states and 123 transitions. [2024-06-27 16:19:52,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 226 flow [2024-06-27 16:19:52,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 55 transitions, 222 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 16:19:52,563 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 162 flow [2024-06-27 16:19:52,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2024-06-27 16:19:52,564 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2024-06-27 16:19:52,564 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 162 flow [2024-06-27 16:19:52,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:19:52,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:19:52,565 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:19:52,585 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:19:52,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:19:52,780 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 16:19:52,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:19:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash 552812389, now seen corresponding path program 2 times [2024-06-27 16:19:52,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:19:52,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381584759] [2024-06-27 16:19:52,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:52,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:19:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:19:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-06-27 16:19:52,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:19:52,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381584759] [2024-06-27 16:19:52,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381584759] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:19:52,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:19:52,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:19:52,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026945797] [2024-06-27 16:19:52,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:19:52,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:19:52,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:19:52,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:19:52,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:19:52,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-06-27 16:19:52,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:19:52,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:19:52,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-06-27 16:19:52,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:19:54,292 INFO L124 PetriNetUnfolderBase]: 15165/23116 cut-off events. [2024-06-27 16:19:54,292 INFO L125 PetriNetUnfolderBase]: For 627/627 co-relation queries the response was YES. [2024-06-27 16:19:54,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44381 conditions, 23116 events. 15165/23116 cut-off events. For 627/627 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 151315 event pairs, 6868 based on Foata normal form. 0/20536 useless extension candidates. Maximal degree in co-relation 44345. Up to 10774 conditions per place. [2024-06-27 16:19:54,409 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 72 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2024-06-27 16:19:54,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 382 flow [2024-06-27 16:19:54,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:19:54,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:19:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-06-27 16:19:54,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2024-06-27 16:19:54,411 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 162 flow. Second operand 3 states and 107 transitions. [2024-06-27 16:19:54,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 382 flow [2024-06-27 16:19:54,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 86 transitions, 368 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-27 16:19:54,413 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 162 flow [2024-06-27 16:19:54,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2024-06-27 16:19:54,414 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2024-06-27 16:19:54,414 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 162 flow [2024-06-27 16:19:54,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:19:54,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:19:54,414 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:19:54,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 16:19:54,415 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 16:19:54,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:19:54,415 INFO L85 PathProgramCache]: Analyzing trace with hash -903534563, now seen corresponding path program 1 times [2024-06-27 16:19:54,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:19:54,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181978359] [2024-06-27 16:19:54,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:54,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:19:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:19:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-06-27 16:19:54,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:19:54,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181978359] [2024-06-27 16:19:54,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181978359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:19:54,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:19:54,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:19:54,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561767113] [2024-06-27 16:19:54,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:19:54,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:19:54,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:19:54,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:19:54,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:19:54,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-06-27 16:19:54,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 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:19:54,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:19:54,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-06-27 16:19:54,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:19:56,696 INFO L124 PetriNetUnfolderBase]: 26272/39836 cut-off events. [2024-06-27 16:19:56,696 INFO L125 PetriNetUnfolderBase]: For 5442/5442 co-relation queries the response was YES. [2024-06-27 16:19:56,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79790 conditions, 39836 events. 26272/39836 cut-off events. For 5442/5442 co-relation queries the response was YES. Maximal size of possible extension queue 1144. Compared 277963 event pairs, 11890 based on Foata normal form. 0/36383 useless extension candidates. Maximal degree in co-relation 79759. Up to 18619 conditions per place. [2024-06-27 16:19:57,084 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 75 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2024-06-27 16:19:57,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 88 transitions, 397 flow [2024-06-27 16:19:57,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:19:57,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:19:57,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-06-27 16:19:57,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-06-27 16:19:57,086 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 162 flow. Second operand 3 states and 106 transitions. [2024-06-27 16:19:57,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 88 transitions, 397 flow [2024-06-27 16:19:57,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 88 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:19:57,126 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 172 flow [2024-06-27 16:19:57,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-06-27 16:19:57,126 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2024-06-27 16:19:57,126 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 172 flow [2024-06-27 16:19:57,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 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:19:57,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:19:57,127 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:19:57,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 16:19:57,127 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 16:19:57,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:19:57,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1225656256, now seen corresponding path program 1 times [2024-06-27 16:19:57,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:19:57,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134069811] [2024-06-27 16:19:57,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:57,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:19:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:19:57,160 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-06-27 16:19:57,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:19:57,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134069811] [2024-06-27 16:19:57,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134069811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:19:57,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:19:57,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:19:57,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126623839] [2024-06-27 16:19:57,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:19:57,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:19:57,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:19:57,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:19:57,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:19:57,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 55 [2024-06-27 16:19:57,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:19:57,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:19:57,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 55 [2024-06-27 16:19:57,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:19:58,758 INFO L124 PetriNetUnfolderBase]: 18188/28196 cut-off events. [2024-06-27 16:19:58,758 INFO L125 PetriNetUnfolderBase]: For 4576/4576 co-relation queries the response was YES. [2024-06-27 16:19:58,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57691 conditions, 28196 events. 18188/28196 cut-off events. For 4576/4576 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 193298 event pairs, 12332 based on Foata normal form. 564/26927 useless extension candidates. Maximal degree in co-relation 57659. Up to 20630 conditions per place. [2024-06-27 16:19:58,966 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 70 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-06-27 16:19:58,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 83 transitions, 388 flow [2024-06-27 16:19:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:19:58,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:19:58,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-06-27 16:19:58,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2024-06-27 16:19:58,969 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 172 flow. Second operand 3 states and 104 transitions. [2024-06-27 16:19:58,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 83 transitions, 388 flow [2024-06-27 16:19:59,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:19:59,032 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 176 flow [2024-06-27 16:19:59,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2024-06-27 16:19:59,033 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2024-06-27 16:19:59,034 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 176 flow [2024-06-27 16:19:59,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:19:59,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:19:59,034 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1] [2024-06-27 16:19:59,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 16:19:59,034 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 16:19:59,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:19:59,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2079753419, now seen corresponding path program 1 times [2024-06-27 16:19:59,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:19:59,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102886242] [2024-06-27 16:19:59,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:59,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:19:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:19:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-06-27 16:19:59,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:19:59,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102886242] [2024-06-27 16:19:59,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102886242] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:19:59,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707994230] [2024-06-27 16:19:59,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:19:59,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:19:59,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:19:59,096 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:19:59,098 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:19:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:19:59,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 16:19:59,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:19:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-06-27 16:19:59,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:19:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-06-27 16:19:59,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707994230] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:19:59,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:19:59,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-06-27 16:19:59,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390068544] [2024-06-27 16:19:59,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:19:59,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 16:19:59,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:19:59,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 16:19:59,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-06-27 16:19:59,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 55 [2024-06-27 16:19:59,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 176 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have 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:19:59,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:19:59,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 55 [2024-06-27 16:19:59,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:20:00,922 INFO L124 PetriNetUnfolderBase]: 18248/28518 cut-off events. [2024-06-27 16:20:00,922 INFO L125 PetriNetUnfolderBase]: For 6735/6735 co-relation queries the response was YES. [2024-06-27 16:20:01,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60048 conditions, 28518 events. 18248/28518 cut-off events. For 6735/6735 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 195304 event pairs, 16009 based on Foata normal form. 2/26585 useless extension candidates. Maximal degree in co-relation 60007. Up to 24750 conditions per place. [2024-06-27 16:20:01,158 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 41 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2024-06-27 16:20:01,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 59 transitions, 284 flow [2024-06-27 16:20:01,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 16:20:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 16:20:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-27 16:20:01,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2024-06-27 16:20:01,160 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 176 flow. Second operand 8 states and 150 transitions. [2024-06-27 16:20:01,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 59 transitions, 284 flow [2024-06-27 16:20:01,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 59 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:20:01,209 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 210 flow [2024-06-27 16:20:01,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2024-06-27 16:20:01,210 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2024-06-27 16:20:01,210 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 210 flow [2024-06-27 16:20:01,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have 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:20:01,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:20:01,211 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 4, 3, 1, 1, 1, 1, 1, 1] [2024-06-27 16:20:01,224 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:20:01,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:20:01,412 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 16:20:01,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:20:01,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1524059403, now seen corresponding path program 2 times [2024-06-27 16:20:01,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:20:01,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337971175] [2024-06-27 16:20:01,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:20:01,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:20:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:20:01,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:20:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:20:01,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:20:01,452 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:20:01,453 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-06-27 16:20:01,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-06-27 16:20:01,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-06-27 16:20:01,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-06-27 16:20:01,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-06-27 16:20:01,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 16:20:01,454 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2024-06-27 16:20:01,455 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:20:01,455 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-06-27 16:20:01,489 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:20:01,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 71 transitions, 170 flow [2024-06-27 16:20:01,496 INFO L124 PetriNetUnfolderBase]: 13/82 cut-off events. [2024-06-27 16:20:01,496 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-06-27 16:20:01,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 82 events. 13/82 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 240 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 73. Up to 5 conditions per place. [2024-06-27 16:20:01,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 71 transitions, 170 flow [2024-06-27 16:20:01,497 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 71 transitions, 170 flow [2024-06-27 16:20:01,500 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:20:01,501 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;@4f5c10d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:20:01,501 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-27 16:20:01,503 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:20:01,503 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2024-06-27 16:20:01,503 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 16:20:01,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:20:01,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:20:01,504 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-06-27 16:20:01,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:20:01,504 INFO L85 PathProgramCache]: Analyzing trace with hash -814584140, now seen corresponding path program 1 times [2024-06-27 16:20:01,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:20:01,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214795739] [2024-06-27 16:20:01,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:20:01,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:20:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:20:01,521 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:20:01,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:20:01,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214795739] [2024-06-27 16:20:01,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214795739] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:20:01,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:20:01,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:20:01,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26010631] [2024-06-27 16:20:01,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:20:01,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:20:01,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:20:01,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:20:01,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:20:01,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 71 [2024-06-27 16:20:01,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:20:01,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:20:01,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 71 [2024-06-27 16:20:01,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:20:11,240 INFO L124 PetriNetUnfolderBase]: 121435/168971 cut-off events. [2024-06-27 16:20:11,240 INFO L125 PetriNetUnfolderBase]: For 12016/12016 co-relation queries the response was YES. [2024-06-27 16:20:11,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327375 conditions, 168971 events. 121435/168971 cut-off events. For 12016/12016 co-relation queries the response was YES. Maximal size of possible extension queue 3686. Compared 1155719 event pairs, 106668 based on Foata normal form. 22769/173133 useless extension candidates. Maximal degree in co-relation 26075. Up to 152966 conditions per place. [2024-06-27 16:20:12,100 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 48 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2024-06-27 16:20:12,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 67 transitions, 262 flow [2024-06-27 16:20:12,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:20:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:20:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-06-27 16:20:12,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023474178403756 [2024-06-27 16:20:12,101 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 170 flow. Second operand 3 states and 107 transitions. [2024-06-27 16:20:12,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 67 transitions, 262 flow [2024-06-27 16:20:12,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 256 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-06-27 16:20:12,108 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 166 flow [2024-06-27 16:20:12,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2024-06-27 16:20:12,108 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 2 predicate places. [2024-06-27 16:20:12,109 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 166 flow [2024-06-27 16:20:12,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:20:12,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:20:12,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:20:12,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 16:20:12,109 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-06-27 16:20:12,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:20:12,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1512656771, now seen corresponding path program 1 times [2024-06-27 16:20:12,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:20:12,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863296197] [2024-06-27 16:20:12,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:20:12,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:20:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:20:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:20:12,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:20:12,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863296197] [2024-06-27 16:20:12,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863296197] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:20:12,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398511356] [2024-06-27 16:20:12,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:20:12,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:20:12,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:20:12,132 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:20:12,133 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:20:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:20:12,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-27 16:20:12,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:20:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:20:12,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:20:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:20:12,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398511356] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:20:12,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:20:12,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-06-27 16:20:12,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444267542] [2024-06-27 16:20:12,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:20:12,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 16:20:12,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:20:12,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 16:20:12,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-06-27 16:20:12,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 71 [2024-06-27 16:20:12,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 166 flow. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have 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:20:12,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:20:12,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 71 [2024-06-27 16:20:12,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand